By Topic

A Distributed Range-Free Localization Algorithm Based on Clustering for 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
$33 $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)
Meng QIU ; Sch. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun., Beijing ; Hui-Min Xu

Nodes self-localization algorithm is one of the wireless sensor networks' key techniques. The novel distributed range- free algorithm is based on clustering technique of data mine. Each regular node and its random two connected anchors construct a triangle. The regular node can calculate its pair of possible conjugate positions by the two anchors coordinates and edge scale of the triangles which may be the scale of the least hops between the three angles instead. Clustering selects the most similar cluster from all possible positions. The centroid of the subset should be used as the position of the regular node. Simulations by OPNET show that precision can be increased to approach 1/4 of radio range and better than that of most representative traditional ones, such as DV-hop.

Published in:

2007 International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

21-25 Sept. 2007