Sentry selection in sensor networks: theory and algorithms

We study the geometric aspects of the sentry selection problem for a sensor network with randomly distributed sensors, each of which covers a small disc. The problem is to partition the sensors into a predetermined number of groups, so that, for each group, the sensing regions of the sensors in that group together cover the region of interest. After presenting some theoretical results, we include descriptions of two fast partitioning algorithms, together with the results of simulating them on moderate-sized networks.

[1]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[2]  Ying Zhang,et al.  Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[3]  Li Xiao,et al.  An Adaptive Partitioning Scheme for Sleep Scheduling and Topology Control in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[4]  E. Gilbert.  The probability of covering a sphere with N circular caps , 1965 .

[5]  Martin Haenggi,et al.  Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency , 2006, IEEE Transactions on Parallel and Distributed Systems.

[6]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[7]  Zhiyuan Ren,et al.  Sentry-Based Power Management in Wireless Sensor Networks , 2003, IPSN.

[8]  J. Pach,et al.  Decomposition problems for multiple coverings with unit balls, manuscript. , 1988 .

[9]  S. Janson.  Random coverings in several dimensions , 1986 .

[10]  Koushik Kar,et al.  Dynamic node activation in networks of rechargeable sensors , 2005, IEEE/ACM Transactions on Networking.

[11]  P. A. P. Moran,et al.  Random circles on a sphere , 1962 .

[12]  János Pach,et al.  Indecomposable Coverings , 2005, Canadian Mathematical Bulletin.

[13]  Don Towsley,et al.  On the Coverage and Detectability of Large-scale Wireless Sensor Networks , 2003 .

[14]  János Pach,et al.  Unsplittable Coverings in the Plane , 2013, WG.

[15]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

[16]  Béla Bollobás,et al.  Sentry Selection in Wireless Networks , 2010, Advances in Applied Probability.

[17]  Stephan Olariu,et al.  Toward Adaptive Sleep Schedules for Balancing Energy Consumption in Wireless Sensor Networks , 2012, IEEE Transactions on Computers.

[18]  Béla Bollobás,et al.  Continuum percolation with steps in the square or the disc , 2005, Random Struct. Algorithms.

[19]  Peter Hall.  On the Coverage of $k$-Dimensional Space by $k$-Dimensional Spheres , 1985 .

[20]  János Pach,et al.  Decomposition of multiple coverings into many parts , 2007, SCG '07.

[21]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).