Movement Assisted Sensor Deployment in Directional Sensor Networks

A directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. Area coverage is still an essential issue in a directional sensor network. In this paper, we study the area coverage problem in directional sensor networks with mobile sensors, which can move to the correct places to get high coverage. We present distributed self-deployment schemes of mobile sensors. After sensors are randomly deployed, each sensor calculates its next new location to move in order to obtain a better coverage than previous one. The locations of sensors are adjusted round by round so that the coverage is gradually improved. Based on circumcenter and incenter of sensing direction of the directional sensors, we design two schemes, namely Circumcenter-based and Incenter-based schemes respectively, to guide the moving direction. Simulation results show the effectiveness of our schemes in term of the coverage improvement.

[1]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[2]  Deborah Estrin,et al.  Cyclops: in situ image sensing and interpretation in wireless sensor networks , 2005, SenSys '05.

[3]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[4]  Majid Bagheri,et al.  Randomized k-Coverage Algorithms For Dense Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Yan Sun,et al.  A Coverage-Preserving Density Control Algorithm for Directional Sensor Networks , 2009 .

[6]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[7]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  John Anderson,et al.  An analysis of a large scale habitat monitoring application , 2004, SenSys '04.

[9]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Ramesh C. Jain,et al.  Multimedia Computing , 2014, IEEE Multim..

[11]  Stuart Kininmonth,et al.  The Great Barrier Reef Sensor Network , 2005 .

[12]  Thomas F. La Porta,et al.  Movement-Assisted Sensor Deployment , 2006, IEEE Trans. Mob. Comput..

[13]  Azzedine Boukerche,et al.  A Voronoi Approach for Coverage Protocols in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[14]  Sven Skyum,et al.  A Simple Algorithm for Computing the Smallest Enclosing Circle , 1990, Inf. Process. Lett..

[15]  Youn-Hee Han,et al.  Centroid-Based Movement Assisted Sensor Deployment Schemes in Wireless Sensor Networks , 2009, 2009 IEEE 70th Vehicular Technology Conference Fall.

[16]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[17]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[18]  Sanjiv Singh,et al.  Range-only SLAM for robots operating cooperatively with sensor networks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..