On the cover scheduling problem in wireless sensor networks

Authors:
André Rossi;Marc Sevaux;Alok Singh;Martin Josef Geiger
Affiliations:
Université de Bretagne-Sud, Lab-STICC, Lorient, France and University of Hyderabad, Department of Computer and Information Sciences, Hyderabad, India;Université de Bretagne-Sud, Lab-STICC, Lorient, France and Helmut Schmidt University, Logistics Management Department, Hamburg, Germany;University of Hyderabad, Department of Computer and Information Sciences, Hyderabad, India;Helmut Schmidt University, Logistics Management Department, Hamburg, Germany
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 8
Cited 1

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A discrete-time battery model for high-level power estimation

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Discharge Current Steering for Battery Lifetime Optimization

IEEE Transactions on Computers
The coverage problem in a wireless sensor network

Mobile Networks and Applications
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Wireless sensor networks scheduling for full angle coverage

Multidimensional Systems and Signal Processing
Improving the coverage of randomized scheduling in wireless sensor networks

IEEE Transactions on Wireless Communications - Part 1
A survey on sensor networks

IEEE Communications Magazine

Column generation algorithm for sensor coverage scheduling under bandwidth constraints

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cover scheduling for wireless sensor networks has attracted a lot of attention during the last decade. Many heuristic approaches and exact methods have been proposed for producing covers, i.e. subsets of sensors to be used at the same time. However, the actual schedule of the generated covers has never been explicitly addressed to the best of our knowledge. Though, this problem is of particular relevance when coverage breach is allowed in the aforementioned problems, i.e., when a full coverage of targets at any time is not mandatory. In that case, the objective of the wireless sensor network cover scheduling problem (WSN-CSP) is to schedule the covers so as to minimize the longest period of time during which a target is not covered in the schedule. In this paper, this problem is proved NP-Hard, a MILP formulation is provided along with a greedy heuristic and a genetic algorithm based approach. Computational results show the effectiveness of the last approach.