Coverage rate calculation in wireless sensor networks

被引:37
作者
Kashi, Saeed Sedighian [1 ]
Sharifi, Mohsen [1 ]
机构
[1] Iran Univ Sci & Technol, Tehran, Iran
关键词
Wireless sensor networks; Coverage rate; Boundary detection; Disk graph model; Probabilistic coverage; SENSING COVERAGE; DEPLOYMENT; PROTOCOLS; HOLES;
D O I
10.1007/s00607-012-0192-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The deployment of sensors without enough coverage can result in unreliable outputs in wireless sensor networks (WSNs). Thus sensing coverage is one of the most important quality of service factors in WSNs. A useful metric for quantifying the coverage reliability is the coverage rate that is the area covered by sensor nodes in a region of interest. The network sink can be informed about locations of all nodes and calculate the coverage rate centrally. However, this approach creates huge load on the network nodes that had to send their location information to the sink. Thus, a distributed approach is required to calculate the coverage rate. This paper is among the very first to provide a localized approach to calculate the coverage rate. We provide two coverage rate calculation (CRC) protocols, namely distributed exact coverage rate calculation (DECRC) and distributed probabilistic coverage rate calculation (DPCRC). DECRC calculates the coverage rate precisely using the idealized disk graph model. Precise calculation of the coverage rate is a unique property of DECRC compared to similar works that have used the disk graph model. In contrast, DPCRC uses a more realistic model that is probabilistic coverage model to determine an approximate coverage rate. DPCRC is in fact an extended version of DECRC that uses a set of localized techniques to make it a low cost protocol. Simulation results show significant overall performance improvement of CRC protocols compared to related works.
引用
收藏
页码:833 / 856
页数:24
相关论文
共 50 条
[1]  
Ab Aziz NAB, 2007, ICIAS 2007: INTERNATIONAL CONFERENCE ON INTELLIGENT & ADVANCED SYSTEMS, VOLS 1-3, PROCEEDINGS, P961
[2]  
Ahmed N, 2005, LCN 2005: 30TH CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, P672
[3]  
Akshay Naregalkar, 2010, 2010 International Conference on Emerging Trends in Robotics and Communication Technologies (INTERACT 2010), P350, DOI 10.1109/INTERACT.2010.5706178
[4]  
Alsalih W, 2008, SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, P364
[5]  
[Anonymous], WIRELESS SENSOR ACTU
[6]  
[Anonymous], IEEE AS PAC C CIRC S
[7]  
[Anonymous], 2004, ACM Trans Embedded Comput Syst, DOI DOI 10.1145/972627.972631
[8]  
[Anonymous], IEEE INT C COMP AID
[9]  
[Anonymous], J ADV SIGNAL PROC
[10]  
[Anonymous], 2009, INT C INF COMM SIGN