A Novel Sensor Deployment Approach Using Multi-Objective Imperialist Competitive Algorithm in Wireless Sensor Networks

被引:14
作者
Enayatifar, Rasul [1 ]
Yousefi, Moslem [2 ]
Abdullah, Abdul Hanan [1 ]
Darus, Amer Nordin [2 ]
机构
[1] Univ Teknol Malaysia, Fac Comp, Skudai 81310, Johor, Malaysia
[2] Univ Teknol Malaysia, Fac Mech Engn, Dept Thermofluids, Skudai 81310, Johor, Malaysia
关键词
Imperialist competitive algorithm; Wireless sensor network; Sensor deployment; COVERAGE; CONNECTIVITY;
D O I
10.1007/s13369-014-0969-y
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
A wireless sensor network is a set of spatially distributed sensor nodes that work together to cover a monitored area. Usually, a large number of sensor nodes are densely deployed because of the limited energy resources available to them. An efficient way to save energy in the system at any particular time is to activate the minimum number of sensors needed and put the remaining sensors in sleep mode. In this study, a novel multi-objective Imperialist Competitive Algorithm, called MOICA, is proposed for handling sensor deployment. The main goal is to minimize the number of active sensor nodes while achieving the maximum coverage. To illustrate the efficiency of the proposed algorithm, a set of experiments from previous studies are carried out. Numerical results indicate that with the same number of deployed sensors, MOICA can provide more accurate solutions in less computational time when compared to the existing methods, namely, coverage configuration protocol, optimal geographical density control, energy-efficient coverage control algorithm and improved geographical adaptive fidelity.
引用
收藏
页码:4637 / 4650
页数:14
相关论文
共 32 条
[1]   Artificial potential field approach in WSN deployment: Cost, QoM, connectivity, and lifetime constraints [J].
Aitsaadi, Nadjib ;
Achir, Nadjib ;
Boussetta, Khaled ;
Pujolle, Guy .
COMPUTER NETWORKS, 2011, 55 (01) :84-105
[2]   Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization [J].
Ali, Hamid ;
Shahzad, Waseem ;
Khan, Farrukh Aslam .
APPLIED SOFT COMPUTING, 2012, 12 (07) :1913-1928
[3]  
[Anonymous], 030001 U CAL LOS ANG
[4]  
Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
[5]  
Cardei M, 2005, IEEE INFOCOM SER, P1976
[6]   WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks [J].
Mainak Chatterjee ;
Sajal K. Das ;
Damla Turgut .
Cluster Computing, 2002, 5 (2) :193-204
[7]   Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks [J].
Esnaashari, M. ;
Meybodi, M. R. .
COMPUTER NETWORKS, 2010, 54 (14) :2410-2438
[10]   Energy Consumption and Message Delay Analysis of QoS Enhanced Base Station Controlled Dynamic Clustering Protocol for Wireless Sensor Networks [J].
Fapojuwo, Abraham O. ;
Cano-Tinoco, Alejandra .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (10) :5366-5374