Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption

In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points

[1]  Jennifer C. Hou,et al.  FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.

[2]  D.B. Jourdan,et al.  Layout optimization for a wireless sensor network using a multi-objective genetic algorithm , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[3]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[4]  Himanshu Gupta,et al.  Fault tolerant connected sensor cover with variable sensing and transmission ranges , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[5]  Xin Yao,et al.  A GA approach to the optimal placement of sensors in wireless sensor networks with obstacles and preferences , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[6]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[7]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

[9]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[10]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[11]  Peter J. Fleming,et al.  Multiobjective genetic algorithms made easy: selection sharing and mating restriction , 1995 .

[12]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[13]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[14]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[15]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).