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 条
[41]  
Sheu JP, 2008, IEEE GLOBAL TELECOMM, P1
[42]   A MODEL OF SET-THEORY IN WHICH EVERY SET OF REALS IS LEBESGUE MEASURABLE [J].
SOLOVAY, RM .
ANNALS OF MATHEMATICS, 1970, 92 (01) :1-&
[43]  
Tan HS, 2010, LECT NOTES COMPUT SC, V6221, P1
[44]  
Wang B, 2010, COMPUT COMMUN NETW S, P1, DOI 10.1007/978-1-84996-059-5
[45]   Bidding protocols for deploying mobile sensors [J].
Wang, Guiling ;
Cao, Guohong ;
Berman, Piotr ;
La Porta, Thomas F. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (05) :515-528
[46]   Wireless sensor network survey [J].
Yick, Jennifer ;
Mukherjee, Biswanath ;
Ghosal, Dipak .
COMPUTER NETWORKS, 2008, 52 (12) :2292-2330
[47]   Localized algorithms for coverage boundary detection in wireless sensor networks [J].
Zhang, Chi ;
Zhang, Yanchao ;
Fang, Yuguang .
WIRELESS NETWORKS, 2009, 15 (01) :3-20
[48]  
ZHANG H., 2005, Ad Hoc & Sensor Wireless Netw., V1, P89
[49]   A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks [J].
Zou, Y ;
Chakrabarty, K .
IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (08) :978-991
[50]  
Zou Y, 2003, IEEE INFOCOM SER, P1293