A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks

Andreas Konstantinidis; Zhang Qingfu; Yang Kun

doi:10.1109/CEC.2009.4983286

A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks

Andreas Konstantinidis, Zhang Qingfu, Yang Kun

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

10 Citations (Scopus)

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.

Original language	English
Title of host publication	2009 IEEE Congress on Evolutionary Computation, CEC 2009
Pages	2740-2747
DOIs	https://doi.org/10.1109/CEC.2009.4983286
Publication status	Published - 2009
Externally published	Yes
Event	2009 IEEE Congress on Evolutionary Computation, CEC 2009 - Trondheim, Norway Duration: 18 May 2009 → 21 May 2009

Conference

Conference	2009 IEEE Congress on Evolutionary Computation, CEC 2009
Place	Norway
City	Trondheim
Period	18/05/09 → 21/05/09

Access Output

10.1109/CEC.2009.4983286

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{8b33a0dcfc8f4531b89d6c31b208a613,

title = "A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks",

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. {\textcopyright} 2009 IEEE.",

author = "Andreas Konstantinidis and Zhang Qingfu and Yang Kun",

year = "2009",

doi = "10.1109/CEC.2009.4983286",

language = "English",

isbn = "9781424429592",

pages = "2740--2747",

booktitle = "2009 IEEE Congress on Evolutionary Computation, CEC 2009",

note = "2009 IEEE Congress on Evolutionary Computation, CEC 2009 ; Conference date: 18-05-2009 Through 21-05-2009",

}

Konstantinidis, A, Qingfu, Z & Kun, Y 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., 4983286, pp. 2740-2747, 2009 IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway, 18/05/09. https://doi.org/10.1109/CEC.2009.4983286

A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks. / Konstantinidis, Andreas; Qingfu, Zhang; Kun, Yang.
2009 IEEE Congress on Evolutionary Computation, CEC 2009. 2009. p. 2740-2747 4983286.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks

AU - Konstantinidis, Andreas

AU - Qingfu, Zhang

AU - Kun, Yang

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70450059666&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-70450059666&origin=recordpage

U2 - 10.1109/CEC.2009.4983286

DO - 10.1109/CEC.2009.4983286

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424429592

SP - 2740

EP - 2747

BT - 2009 IEEE Congress on Evolutionary Computation, CEC 2009

T2 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009

Y2 - 18 May 2009 through 21 May 2009

ER -

A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this