a stochastic -coverage scheduling algorithm in wireless sensor networks一个随机覆盖调度算法在无线传感器网络.pdfVIP

Hindawi Publishing Corporation International Journal of Distributed Sensor Networks Volume 2012, Article ID 746501, 11 pages doi:10.1155/2012/746501 Research Article A Stochastic k-Coverage Scheduling Algorithm in Wireless Sensor Networks Jiguo Yu,1, 2 Shaohua Ren,1 Shengli Wan,1 Dongxiao Yu,3 and Guanghui Wang4 1 School of Computer Science, Qufu Normal University, Rizhao 276826, China 2 Key Laboratory for Intelligent Control Technique of Shandong Province, Qufu Normal University, Rizhao 276826, China 3 Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong 4 School of Mathematics, Shandong University, Shandong, Jinan 250100, China Correspondence should be addressed to Jiguo Yu, jiguoyu@ 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 k-coverage scheduling problem to guarantee k-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 k-coverage problem. Each sensor node runs a stochastic k-coverage-preserving scheduling algorithm to determin