Optimum Partition of Sensing Field with Given Probability on Event Locations

We investigate how to distribute large quantity of sensors in such a way that workload is evenly shared by sensors. These techniques can also be used for regulating agile mobile sensors, such as UAVs, when the workload of sensors rather than the energy for mobility is the primarily concern. An algorithm is developed for partitioning sensing field such that different partitions have different sensor densities. The goal is to minimize unevenness of the workload to sensor density ratio. The output of the algorithm proved to be the global optimum for serving this purpose.

[1]  Arobinda Gupta,et al.  Line coverage measures in wireless sensor networks , 2014, J. Parallel Distributed Comput..

[2]  Nguyen Xuan Hoai,et al.  An efficient genetic algorithm for maximizing area coverage in wireless sensor networks , 2019, Inf. Sci..

[3]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[4]  Jorge Cortés,et al.  Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks , 2010, IEEE Transactions on Automatic Control.

[5]  Mostafa A. Elhosseini,et al.  Deployment Techniques in Wireless Sensor Networks, Coverage and Connectivity: A Survey , 2019, IEEE Access.

[6]  Anthony Tzes,et al.  Convex Voronoi-inspired space partitioning for heterogeneous networks: a coverage-oriented approach , 2010 .

[7]  Shaojie Tang,et al.  Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

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

[9]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[10]  Stéphane Lafortune,et al.  An algorithm for maximising covered area , 2008, Int. J. Control.

[11]  Vijay Kumar,et al.  Sensing and coverage for a network of heterogeneous robots , 2008, 2008 47th IEEE Conference on Decision and Control.

[12]  Sajal K. Das,et al.  A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[13]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[14]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[15]  George J. Pappas,et al.  Adaptive Deployment of Mobile Robotic Networks , 2013, IEEE Transactions on Automatic Control.

[16]  Jalal Habibi,et al.  A nonlinear optimization approach to coverage problem in mobile sensor networks , 2011, IEEE Conference on Decision and Control and European Control Conference.

[17]  Marc St-Hilaire,et al.  Coverage protocols for wireless sensor networks: Review and future directions , 2019, Journal of Communications and Networks.

[18]  Emilio Frazzoli,et al.  Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks , 2011, IEEE Transactions on Automatic Control.

[19]  Anthony Tzes,et al.  Spatially distributed area coverage optimisation in mobile robotic networks with arbitrary convex anisotropic patterns , 2013, Autom..