Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

In wireless sensor networks, some sensor nodes are put in sleep mode while other sensor nodes are in active mode for sensing and communication tasks in order to reduce energy consumption and extend network lifetime. This approach is a special case (k=2) of a randomized scheduling algorithm, in which k subsets of sensors work alternatively. In this paper, we first study the randomized scheduling algorithm via both analysis and simulations in terms of network coverage intensity, detection delay, and detection probability. We further study asymptotic coverage and other properties. Finally, we analyze a problem of maximizing network lifetime under quality of service constraints such as bounded detection delay, detection probability, and network coverage intensity. We prove that the optimal solution exists, and provide conditions of the existence of the optimal solutions.

[1]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[2]  Kay Römer,et al.  Wireless sensor networks: a new regime for time synchronization , 2003, CCRV.

[3]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[4]  Nael B. Abu-Ghazaleh,et al.  Infrastructure tradeoffs for sensor networks , 2002, WSNA '02.

[5]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.

[6]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[7]  Yang Xiao,et al.  Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks , 2005, Mob. Networks Appl..

[8]  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.

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

[10]  Yang Xiao,et al.  A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks , 2006, Mob. Networks Appl..

[11]  P.B. Godfrey,et al.  Naps: scalable, robust topology management in wireless ad hoc networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[13]  Xin Chen,et al.  Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[14]  Yang Xiao,et al.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks , 2022 .

[15]  Brighten Godfrey,et al.  Naps: scalable, robust topology management in wireless ad hoc networks , 2004, IPSN.

[16]  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).

[17]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[18]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

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

[20]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[21]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[22]  Yang Xiao,et al.  WSN10-3: Maximizing Network Lifetime under QoS Constraints in Wireless Sensor Networks , 2006, IEEE Globecom 2006.

[23]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[24]  Xiaojiang Du,et al.  Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks , 2009, Comput. Networks.