Please use this identifier to cite or link to this item:
|Title:||Coverage protocol for wireless sensor networks using distance estimates|
|Authors:||Zhang, M. |
|Citation:||Zhang, M., Chan, M.C., Ananda, A.L. (2007). Coverage protocol for wireless sensor networks using distance estimates. 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON : 183-192. ScholarBank@NUS Repository. https://doi.org/10.1109/SAHCN.2007.4292830|
|Abstract:||In wireless sensor networks, it is desirable to maintain good sensing coverage while keeping the number of active sensor nodes small to achieve long system lifetime. Existing coverage algorithms assume some form of localization and that complete coverage is needed. Our work is motivated by two observations. First, localization is expensive, error-prone and not required for a coverage algorithm. Instead, coverage algorithm can be designed using only distance information between two nodes. Second, complete coverage can lead to excessive redundancy, resulting in inefficiency in terms of active nodes needed. In this paper, we first present a scheme that estimates the distance between any two neighboring nodes using only local information. We then present CCP, a configurable coverage protocol that requires only neighbor distance information. CCP can be configured such that at least a portion of the area will be covered by active nodes with high probability, where α is a tunable parameter. In addition, CCP achieves similar performance to OGDC  in terms of coverage and active nodes required. Compare to OGDC, CCP offers the flexibility to trade-off between coverage and nodes required. By setting the coverage objective to 90%, about 22% node savings can be achieved. © 2007 IEEE.|
|Source Title:||2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2018
WEB OF SCIENCETM
checked on Oct 9, 2018
checked on Oct 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.