An evolutionary algorithm to the Density Control, Coverage and Routing Multi-Period Problem in Wireless Sensor Networks

Author

de Andrade, Iuri Bueno Drumond ; de Oliveira Januario, Tiago ; Pappa, Gisele L. ; Mateus, Geraldo Robson

Author_Institution

Dept. de Cienc. da Comput., Univ. Fed. de Minas Gerais (UFMG), Belo Horizonte, Brazil

fYear

2010

fDate

18-23 July 2010

Firstpage

1

Lastpage

8

Abstract

Wireless Sensor Networks (WSNs) are composed of autonomous and resource-constrained (power, sensing, radios, and processors) nodes. These networks are conceived to have a large number of nodes working on monitoring phenomena. A major challenge for theses networks is to provide solutions that maximize quality of service (QoS) requirements, such as coverage and data routing, and minimize the energy consumption. This paper presents an evolutionary algorithm (EA) to solve the Density Control, Coverage and Routing Multi-Period Problem (DCCRMP) in WSN. The results are compared to the optimal solutions obtained by an Integer Linear Program model and a GRASP heuristic from the literature. The EA obtains significant improvements in both quality of solutions and computational time.

Keywords

evolutionary computation; quality of service; telecommunication network routing; wireless sensor networks; QoS; density control coverage and routing multi-period problem; evolutionary algorithm; quality of service; wireless sensor networks; Ad hoc networks; Energy consumption; Evolutionary computation; Monitoring; Quality of service; Routing; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation (CEC), 2010 IEEE Congress on

Conference_Location

Barcelona

Print_ISBN

978-1-4244-6909-3

Type

conf

DOI

10.1109/CEC.2010.5585929

Filename

5585929