By Topic

Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
F. P. Quintao ; Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil ; F. G. Nakamura ; G. R. Mateus

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.

Published in:

2005 IEEE Congress on Evolutionary Computation  (Volume:2 )

Date of Conference:

2-5 Sept. 2005