A Map-growing Localization Algorithm for Ad-hoc Wireless Sensor Networks

Authors:
Xiaoli Li;Hongchi Shi;Yi Shang
Affiliations:
University of Missouri-Columbia;University of Missouri-Columbia;University of Missouri-Columbia
Venue:
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Year:
2004

Citing 0
Cited 3

UWB Location and tracking for wireless embedded networks

Signal Processing - Signal processing in UWB communications
Energy cost and error performance of range-aware, anchor-free localization algorithms

Ad Hoc Networks
A distributed localization scheme for wireless sensor networks

Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Localization is an important process in deploying ad-hocwireless sensor networks.Several localization algorithmshave been developed.However, they do not achieve satisfactoryperformance on irregular networks.In this paper,we present a localization algorithm based on an idea ofgrowing local maps.Simulation was performed on networksof different shapes with different connectivity and anchor.Compared with APS DV-distance [Ad-hoc positioning system], the map-growingalgorithm is about two times more accurate for C-shpaedgrid or hexagon networks with the same coverage as of APSDV-distance, when the range error is less than or equal to10%R, where R is the radio range.Compared with APSEuclidean [Ad-hoc positioning system], the coverage of map-growing is 100% withlow GPS ratio while APS Euclidean requires a higher GPSratio to get a better coverage.