By Topic

A GRASP heuristic to Density Control: Solving multi-period coverage and Routing Problems in Wireless Sensor Networks

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)
de Andrade, I.B.D. ; Dept. de Cienc. da Comput., Univ. Fed. de Minas Gerais (UFMG), Belo Horizonte, Brazil ; Mateus, G.R. ; Nakamura, F.G.

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 in an area. So, a major challenge for this 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 algorithm that uses the GRASP metaheuristic, to solve the density control, coverage and routing multi- period problem (DCCRMP) in flat WSNs. The proposed solution is compared to the solution obtained by solving, with a commercial optimization software, an Integer Linear Programming (ILP) model proposed for the DCCRMP. The computational results show that the algorithm successfully meets the QoS requirements considered in this work and provides solutions close or equal to the optimal with reduced execution time.

Published in:

Computers and Communications, 2009. ISCC 2009. IEEE Symposium on

Date of Conference:

5-8 July 2009