Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A New Lower Bound on Range-Free Localization Algorithms 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

2 Author(s)
Chan, Y.W.E. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Boon Hee Soong

This letter examines the lower bound on localization error, which is an important performance measure for localization algorithms. Unlike some previous works based on the circular coverage model, we consider a more realistic scenario where radio propagation is subject to log-normal shadow fading. In this letter, we present an analytical expression for the distribution of lower bound on localization error for any range-free localization algorithm in WSNs. Finally, the derivation is validated through simulations.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 1 )