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

Authors:
Yang Xiao;Hui Chen;Kui Wu;Bo Sun;Ying Zhang;Xinyu Sun;Chong Liu
Affiliations:
The University of Alabama, Tuscaloosa;Virginia State University, Petersburg;University of Victoria, Victoria;Lamar University, Beaumont;Soochow University, Suzhou;Tulane University, New Orleans;University of Victoria, Victoria and Research In Motion Limited, Ontario
Venue:
IEEE Transactions on Computers
Year:
2010

Citing 0
Cited 7

Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Weaving a proper net to catch large objects in wireless sensor networks

IEEE Transactions on Wireless Communications
Optimizing data collection path in sensor networks with mobile elements

International Journal of Automation and Computing
Primate-Inspired Communication Methods for Mobile and Static Sensors and RFID Tags

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks

ACM Transactions on Sensor Networks (TOSN)
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks

International Journal of Sensor Networks
Partial sensing coverage with connectivity in lattice wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.