标题: | Coverage by randomly deployed wireless sensor networks |
作者: | Wan, PJ Yi, CW 资讯工程学系 Department of Computer Science |
关键字: | asymptotics;connectivity;k-coverage;node density;sensing radius;wireless ad hoc sensor networks |
公开日期: | 1-六月-2006 |
摘要: | One of the main applications of wireless sensor networks is to provide proper coverage of their deployment regions. A wireless sensor network k-covers its deployment region if every point in its deployment region is within the coverage ranges of at least k sensors. In this paper, we assume that the sensors are deployed as either a Poisson point process or a uniform point process in a square or disk region, and study how the probability of the k-coverage changes with the sensing radius or the number of sensors. Our results take the complicated boundary effect into account, rather than avoiding it by assuming the toroidal metric as done in the literature. |
URI: | http://dx.doi.org/10.1109/TIT.2005.862092 http://hdl.handle.net/11536/12184 |
ISSN: | 0018-9448 |
DOI: | 10.1109/TIT.2005.862092 |
期刊: | IEEE TRANSACTIONS ON INFORMATION THEORY |
Volume: | 52 |
Issue: | 6 |
起始页: | 2658 |
结束页: | 2669 |
显示于类别: | Conferences Paper |
文件中的档案:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.