An OL(n3) potential reduction algorithm for linear programming
Mathematical Programming: Series A and B
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A discrete-time battery model for high-level power estimation
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
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
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
IEEE Communications Magazine
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Maximising lifetime for fault-tolerant target coverage in sensor networks
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
INOC'11 Proceedings of the 5th international conference on Network optimization
Optimized overlapping based energy-aware node collaboration in visual sensor networks
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
Journal of Network and Computer Applications
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
On detection and tracking of variant phenomena clouds
ACM Transactions on Sensor Networks (TOSN)
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks
International Journal of Sensor Networks
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
Hi-index | 0.00 |
One fundamental problem in wireless sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage problem is defined from several points of view due to a variety of sensor networks and a wide-range of their applications. Several different designs and formulations of the coverage problem have been proposed. They are subject to various topics such as types of interest regions (areas versus targets) and different network constraints, such as fault tolerance and bandwidth limitation. In this paper, we survey the state-of-the-art coverage formulations with an objective of maximising network lifetime. In particular, we present an overview and analysis of the solutions proposed in recent research literature.