Optimal sensor deployment for WSNs in grid environment

A mechanism for deploying a minimum number of sensors to cover all targets that are randomly placed in a grid environment is discussed. The sensors are deployed at grid points that do not have targets. In the presented method, condideration is given to a grid point, called the sink, to start deploying the sensors. From the sink location, movement is in one of four possible directions (up, down, left, right) to find the next grid point for placing the sensor depending on the maximum number of targets covered by the new sensor. In case there is no path to move due to target placement, a random grid point is chosen as the next location. This is done till all targets are covered. This process is carried out for each possible sink location and the sink location corresponding to the minimum number of sensors is noted.

[1]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[2]  Wei Liu,et al.  EasiDesign: An Improved Ant Colony Algorithm for Sensor Deployment in Real Sensor Network System , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[3]  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..

[4]  W. Z. Wan Ismail,et al.  Study on coverage in Wireless Sensor Network using grid based strategy and Particle Swarm Optimization , 2010, 2010 IEEE Asia Pacific Conference on Circuits and Systems.

[5]  Xuxun Liu,et al.  Sensor Deployment of Wireless Sensor Networks Based on Ant Colony Optimization with Three Classes of Ant Transitions , 2012, IEEE Communications Letters.