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
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Coverage problems in wireless sensor networks: designs and analysis
International Journal of Sensor Networks
Localized Sensor Area Coverage with Low Communication Overhead
IEEE Transactions on Mobile Computing
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
A learning automata-based solution to the target coverage problem in wireless sensor networks
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Learning automata-based algorithms for finding cover sets in wireless sensor networks
The Journal of Supercomputing
Ad hoc node connectivity improvement analysis - Why not through mesh clients?
Computers and Electrical Engineering
Hi-index | 0.00 |
To achieve power efficient monitoring of targets by sensor networks, various coverage algorithms have been proposed. These algorithms divide the sensor nodes into cover sets, where each cover set is capable of monitoring all targets. Generating the maximum number of cover sets has been proven to be an NP-complete problem and, thus, algorithms producing sub-optimal solutions have been proposed. In this paper we present a novel and efficient coverage algorithm, that can produce both disjoint cover sets, i.e. cover sets with no common sensor nodes, as well as non-disjoint cover sets. While searching for the best sensor to include in a cover set, our algorithm uses a cost function that takes into account the monitoring capabilities of a sensor, its association with poorly monitored targets, but also the sensor's remaining battery life. Through simulations, we show that the proposed algorithm outperforms similar heuristic algorithms found in the literature, producing collections of cover sets of optimal (or near-optimal) size. The increased availability offered by these cover sets along with the short execution time of the proposed algorithm make it desirable for a wide range of node deployment environments.