𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hybrid approximation for minimum-cost target coverage in wireless sensor networks

✍ Scribed by Zheng Fang; Jie Wang

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
383 KB
Volume
4
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimum cost localization problem in wir
Minimum cost localization problem in wireless sensor networks
✍ Minsu Huang; Siyuan Chen; Yu Wang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 877 KB

Localization is a fundamental problem in wireless sensor networks. Current localization algorithms mainly focus on checking the localizability of a network and/or how to localize as many nodes as possible given a static set of anchor nodes and distance measurements. In this paper, we study a new opt

Connected sensor cover for area informat
Connected sensor cover for area information coverage in wireless sensor networks
✍ Bang Wang; Kee Chaing Chua; Vikram Srinivasan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 318 KB πŸ‘ 1 views

## Abstract Coverage is an important issue in wireless sensor networks (WSNs) and is often used to measure how well a sensor field is monitored by the deployed sensors. If the area covered by a sensor can also be covered by some other sensors, this sensor can go into an energy‐saving sleep state wi

Cluster head election techniques for cov
Cluster head election techniques for coverage preservation in wireless sensor networks
✍ Stanislava Soro; Wendi B. Heinzelman πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 622 KB

Coverage preservation is one of the basic QoS requirements of wireless sensor networks, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles in applications that