An OL(n3) potential reduction algorithm for linear programming
Mathematical Programming: Series A and B
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Coverage and activity management of wireless video sensor networks for surveillance applications
International Journal of Sensor Networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Simulation of wireless sensor networks under partial coverage
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
A major concern in wireless sensor networks is to maximise network lifetime (in terms of rounds) while maintaining a high Quality of Service (QoS) at each round, which includes target coverage and network connectivity. Due to the power scarcity of sensors, a mechanism that can efficiently utilise energy has a great impact on extending network lifetime. Most existing works concentrate on scheduling sensors between sleep and active modes to maximise network lifetime while maintaining target/area coverage and network connectivity. This paper generalises the sleep/active mode by adjusting sensing range to maximise the total number of rounds. Two distributed solutions have been proposed and simulation results confirm the efficiency of our solutions.