Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target
IEEE Transactions on Parallel and Distributed Systems
Maximizing lifetime of sensor surveillance systems
IEEE/ACM Transactions on Networking (TON)
Q-Coverage Problem in Wireless Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
QoS-aware target coverage in wireless sensor networks
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
In this paper we study the target Q-coverage (TQC) problem where each target needs to be covered by different numbers of sensors. We try to find a collection of Q-covsets which satisfy the coverage quality requirement to maximize the network lifetime. We first prove that the problem is NP-Hard. Then we design a greedy algorithm to efficiently compute the Q-covsets. Finally, simulation results are presented to verify our approach.