A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Introduction to Algorithms
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
IEEE Communications Magazine
A distributed energy-efficient clustering protocol for wireless sensor networks
Computers and Electrical Engineering
Potential game model to detect holes in sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
International Journal of Sensor Networks
Maximum lifetime scheduling for target coverage in wireless sensor networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
On Prolonging the Lifetime for Wireless Video Sensor Networks
Mobile Networks and Applications
Connected partial target coverage and network lifetime in wireless sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
A distributed lifetime-maximizing scheme for connected target coverage in WSNs
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.00 |
This paper addresses the target coverage problem inWireless Sensor Networks (WSNs). Communication and sensing consume energy, therefore, efficient power management can extend network lifetime. In this paper, we consider a large number of sensors randomly deployed to monitor a number of targets. Each target may be redundantly covered by multiple sensors. To conserve energy, we organise sensors in sets activated sucessively. In this paper, we introduce the Connected Set Covers (CSC) problem that has as objective finding a maximum number of set covers such that each sensor node to be activated is connected to the Base Station (BS). A sensor can participate in multiple sensor sets, but the total energy spent in all sets is constrained by the initial energy reserves. We show that the CSC problem is NP-complete and we propose three solutions: an Integer Programming (IP)-based solution, a greedy approach and a distributed and localised heuristic. Simulation results that validate our approaches are also presented.