By Topic

A Graph Drawing Approach to Sensor Network Localization

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

2 Author(s)
Nawaz, S. ; Nat. ICT Australia, Eveleigh ; Sanjay Jha

In this paper, we propose an anchor free localization mechanism for wireless sensor networks. Our algorithm is based on a graph drawing approach and uses inter-node distances to localize sensor nodes in a local coordinate system up to a global translation, rotation and reflection without any absolute reference positions such as GPS or other anchor nodes. We show that it is possible to avoid folds and flips in the localized network layout by introducing long range constraints among non adjacent nodes which can be derived from inter-node distance measurements between adjacent nodes. We evaluate the effect of different parameters like network shape, scale, average neighbors and ranging noise on our algorithm and compare it with an anchor based and a number of anchor free schemes. We also present experimental results from an actual sensor network showing the accuracy of our approach.

Published in:

Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on

Date of Conference:

8-11 Oct. 2007