Range-Free Localization Schemes for Large Scale Sensor Networks

Report
Authors:He, Tian, Department of Computer ScienceUniversity of Virginia Huang, Chengdu, Department of Computer ScienceUniversity of Virginia Blum, Brian, Department of Computer ScienceUniversity of Virginia Stankovic, John, Department of Computer ScienceUniversity of Virginia Abdelzaher, Tarek, Department of Computer ScienceUniversity of Virginia
Abstract:

Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point-to-point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we present APIT, a novel localization algorithm that is range-free. We show that our APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired. We compare our work via extensive simulation, with three state-of-the-art range-free localization schemes to identify the preferable system configurations of each. In addition, we study the effect of location error on routing and tracking performance. We show that routing performance and tracking accuracy are not significantly affected by localization error when the error is less than 0.4 times the communication radio radius.

Rights:
All rights reserved (no additional license for public reuse)
Language:
English
Source Citation:

He, Tian, Chengdu Huang, Brian Blum, John Stankovic, and Tarek Abdelzaher. "Range-Free Localization Schemes for Large Scale Sensor Networks." University of Virginia Dept. of Computer Science Tech Report (2003).

Publisher:
University of Virginia, Department of Computer Science
Published Date:
2003