Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
SELAR: Scalable Energy-Efficient Location Aided Routing Protocol for Wireless Sensor Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Geographic routing with limited information in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The Impact of Location Errors on Geographic Routing in Sensor Networks
ICCGI '06 Proceedings of the International Multi-Conference on Computing in the Global Information Technology
Hi-index | 0.00 |
We consider a wireless sensor network consisting of a single sink node at the center of a field of randomly distributed sensors. A simple anchor-free localization algorithm is proposed, in which the sink node imparts radial location information through the phased-array transmission of a series of beacons. Each individual sensor uses the knowledge of received beacons as well as information from neighbors to continue partitioning current sectors and identifying sub-sectors in which it resides until an accuracy requirement is satisfied. An energy-preserving routing algorithm is then proposed which uses the localization results as the basis for selecting relay nodes. We present the localization algorithm, analyze its partition errors as well as its impact on communication energy consumption, and then present the location-based routing algorithm. Simulation results indicate that the performance of our co-designed localization and routing algorithm in the presence of severe noise is as good as that provided by a shortest-path routing algorithm under ideal assumptions; therefore, our co-designing approach can achieve high performance with lightweight algorithms.