Please use this identifier to cite or link to this item:
|Title:||Information coverage in randomly deployed wireless sensor networks||Authors:||Wang, B.
Wireless sensor networks
|Issue Date:||Aug-2007||Citation:||Wang, B., Chua, K.C., Srinivasan, V., Wang, W. (2007-08). Information coverage in randomly deployed wireless sensor networks. IEEE Transactions on Wireless Communications 6 (8) : 2994-3004. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2007.051044||Abstract:||Coverage is an important issue in wireless sensor networks. The most commonly used coverage model in the literature defines a point to be covered if its Euclidian distance to at least one sensor is less than a fixed threshold. This is a conservative definition of coverage which implicitly assumes that each sensor makes a decision independent of other sensors in the field. Sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We have previously proposed a new notion of information coverage  and investigated its properties. In this paper, we study sensor density requirements for complete information coverage of a field with random sensor deployment. We provide an upper bound on the probability that an arbitrary point in a randomly deployed sensor field is not information covered and find the relationship between the sensor density and the average field vacancy. Simulation results validate our theoretical analysis and show that significant savings in terms of sensor density for complete coverage can be achieved with information coverage. © 2007 IEEE.||Source Title:||IEEE Transactions on Wireless Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/56335||ISSN:||15361276||DOI:||10.1109/TWC.2007.051044|
|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.