Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
The coverage problem in a wireless sensor network
Mobile Networks and Applications
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
| Hi-index | 0.00 |
The K-coverage configuration guarantees that each location in an area is covered by at least K wireless sensors. To prolong the system lifetime, how to design an efficient sleep-scheduling algorithm have been attracted much attention. Many studies cannot maximize the system lifetime, while ensuring the K-coverage configuration. In this paper, we classify wireless sensors into groups, in which each group is K-covered with the minimum overlap among sensors. Different from the previous studies, our algorithm further reduces the cost of maintaining connectivity among sensors and the latency of reporting events. Experimental results demonstrate the efficiency and accuracy of our algorithm.