Design and optimization of distributed sensing coverage in wireless sensor networks

被引:21
作者
Yan, Ting [1 ]
Gu, Yu [2 ]
He, Tian [2 ]
Stankovic, John A. [1 ]
机构
[1] Univ Virginia, Dept Comp Sci, Charlottesville, VA 22904 USA
[2] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
关键词
algorithms; performance; design; sensor networks; sensing coverage; energy conservation;
D O I
10.1145/1347375.1347386
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
For many sensor network applications, such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while, at the same time, minimizing energy consumption and extending system lifetime by leveraging the redundant deployment of sensor nodes. In this paper, we propose a surveillance service for sensor networks based on a distributed energy-efficient sensing coverage protocol. In the protocol, each node is able to dynamically decide a schedule for itself to guarantee a certain degree-of-coverage (DOC) with average energy consumption inversely proportional to the node density. Several optimizations and extensions are proposed to enhance the basic design with a better load-balance feature and a longer network lifetime. We consider and address the impact of the target size and the unbalanced initial energy capacity of individual nodes to the network lifetime. Several practical issues such as the localization error, irregular sensing range, and unreliable communication links are addressed as well. Simulation shows that our protocol extends system lift-time significantly with low energy consumption. It outperforms other state-of-the-art schemes by as much as 50% reduction in energy consumption and as much as 130% increase in the half- life of the network.
引用
收藏
页数:40
相关论文
共 39 条
[1]  
AHN GS, 2002, IEEE INFOCOM
[2]  
Alt H., 1995, P 7 CAN C COMP GEOM, P67
[3]  
[Anonymous], ACM T SENSOR NETWORK
[4]  
[Anonymous], 2002, ENERGY EFFICIENT ROB
[5]  
BHATNAGAR S, 2001, INT S WIR PERS MULT
[6]  
BHATTACHARYA S, 2003, 1 INT C MOB SYST APP
[7]  
CAO Q, 2005, INT C DISTR COMP SEN
[8]  
CERPA A, 2002, P IEEE COMP COMM SOC
[9]  
CHEN B, 2001, 6 ACM MOBICOM C
[10]   Finding the largest area axis-parallel rectangle in a polygon [J].
Daniels, K ;
Milenkovic, V ;
Roth, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (1-2) :125-148