Please use this identifier to cite or link to this item:
|Title:||Coverage for Target Localization in Wireless Sensor Networks||Authors:||Wang, W.
|Issue Date:||2006||Citation:||Wang, W., Srinivasan, V., Wang, B., Chua, K.-C. (2006). Coverage for Target Localization in Wireless Sensor Networks. Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN '06 2006 : 118-125. ScholarBank@NUS Repository. https://doi.org/10.1145/1127777.1127799||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 necessary sensor density which can guarantee a localization error bound over the sensing field. In the first method, we convert the coverage problem for localization to a conventional disk coverage problem, where the sensing area is a disk centered around the sensor. Our results show that the disk coverage model requires 4 times more sensors for tracking compared to detection applications. We then introduce the idea of sector coverage, which can satisfy the same coverage conditions with 2 times less sensors over the disk coverage approach. This shows that conventional disk coverage model is insufficient for tracking applications, since it overestimates the sensor density by two times. Simulation results show that the network density requirements derived through sector coverage are close to the actual need for target tracking applications. Copyright 2006 ACM.||Source Title:||Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN '06||URI:||http://scholarbank.nus.edu.sg/handle/10635/69759||ISBN:||1595933344||DOI:||10.1145/1127777.1127799|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.