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
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Mobile backbone networks --: construction and maintenance
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Maximizing lifetime for a sensor network
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
Prolonging Network Lifetime for Target Coverage in Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Computers & Mathematics with Applications
Construction and Maintenance of Wireless Mobile Backbone Networks
IEEE/ACM Transactions on Networking (TON)
Radius reconfiguration for energy conservation in sensor networks
International Journal of Sensor Networks
Maximizing network lifetime for target coverage problem in heterogeneous wireless sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Fundamental results on target coverage problem in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Theoretical treatment of target coverage in wireless sensor networks
Journal of Computer Science and Technology - Special issue on natural language processing
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
The Journal of Supercomputing
Hi-index | 0.00 |
A major concern in wireless sensor networks is to maximize network lifetime (in terms of rounds) while maintaining a high quality of services (QoS) at each round such as target coverage and network connectivity. Due to the power scarcity of sensors, a mechanism that can efficiently utilize energy has a great impact on extending network lifetime. Most existing works concentrate on scheduling sensors between sleep and active modes to maximize network lifetime while maintaining target/area coverage and network connectivity. This paper generalizes the sleep/active mode by adjusting sensing range to maximize total number of rounds and presents a distributed heuristic to address this problem.