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

被引：83

作者：

Xiao, Yang ^{[1
]}

Chen, Hui ^{[2
]}

Wu, Kui ^{[3
]}

Sun, Bo ^{[4
]}

Zhang, Ying ^{[5
]}

Sun, Xinyu ^{[6
]}

Liu, Chong ^{[7
]}

机构：

[1] Univ Alabama, Dept Comp Sci, Tuscaloosa, AL 35487 USA

[2] Virginia State Univ, Dept Math & Comp Sci, Petersburg, VA 23806 USA

[3] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 2Y2, Canada

[4] Lamar Univ, Dept Comp Sci, Beaumont, TX 77710 USA

[5] Soochow Univ, Sch Math Sci, Suzhou 215006, Jiangsu, Peoples R China

[6] Tulane Univ, Dept Math, New Orleans, LA 70118 USA

[7] Res Mot Ltd, Toronto, ON L4W 0B5, Canada

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2010年 / 59卷 / 04期

基金：

美国国家科学基金会;

关键词：

Wireless sensor network; quality of service; network lifetime; coverage; optimization; OBJECT DETECTION;

D O I：

10.1109/TC.2009.170

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：507 / 521

页数：15