Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
- 6 November 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 59 (4) , 507-521
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.Keywords
This publication has 18 references indexed in Scilit:
- Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor NetworksIEEE Transactions on Parallel and Distributed Systems, 2007
- WSN10-3: Maximizing Network Lifetime under QoS Constraints in Wireless Sensor Networks2006
- Connected sensor cover: self-organization of sensor networks for efficient query executionIEEE/ACM Transactions on Networking, 2006
- Differentiated surveillance for sensor networks2003
- Power efficient organization of wireless sensor networks2002
- Coverage problems in wireless ad-hoc sensor networks2002
- A coverage-preserving node scheduling scheme for large wireless sensor networks2002
- Topology management for sensor networks2002
- ASCENTACM SIGCOMM Computer Communication Review, 2002
- Span2001