By Topic

A map-growing localization algorithm for ad-hoc wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoli Li ; Dept. of Comput. Sci., Missouri Univ., Columbia, MO, USA ; Hongchi Shi ; Yi Shang

Localization is an important process in deploying ad-hoc wireless sensor networks. Several localization algorithms have been developed. However, they do not achieve satisfactory performance on irregular networks. In this paper, we present a localization algorithm based on an idea of growing local maps. Simulation was performed on networks of different shapes with different connectivity and anchor. Compared with APS DV-distance (Niculescu and Nath, 2001), the map-growing algorithm is about two times more accurate for C-shaped grid or hexagon networks with the same coverage as of APS DV-distance, when the range error is less than or equal to 10%R, where R is the radio range. Compared with APS Euclidean (Niculescu and Nath, 2001), the coverage of map-growing is 100% with low GPS ratio while APS Euclidean requires a higher GPS ratio to get a better coverage.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004