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 \(\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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akylidiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey of sensor network. IEEE Communication Magazine 40(8), 102–116 (2002)
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)
Benini, L., Bruni, D., Macii, A., Macii, E., Poncino, M.: Discharge current steering for battery lifetime optimization. IEEE Transaction on computers 52(8), 985–995 (2003)
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)
Chow, K., Lui, K., Lam, E.: Wireless sensor networks scheduling for full angle coverage. Multidimensional Systems and Signal Processing 20, 101–119 (2009)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)
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)
Huang, C., Tseng, Y.: The coverage problem in a wireless sensor network. Mobile Networks and Applications 10, 519–528 (2005)
Lin, J., Chen, Y.: Improving the coverage of randomized scheduling in wireless sensor networks. IEEE Transaction on Wireless Communications 7(12), 4807–4812 (2008)
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)
Pinedo, M.: Scheduling: theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs (2008)
Raghunathan, V., Schurgers, C., Park, S., Srivastava, M.: Energy aware wireless microsensor networks. IEEE Signal Processing Magazine 19(2), 1007–1023 (2002)
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/
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)
Wang, C., Thai, M.T., Li, Y., Wang, F., Wu, W.: Optimization scheme for sensor coverage scheduling with bandwidth constraints. Optimization letters 3(1), 63–75 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi, A., Sevaux, M., Singh, A., Geiger, M.J. (2011). On the Cover Scheduling Problem in Wireless Sensor Networks. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)