Dissemin is shutting down on January 1st, 2025

Published in

Elsevier, Computer Networks, 6(54), p. 960-976

DOI: 10.1016/j.comnet.2009.08.010

Links

Tools

Export citation

Search in Google Scholar

A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

A Wireless Sensor Network (WSN) design often requires the decision of optimal locations (deployment) and transmit power levels (power assignment) of the sensors to be deployed in an area of interest. Few attempts have been made on optimizing both decision variables for maximizing the network coverage and lifetime objectives, even though, most of the latter studies consider the two objectives individually. This paper defines the multiobjective Deployment and Power Assignment Problem (DPAP). Using the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), the DPAP is decomposed into a set of scalar subproblems that are classified based on their objective preference and tackled in parallel by using neighborhood information and problem-specific evolutionary operators, in a single run. The proposed operators adapt to the requirements and objective preferences of each subproblem dynamically during the evolution, resulting in significant improvements on the overall performance of MOEA/D. Simulation results have shown the superiority of the problem-specific MOEA/D against the NSGA-II in several network instances, providing a diverse set of high quality network designs to facilitate the decision maker’s choice.