Multi-objective energy-efficient dense deployment in Wireless Sensor Networks using a hybrid problem-specific MOEA/D

被引:60
作者
Konstantinidis, Andreas [1 ,2 ]
Yang, Kun [3 ]
机构
[1] Univ Cyprus, Dept Comp Sci, CY-1678 Nicosia, Cyprus
[2] Frederick Univ, Dept Comp Sci & Engn, CY-1036 Nicosia, Cyprus
[3] Univ Essex, Sch Comp Sci & Elect Engn, Colchester CO4 3SQ, Essex, England
关键词
Wireless sensor networks; Energy efficiency; Dense deployment; Multi-objective optimization; Evolutionary algorithms; Decomposition; Heuristics; Problem-specific knowledge; EVOLUTIONARY ALGORITHM; TOPOLOGY CONTROL; GENETIC ALGORITHM; POWER ASSIGNMENT; LOCAL SEARCH; AD HOC; OPTIMIZATION; LOCATION; PROTOCOL;
D O I
10.1016/j.asoc.2011.02.031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An energy-efficient Wireless Sensor Network (WSN) design often requires the decision of optimal locations (deployment) and power assignments of the sensors to be densely deployed in an area of interest. In the literature, no attempts have been made on optimizing both decision variables for maximizing the network coverage and lifetime objectives, while maintaining the connectivity constraint, at the same time. In this paper, the Dense Deployment and Power Assignment Problem (d-DPAP) in Wireless Sensor Networks (WSNs) is defined, and a Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) hybridized with a problem-specific Generalized Subproblem-dependent Heuristic (GSH), is proposed. In our method, the d-DPAP is decomposed into a number of scalar subproblems. The subproblems are optimized in parallel, by using neighbourhood information and problem-specific knowledge. The proposed GSH probabilistically alternates between six d-DPAP specific strategies, which are designed based on various WSN concepts and according to the subproblems objective preferences. Simulation results have shown that the proposed hybrid problem-specific MOEA/D performs better than the general-purpose MOEA/D and NSGA-II in several WSN instances, providing a diverse set of high-quality near-optimal network designs to facilitate the decision making process. The behavior of the MOEA/D-GSH in the objective space is also discussed. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:4117 / 4134
页数:18
相关论文
共 54 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]  
[Anonymous], 2005, ACM SIGMOBILE Mob. Comput. Commun. Rev., DOI DOI 10.1145/1072989.1072992
[3]  
Cardei M., 2006, INT C WIR MOB COMM
[4]  
Cardei M., 2005, HDB SENSOR NETWORKS, P19
[5]   Grid coverage for surveillance and target location in distributed sensor networks [J].
Chakrabarty, K ;
Iyengar, SS ;
Qi, HR ;
Cho, EC .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (12) :1448-1453
[6]  
Chang C.Y., 2006, IEEE GLOB TEL C, P1
[7]   The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems [J].
Chang, Pei-Chann ;
Chen, Shih-Hsin .
APPLIED SOFT COMPUTING, 2009, 9 (01) :173-181
[8]   An interactive evolutionary multi-objective optimization and decision making procedure [J].
Chaudhuri, Shamik ;
Deb, Kalyanmoy .
APPLIED SOFT COMPUTING, 2010, 10 (02) :496-511
[9]   Network configuration for optimal utilization efficiency of wireless sensor networks [J].
Chen, Yunxia ;
Chuah, Chen-Nee ;
Zhao, Qing .
AD HOC NETWORKS, 2008, 6 (01) :92-107
[10]  
Cheng P, 2004, GLOB TELECOMM CONF, P3210