On the optimal random deployment of wireless sensor networks in non-homogeneous scenarios

Random scattering of WSNs is needed in many practical cases due to the large scale of the network required or to the inaccessibility of the terrain. However several important features of deployments of this type have been neglected due to their analytical complexity. Node placement must guarantee correct operation: if nodes are too separated many would be isolated and data would not reach the sinks. Besides, if the nodes are too close, the area covered would be small and little information would be retrieved. Moreover, the target area cannot be considered homogeneous since in real-life situations some zones are more important than others. This paper addresses these constraints by proposing and solving an optimization problem which maximizes network sensing coverage. In our model several clusters of nodes are spread over the target area following Gaussian random distributions, and the goal is to decide the optimal launch point and the dispersion for each cluster. This corresponds to real situations where clusters are dropped in an airborne launch in which dispersion is controlled by the release altitude. The problem is solved by considering iterative steps where single cluster deployments are addressed. Several tests validate our approach and indicate that our method outperforms previous approaches, especially in deployments with a low number of nodes, which are more challenging from the optimization perspective.

[1]  Arunita Jaekel,et al.  Clustering strategies for improving the lifetime of two-tiered sensor networks , 2008, Comput. Commun..

[2]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[3]  Sajal K. Das,et al.  Coverage and connectivity issues in wireless sensor networks: A survey , 2008, Pervasive Mob. Comput..

[4]  Steven Dubowsky,et al.  A Concept Mission: Microbots for Large‐Scale Planetary Surface and Subsurface Exploration , 2005 .

[5]  E. Jaynes Probability theory : the logic of science , 2003 .

[6]  Konstantinos Kalpakis,et al.  Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[7]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[8]  Raymond E. Arvidson,et al.  Mars Exploration Rover mission , 2003 .

[9]  Krishnendu Chakrabarty,et al.  Uncertainty-aware sensor deployment algorithms for surveillance applications , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Hossam S. Hassanein,et al.  Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[11]  Hossam S. Hassanein,et al.  WSN04-1: Deployment for Information Oriented Sensing Coverage in Wireless Sensor Networks , 2006, IEEE Globecom 2006.

[12]  Sajal K. Das,et al.  Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem , 2008, IEEE Transactions on Computers.

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

[14]  Steven Clark,et al.  General Algebraic Modeling System , 2014 .

[15]  Arne Drud,et al.  CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems , 1985, Math. Program..

[16]  M. Victoria Bueno-Delgado,et al.  Performance evaluation of MAC transmission power control in wireless sensor networks , 2007, Comput. Networks.

[17]  Ying Chen,et al.  Designing hierarchical sensor networks with mobile data collectors , 2011, Pervasive Mob. Comput..

[18]  Lucas Jonathan Fortier An application of a proposed airdrop planning system , 2004 .

[19]  M. Ishizuka,et al.  Performance study of node placement in sensor networks , 2004, 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings..

[20]  Andre G. Laurent,et al.  Bombing Problems---A Statistical Approach , 1957 .

[21]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[22]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[23]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[24]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[25]  Dharma P. Agrawal,et al.  Coverage and Lifetime Optimization of Wireless Sensor Networks with Gaussian Distribution , 2008, IEEE Transactions on Mobile Computing.

[26]  Mauro Leoncini,et al.  Partially controlled deployment strategies for wireless sensors , 2009, Ad Hoc Networks.

[27]  Guy Pujolle,et al.  Multi-Objective WSN Deployment: Quality of Monitoring, Connectivity and Lifetime , 2010, 2010 IEEE International Conference on Communications.

[28]  Robert M. Newman,et al.  Wireless Sensor Networks: The Quest for Planetary Field Sensing , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[29]  Sampath Kannan,et al.  Sampling based sensor-network deployment , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).