By Topic

Range-Free Localization Using Expected Hop Progress in 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

4 Author(s)
Yun Wang ; Dept. of Comput. Sci., Southern Illinois Univ., Edwardsville, IL, USA ; Xiaodong Wang ; Demin Wang ; Agrawal, D.P.

Localization algorithm continues to be an important and challenging topic in today's wireless sensor networks (WSNs). In this paper, a novel range-free localization algorithm using expected hop progress (LAEP) to predict the location of any sensor in a WSN is proposed. This algorithm is based on an accurate analysis of hop progress in a WSN with randomly deployed sensors and arbitrary node density. By deriving the expected hop progress from a network model for WSNs in terms of network parameters, the distance between any pair of sensors can be accurately computed. Since the distance estimation is a key issue in localization systems for WSNs, the proposed range-free LAEP achieves better performance and less communication overhead as compared to some existent schemes like DV-Hop and RAW. In addition, we study the effect of anchor placement on the algorithm performance by deriving the corresponding mean position error range. Extensive simulations are performed and the results are observed to be in good agreement with the theoretical analysis.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:20 ,  Issue: 10 )