Cart (Loading....) | Create Account
Close category search window
 

Distributed algorithm for anchor-free network localization using angle of arrival

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

1 Author(s)
Arbula, D. ; Fac. of Eng., Univ. of Rijeka, Rijeka

A localization problem in wireless sensor and ad hoc networks can be solved using measured distances and/or directions between neighboring nodes as constraints. With the internode constraints only the relative localization problem can be solved, as for more specific absolute positions a set of prelocalized nodes, called anchors, is needed. In this paper, a new approach for designing and evaluating a distributed anchor-free localization algorithm is presented. It uses only direction constraints relative to the nodepsilas coordinate system as their orientations are assumed to be unknown. The algorithm is based on division of a network into clusters. After the initial clusters are localized, by stitching them together the whole network can be localized. Using the graph rigidity theory we define new structures and their relationships, so the algorithm can provide relative locations to maximum number of nodes for a given number of constraints. The algorithm performance is evaluated through simulations and the obtained results are similar to the centralized version of algorithm. Additional analysis showed that the performance is not dependant on the path and order used for cluster stitching. By comparing the performance to the Cramer Rao bound it is revealed that the error induced by the algorithm correspond to the 30% - 50% of the total localization error.

Published in:

Industrial Electronics, 2008. ISIE 2008. IEEE International Symposium on

Date of Conference:

June 30 2008-July 2 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.