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

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.

[1]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[4]  Jang-Ping Sheu,et al.  Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks , 2011, Comput. Networks.

[5]  Guangjie Han,et al.  A survey on coverage and connectivity issues in wireless sensor networks , 2012, J. Netw. Comput. Appl..

[6]  Siamak Talatahari,et al.  Optimum design of skeletal structures using imperialist competitive algorithm , 2010 .

[7]  Guiran Chang,et al.  Energy efficient coverage control in wireless sensor networks based on multi-objective genetic algorithm , 2009, Comput. Math. Appl..

[8]  Mohammad Hossein Kahaei,et al.  Sensor Management Under Tracking Accuracy and Energy Constraints in Wireless Sensor Networks , 2012 .

[9]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[10]  Behzad Abdi,et al.  Application of imperialist competitive algorithm for optimizing a thin resistant interphase , 2012 .

[11]  Moslem Yousefi,et al.  A modified imperialist competitive algorithm for constrained optimization of plate-fin heat exchangers , 2012 .

[12]  Yu-Chee Tseng,et al.  Positioning and location tracking in wireless sensor networks , 2004 .

[13]  Guy Pujolle,et al.  Artificial potential field approach in WSN deployment: Cost, QoM, connectivity, and lifetime constraints , 2011, Comput. Networks.

[14]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[15]  Mohammad Ilyas,et al.  Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems , 2004 .

[16]  Wen-Hwa Liao,et al.  A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks , 2011, Expert Syst. Appl..

[17]  Farrukh Aslam Khan,et al.  Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization , 2012, Appl. Soft Comput..

[18]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[19]  Reza Kerachian,et al.  Multi-objective genetic local search algorithm using Kohonen's neural map , 2009, Comput. Ind. Eng..

[20]  Pramod K. Varshney,et al.  Estimation of spatially distributed processes in wireless sensor networks with random packet loss , 2009, IEEE Transactions on Wireless Communications.

[21]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[22]  Abbas Rabiee,et al.  Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch , 2012 .

[23]  Abraham O. Fapojuwo,et al.  Energy consumption and message delay analysis of QoS enhanced base station controlled dynamic clustering protocol for wireless sensor networks , 2009, IEEE Transactions on Wireless Communications.

[24]  Dun-Wei Gong,et al.  A bare-bones multi-objective particle swarm optimization algorithm for environmental/economic dispatch , 2012, Inf. Sci..

[25]  Mohammad Reza Meybodi,et al.  A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks , 2010, Comput. Networks.

[26]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[27]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[28]  Bing-Hong Liu,et al.  Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks with Unidirectional Links , 2009, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[29]  S. Baskar,et al.  Multiobjective Decentralized Congestion Management Using Modified NSGA-II , 2011 .

[30]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[31]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[32]  Mike H. MacGregor,et al.  Distributed optimal dynamic base station positioning in wireless sensor networks , 2012, Comput. Networks.