Sciweavers

103 search results - page 2 / 21
» Some Fundamental Results on Base Station Movement Problem fo...
Sort
View
CN
2010
183views more  CN 2010»
13 years 5 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
TPDS
2008
157views more  TPDS 2008»
13 years 4 months ago
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
Bin Xiao, Hekang Chen, Shuigeng Zhou
TON
2010
197views more  TON 2010»
13 years 3 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
DMSN
2007
ACM
13 years 8 months ago
Similarity-aware query allocation in sensor networks with multiple base stations
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
IJDSN
2010
147views more  IJDSN 2010»
12 years 11 months ago
Position-Based Aggregator Node Election in Wireless Sensor Networks
In this paper, we introduce PANEL, a position-based aggregator node election protocol for wireless sensor networks. The novelty of PANEL with respect to other aggregator node elec...
Levente Buttyán, Péter Schaffer