Please use this identifier to cite or link to this item:
|Title:||Coverage for target localization in wireless sensor networks|
|Citation:||Wang, W., Srinivasan, V., Wang, B., Chua, K.-C. (2008-02). Coverage for target localization in wireless sensor networks. IEEE Transactions on Wireless Communications 7 (2) : 667-676. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2008.060611|
|Abstract:||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. © 2008 IEEE.|
|Source Title:||IEEE Transactions on Wireless Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 21, 2019
WEB OF SCIENCETM
checked on Jan 14, 2019
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.