On the Cover Scheduling Problem in Wireless Sensor Networks
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 \(\mathcal 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.
Unable to display preview. Download preview PDF.
- 2.Benini, L., Castelli, G., Macii, A., Macii, E., Poncino, M., Scarsi, R.: A discrete-time battery model for high-level power estimation. In: Proceedings of the IEEE Design Automation and Test in Europe conference, Paris, France, pp. 35–39 (2000)Google Scholar
- 4.Cheng, M.X., Ruan, L., Wu, W.: Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 2638–2645 (2005)Google Scholar
- 6.Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)Google Scholar
- 7.Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Proceedings of the 1991 Conference on Foundations of Genetic Algorithms, pp. 69–93. Morgan Kaufmann, San Francisco (1991)Google Scholar
- 10.Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the travelling salesman problem. In: Proocedings of the second international conference on genetic algorithms, pp. 224–230. Erlbaum, Mahwah (1987)Google Scholar
- 13.Rossi, A., Sevaux, M., Singh, A., Geiger, M.J.: The cover scheduling problem arising in wireless sensor networks. Research report RR-11-02-01, Université de Bretagne-Sud, Lorient, France (2011), http://www-labsticc.univ-ubs.fr/or/
- 14.Rossi, A., Singh, A., Sevaux, M.: Génération de colonnes et réseaux de capteurs sans fil. In: Proceedings of the ROADEF, 11ème congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Toulouse, France, February 24-26 (2010)Google Scholar