Coverage and connectivity issues in wireless sensor networks: A survey

被引:315
作者
Ghosh, Amitabha [1 ]
Das, Sajal K. [2 ]
机构
[1] Univ Southern Calif, Ming Hsieh Dept Elect Engn, Autonomous Networks Res Grp ANRG, Los Angeles, CA 90007 USA
[2] Univ Texas Arlington, Ctr Res Wireless Mobil & Networking CReWMaN, Dept Comp Sci & Engn, Arlington, TX 76019 USA
关键词
Wireless sensor networks; Area coverage; Network connectivity; Computational geometry; Network topology;
D O I
10.1016/j.pmcj.2008.02.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Sensing coverage and network connectivity are two of the most fundamental problems in wireless sensor networks. Finding an optimal node deployment strategy that would minimize cost, reduce computation and communication overhead, be resilient to node failures, and provide a high degree of coverage with network connectivity is extremely challenging. Coverage and connectivity together can be treated as a measure of quality of service in a sensor network; it tells us how well each point in the region is covered and how accurate is the information gathered by the nodes. Therefore, maximizing coverage as well as maintaining network connectivity using the resource constrained nodes is a non-trivial problem. In this survey article, we present and compare several state-of-the-art algorithms and techniques that aim to address this coverage-connectivity issue. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:303 / 334
页数:32
相关论文
共 76 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
Alam SMN, 2006, MOBICOM 2006, P346
[3]  
Allen G.W, 2006, P 7 USENIX S OP SYST
[4]  
Ammari H.M., 2008, IEEE T COMPUT
[5]  
[Anonymous], 2004, P IEEE INT C ROB AUT
[6]  
[Anonymous], 2001, Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC '01, (New York, NY, USA)
[7]  
[Anonymous], 2003, Proc. ACM on Wireless Sensor Networks and Applications WSNA, DOI [10.1145/941350.941367, DOI 10.1145/941350.941367]
[8]  
[Anonymous], 2001, P 4 INT C INF FUS FU
[9]  
[Anonymous], 1987, ART GALLERY THEOREMS
[10]  
[Anonymous], 2006, P 7 ACM INT S MOB AD