By Topic

A Range Free Localization Algorithm Based on Restricted-Area 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
$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)
Chao Wang ; Sch. of Electron. & Inf. Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing ; Kai Liu ; Nan Xiao

This paper presents a restricted-area-based localization algorithm (RAL) for wireless sensor networks (WSN), in which radio connectivity and principle of perpendicular bisectors are used to provide a lower estimation error than some of restricted-area-based localization algorithms. In the RAL algorithm, anchor nodes can transmit beacon signals at different power levels, which divide the possible transmission ranges of an anchor into a circle and multiple rings. The intersection of circle or rings of all the anchors heard by unknown node forms restricted-area I. In addition, we utilize all the perpendicular bisectors of the line which connects each pair of anchor nodes to obtain restricted-area II. Based on the restricted-area I and restricted-area II, we can calculate valid intersection points, and take average value of all these points as the estimated location of the unknown nodes. The proposed algorithm is range-free and energy efficient. Neighboring sensor nodes do not need to exchange information. Each sensor node only relies on information of anchors it heard to compute two kinds of restricted-areas and estimates its location. Simulation results show that the proposed algorithm has less estimation error than Centroid, Convex and CAB localization algorithms.

Published in:

Computing in the Global Information Technology, 2008. ICCGI '08. The Third International Multi-Conference on

Date of Conference:

July 27 2008-Aug. 1 2008