DocumentCode :
2729637
Title :
Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design
Author :
Quintão, Frederico Paiva ; Nakamura, Fabíola Guerra ; Mateus, Geraldo Robson
Author_Institution :
Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil
Volume :
2
fYear :
2005
fDate :
2-5 Sept. 2005
Firstpage :
1589
Abstract :
The determination of a topology that extends the network lifetime is a major challenge in the area of wireless sensor networks (WSNs). In this paper we present the dynamic coverage problem (DCP), applying it to network-design purposes. In the context of WSNs, we have to find a configuration that maintains the coverage of the monitoring area, accomplishes the management of the network resources and minimizes the energy consumption. This work presents an integer linear programming formulation and an evolutionary algorithm for this combinatorial problem. We report computational results and comparisons between solutions for the proposed model and our evolutionary approach.
Keywords :
evolutionary computation; integer programming; linear programming; wireless sensor networks; combinatorial problem; dynamic coverage problem; evolutionary algorithm; integer linear programming; wireless sensor networks design; Algorithm design and analysis; Computer network management; Energy consumption; Energy management; Evolutionary computation; Integer linear programming; Monitoring; Network topology; Resource management; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN :
0-7803-9363-5
Type :
conf
DOI :
10.1109/CEC.2005.1554879
Filename :
1554879
Link To Document :
بازگشت