A Simple Randomized Algorithm for Complete Target Coverage Problem in Sensor Wireless Networks
| Autor: | Zhaoquan Cai, Weizhong Luo, Zhi Zeng |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Wireless network
Computer science Distributed computing Real-time computing 02 engineering and technology Disjoint sets Randomized algorithm Set (abstract data type) Key distribution in wireless sensor networks 020204 information systems 0202 electrical engineering electronic engineering information engineering Wireless sensor network Sleep mode Efficient energy use |
| Zdroj: | Lecture Notes in Electrical Engineering ISBN: 9789811005381 |
| DOI: | 10.1007/978-981-10-0539-8_37 |
| Popis: | Achieving energy efficient monitoring of targets is a critical issue in sensor networks and, thus various power efficient coverage algorithms have been proposed. These algorithms divide the sensors into monitor sets, where each monitor set is able to cover all the targets. However, even the number of monitor sets is set to 3, the considered problem has been proven to be NP-hard. In this paper, we propose a randomized and efficient coverage algorithm that produces disjoint monitor sets, i.e., monitor sets with no common sensors. The monitor sets are activated successively and only the sensor nodes from the current active set are responsible for monitoring all the target nodes, while all other nodes are in a low-energy sleep mode. Our algorithm can generate a solution with guaranteed probability \( 1 - \varepsilon \, (0 < \varepsilon < 1) \). Simulation results are presented to verify our approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|