About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 746501, 11 pages
Research Article

A Stochastic -Coverage Scheduling Algorithm in Wireless Sensor Networks

1School of Computer Science, Qufu Normal University, Rizhao 276826, China
2Key Laboratory for Intelligent Control Technique of Shandong Province, Qufu Normal University, Rizhao 276826, China
3Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong
4School of Mathematics, Shandong University, Shandong, Jinan 250100, China

Received 20 July 2012; Accepted 19 September 2012

Academic Editor: Limin Sun

Copyright © 2012 Jiguo Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Coverage is one of the key issues to achieve energy efficiency of a wireless sensor network. Sensor scheduling is one of the most important methods to solve coverage problems. It can ensure the coverage degree of a region and prolong the network lifetime. In this paper, we focus on the -coverage scheduling problem to guarantee -coverage sensing and network connectivity. We consider both deterministic and stochastic sensing models of the sensors and adapt the results of deterministic sensing model to solve the sensor scheduling problem under the stochastic sensing model. We use regular pentagons to divide the sensing disks to solve the -coverage problem. Each sensor node runs a stochastic -coverage-preserving scheduling algorithm to determine its work modes, and redundant nodes can enter into sleep mode, while active nodes ensure the coverage of the network. Theoretical analysis and simulation results show that our algorithm can reduce the number of active nodes and extend the network lifetime significantly while maintaining a given coverage degree.