Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design
Quintao, F.P.; Nakamura, F.G.; Mateus, G.R.;
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Volume 2,  2-5 Sept. 2005 Page(s):1589 - 1596 Vol. 2
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.
Abstract | Full Text: PDF(3352 KB)    IEEE CNF
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved