Connecting priority algorithm for node deployment in directional sensor networks

According to the existing directional sensor networks, the centroid point of node model mostly rotate around the sector vertex. As in this model, the node rotation area is a full circle, therefore multiply the network energy consumption and deployment time. This paper is based on the new directional model in which the sector nodes rotate around the centroid, then we present a potential field based connecting priority algorithm for node deployment, and finally make simulation for this algorithm to explore the parameters which will affect the coverage ratio. The simulation results show the effectiveness of the model and algorithm.

[1]  Tao Dan,et al.  Multimedia Sensor Network and Its Research Progresses , 2006 .

[2]  Lei Li,et al.  Study on Path Coverage in Wireless Sensor Networks: Study on Path Coverage in Wireless Sensor Networks , 2010 .

[3]  Chu-Sing Yang,et al.  Voronoi-based coverage improvement approach for wireless directional sensor networks , 2014, J. Netw. Comput. Appl..

[4]  Md. Ashiqur Rahman,et al.  Uniformity and Efficiency of a Wireless Sensor Network's Coverage , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[5]  Tao Da,et al.  Barrier Coverage Algorithm for Moving Target in Directional Sensor Networks , 2013 .

[6]  Xinbing Wang,et al.  Achieving Full View Coverage with Randomly-Deployed Heterogeneous Camera Sensors , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[7]  Hamid Khosravi,et al.  Optimal node scheduling for integrated connected-coverage in wireless sensor networks , 2013, Ninth International Conference on Computer Science and Information Technologies Revised Selected Papers.

[8]  Dan Tao.  A Virtual Potential Field Based Coverage-Enhancing Algorithm for Directional Sensor Networks , 2007 .

[9]  Guiran Chang,et al.  Coverage Optimization based on Improved NSGA-II in Wireless Sensor Network , 2007, 2007 IEEE International Conference on Integration Technology.

[10]  Zhang Hong-ke,et al.  Theories and Algorithms of Coverage Control for Wireless Sensor Networks , 2006 .

[11]  Huadong Ma,et al.  On Coverage Problems of Directional Sensor Networks , 2005, MSN.

[12]  Jie Wang,et al.  Barrier Coverage of Line-Based Deployed Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[13]  Zhang Zhaohui.  Study Regular Hexagonal Node Coverage Model of Wireless Sensor Networks , 2010 .

[14]  Hongbin Li,et al.  Demo: HierTrack: an energy efficient target tracking system for wireless sensor networks , 2011, SenSys.

[15]  D. Manjunath,et al.  Path coverage by a sensor field: The nonhomogeneous case , 2009, TOSN.

[16]  Lu Zhang,et al.  Coverage-Enhancing Algorithm Based on Overlap-Sense Ratio in Wireless Multimedia Sensor Networks , 2013, IEEE Sensors Journal.

[17]  Xiao Fu,et al.  A Path Coverage-Enhancing Algorithm for Directional Sensor Network Based on Improved Potential Field , 2009 .

[18]  Shigeo Shioda,et al.  Path coverage properties of randomly deployed sensors with finite data-transmission ranges , 2009, Comput. Networks.