Energy-Efficient State Scheduling for Maximizing Sensor Network Lifetime under Coverage Constraint


Wireless sensor networks consist of a large number of low-power, limited-processing capability sensors that are deployed in afield to measure physical variables or detect events like intrusion or movement. In surveillance applications, ensuring a high area coverage is an important issue requiring a certain number of sensors to be turned on to report events. In this paper, we address the problem of maximizing the sensor network lifetime under area coverage constraint. For that, we propose a scheduling mechanism that calculates, for every time slot of the network operating period, an optimal covering subset of sensors that will be activated while all other sensors will go on sleep. We model this problem as an integer linear programming (ILP) problem, that we resolve using ILOG CPLEX [9] and we show that the obtained solutions provide for a more balanced energy consumption when we increase a balancing exponent lambda, which increases network lifetime.

DOI: 10.1109/WIMOB.2007.31

7 Figures and Tables

Cite this paper

@article{Chamam2007EnergyEfficientSS, title={Energy-Efficient State Scheduling for Maximizing Sensor Network Lifetime under Coverage Constraint}, author={Ali Chamam and Samuel Pierre}, journal={Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007)}, year={2007}, pages={63-63} }