Maximizing lifetime for a sensor network

Authors:
Adil I. Erzin;Vyacheslav V. Zalyubovskiy;Hyunseung Choo
Affiliations:
Russian Academy of Sciences, Novosibirsk, Russia;Russian Academy of Sciences, Novosibirsk, Russia;Sungkyunkwan University, Suwon, Korea
Venue:
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Year:
2008

Citing 6
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Practical Method to Form Energy Efficient Connected -Coverage in Wireless Sensor Networks

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
A survey of energy-efficient scheduling mechanisms in sensor networks

Mobile Networks and Applications
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications
Energy-Efficient connected coverage of discrete targets in wireless sensor networks

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Network lifetime is a key characteristic in evaluating sensor networks. Sensor coverage and connectivity have been included in discussions on network lifetime. Many models and algorithms have been proposed to increase the lifetime of a sensor network. Most are based on switching sensors between sleep and active modes while maintaining coverage and network connectivity. Connected cover is a set of sensors that covers all targets and forms a connected graph. The problem is to find a set of connected covers and the durations of their activity so that all targets are covered during a maximal time period and the sum of the activity time intervals for each sensor is not greater than its lifetime. We propose a new heuristic approach to maximize the lifetime of a sensor network given a superfluous set of connected covers.