On the cover scheduling problem in wireless sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6701 LNCS, Issue , 2011, Pages 657-668

  Rossi, André ^a,b   Sevaux, Marc ^a,c   Singh, Alok ^b   Geiger, Martin Josef ^c  

^a UNIVERSITÉ DE BRETAGNE SUD   (France)

^b UNIVERSITY OF HYDERABAD   (India)

^c HELMUT SCHMIDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; EXACT METHODS; GREEDY HEURISTICS; HEURISTIC APPROACH; MILP FORMULATION; SCHEDULING PROBLEM;

HEURISTIC METHODS; OPTIMIZATION; GENETIC ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING;

WIRELESS SENSOR NETWORKS;

EID: 80053041227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21527-8_73     Document Type: Conference Paper

References (15)

1. Akylidiz, I., Su,W., Sankarasubramaniam, Y., Cayirci, E.: A survey of sensor network. IEEE Communication Magazine 40(8), 102-116 (2002)
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)
3. 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)
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)
5. Chow, K., Lui, K., Lam, E.: Wireless sensor networks scheduling for full angle coverage. Multidimensional Systems and Signal Processing 20, 101-119 (2009)
6. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)
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)
8. Huang, C., Tseng, Y.: The coverage problem in a wireless sensor network. Mobile Networks and Applications 10, 519-528 (2005)
9. Lin, J., Chen, Y.: Improving the coverage of randomized scheduling in wireless sensor networks. IEEE Transaction on Wireless Communications 7(12), 4807-4812 (2008)
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)
11. Pinedo, M.: Scheduling: theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs (2008)
12. Raghunathan, V., Schurgers, C., Park, S., Srivastava, M.: Energy aware wireless microsensor networks. IEEE Signal Processing Magazine 19(2), 1007-1023 (2002)
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éneration 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)
15. 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)