Distributed sensor deployment using potential fields

Abstract Maximization of sensing coverage has been an important problem in mobile sensor networks. In this work, we present two novel algorithms for maximizing sensing coverage in 2D and 3D spaces. We evaluate our methods by comparing with two previously proposed methods. All the four methods are based on potential fields. The previous work used the same potential function, however the algorithms we propose here use two different potential functions. Potential fields require low complexity, which is crucial for resource lacking mobile sensor nodes. Though potential fields are widely used for path planning in robotics, only a few works used potential fields for coverage maximization in mobile sensor networks. Through simulations, we compare our proposal with the previous algorithms, and show that the algorithm we propose here outperforms previous algorithms.

[1]  K.M. Passino,et al.  Stability analysis of social foraging swarms , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Hongyan Wang,et al.  Social potential fields: A distributed behavioral control for autonomous robots , 1995, Robotics Auton. Syst..

[3]  Gaurav S. Sukhatme,et al.  Sensor Network Configuration and the Curse of Dimensionality , 2006 .

[4]  C. Breder Equations Descriptive of Fish Schools and Other Animal Aggregations , 1954 .

[5]  Eduardo Castelló Ferrer,et al.  Demo: A Low-cost, Highly Customizable Robotic Platform for Testing Mobile Sensor Networks , 2015, MobiHoc.

[6]  K. Warburton,et al.  Tendency-distance models of social cohesion in animal groups. , 1991, Journal of Theoretical Biology.

[7]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[8]  Mihaela Cardei,et al.  Coverage Problems in Sensor Networks , 2013 .

[9]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[10]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[11]  Veysel Gazi,et al.  Sensor coverage maximization with potential fields , 2014, 2014 IEEE Symposium on Computers and Communications (ISCC).

[12]  H. E. Stephanou,et al.  Entropy-driven on-line control of autonomous robots , 1989, J. Intell. Robotic Syst..

[13]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[14]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.

[15]  M. Amaç Güvensan,et al.  On coverage issues in directional sensor networks: A survey , 2011, Ad Hoc Networks.

[16]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional underwater sensor networks , 2008 .

[17]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[18]  K. Passino,et al.  A class of attractions/repulsion functions for stable swarm aggregations , 2004 .

[19]  Veysel Gazi,et al.  On Lagrangian dynamics based modeling of swarm behavior , 2013 .

[20]  Kevin M. Passino,et al.  Swarm Stability and Optimization , 2011 .

[21]  Petter Ögren,et al.  Cooperative control of mobile sensor networks:Adaptive gradient climbing in a distributed environment , 2004, IEEE Transactions on Automatic Control.

[22]  Mario Cannataro,et al.  Protein-to-protein interactions: Technologies, databases, and algorithms , 2010, CSUR.

[23]  Veysel Gazi,et al.  Formation control with potential functions and Newton's iteration , 2007, 2007 European Control Conference (ECC).

[24]  Xiangyu Yu,et al.  A Novel Virtual Force Approach for Node Deployment in Wireless Sensor Network , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[25]  Kevin M. Passino,et al.  Stability analysis of swarms , 2003, IEEE Trans. Autom. Control..