A Combined Localization and Geographic Routing Algorithm for Rapidly-Deployed Wireless Sensor Networks

Authors:
Hui Qu;Stephen B. Wicker
Affiliations:
School of Electrical and Computer Engineering, Cornell University, Ithaca, New York, USA;School of Electrical and Computer Engineering, Cornell University, Ithaca, New York, USA
Venue:
International Journal of Distributed Sensor Networks - Selected Papers in Innovations and Real-Time Applications of Distributed Sensor Networks
Year:
2008

Citing 8
Cited 1

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
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
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

A joint routing and localization algorithm for emergency scenario

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network of randomly-deployed, low-cost sensors and a single powerful sink node. A partition-based localization algorithm is proposed in which the sink node imparts sector-based location information through the phased-array transmission of a series of beacons. One-hop neighbor information is used by each sensor in a series of sector-partitioning routines to identify the sub-sector in which it resides. A geographic routing algorithm is then proposed which uses the sector-based localization results as the basis for a routing algorithm. Simulation results indicate that the performance of our localization algorithm improves with node density, and that the performance of the combined localization and routing algorithm in the presence of severe measurement noise is comparable with that provided by the same routing algorithm using perfect location information.