By Topic

Coverage for target localization 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)
Wei Wang ; Nat. Univ. of Singapore, Singapore ; Srinivasan, V. ; Bang Wang ; Kee-Chaing Chua

Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consider the coverage problem from the perspective of target localization. In this paper, we propose two methods to estimate the lower bound of sensor density to guarantee a bounded localization error over the sensing field. We first convert the coverage problem for localization to a conventional disk coverage problem, where the sensing area is a disk centered at the sensor. Our results show that the disk coverage model requires 4 times more sensors for localization compared to detection applications. We then introduce the idea of sector coverage to tighten the lower bound. The lower bound derived through sector coverage is 2 times less than through disk coverage. A distributed sector coverage algorithm is then proposed in this paper. Compared to disk coverage, sector coverage requires more computations. However, it provides more accurate density estimations than the disk model. Numerical evaluations show that the density bound derived through our sector coverage model is tight.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:7 ,  Issue: 2 )