Affiliation:
1. Huazhong University of Science and Technology, China
Abstract
Sensor networks, which consist of sensor nodes each capable of sensing environment and transmitting data, have lots of applications in battlefield surveillance, environmental monitoring, industrial diagnostics, etc. Coverage which is one of the most important performance metrics for sensor networks reflects how well a sensor field is monitored. Individual sensor coverage models are dependent on the sensing functions of different types of sensors, while network-wide sensing coverage is a collective performance measure for geographically distributed sensor nodes. This article surveys research progress made to address various coverage problems in sensor networks. We first provide discussions on sensor coverage models and design issues. The coverage problems in sensor networks can be classified into three categories according to the subject to be covered. We state the basic coverage problems in each category, and review representative solution approaches in the literature. We also provide comments and discussions on some extensions and variants of these basic coverage problems.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference197 articles.
1. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
2. Probabilistic coverage in wireless sensor networks
3. Ahuja S. K. Kini S. and Ramasubramanian S. 2009. Bounds on coverage time and node density for multi-modality sensing. Elsevier Ad Hoc Netw. DOI:10.1016/j.adhoc.2009.01.006. 10.1016/j.adhoc.2009.01.006 10.1016/j.adhoc.2009.01.006
Cited by
368 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献