Research Repository

A Subproblem-dependent Heuristic in MOEA/D for the Deployment and Power Assignment Problem in Wireless Sensor Networks

Konstantinidis, Andreas and Zhang, Qingfu and Yang, Kun (2009) A Subproblem-dependent Heuristic in MOEA/D for the Deployment and Power Assignment Problem in Wireless Sensor Networks. In: 2009 IEEE Congress on Evolutionary Computation (CEC), 2009-05-18 - 2009-05-21.

Full text not available from this repository.

Abstract

In this paper, we propose a Subproblem-dependent Heuristic (SH) for MOEA/D to deal with the Deployment and Power Assignment Problem (DPAP) in Wireless Sensor Networks (WSNs). The goal of the DPAP is to assign locations and transmit power levels to sensor nodes for maximizing the network coverage and lifetime objectives. In our method, the DPAP is decomposed into a number of scalar subproblems. The subproblems are optimized in parallel, by using neighborhood information and problem-specific knowledge. The proposed SH probabilistically alternates between two DPAP-specific strategies based on the subproblems objective preferences. Simulation results have shown that MOEA/D performs better than NSGA-II in several WSN instances. © 2009 IEEE.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: 2009 IEEE Congress on Evolutionary Computation, CEC 2009
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 15 Aug 2012 14:19
Last Modified: 15 Jan 2022 00:36
URI: http://repository.essex.ac.uk/id/eprint/1986

Actions (login required)

View Item View Item