coverability of wireless sensor networks
文献类型：期刊论文
| 作者 | Wang Yin ; Huang Zhiyu |
| 刊名 | Tsinghua Science and Technology
 |
| 出版日期 | 2011 |
| 卷号 | 16期号:6页码:622-631 |
| 关键词 | Algorithms Computational geometry Electric network synthesis Graph theory Graphic methods Quality of service Sensors Triangulation |
| ISSN号 | 1007-0214 |
| 中文摘要 | The coverability of Wireless Sensor Networks (WSNs) is essentially a Quality of Service (QoS) problem that measures how well the monitored area is covered by one or more sensor nodes. The coverability of WSNs was examined by combining existing computational geometry techniques such as the Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques. Three new evaluation algorithms, known as CRM (Comprehensive Risk Minimization), TWS (Threshold Weight Shortest path), and CSM (Comprehensive Support Maximization), were introduced to better measure the coverability. The experimental results show that the CRM and CSM algorithms perform better than the MAM (MAximize Minimum weight) and MIM (MInimize Maximum weight) algorithms, respectively. In addition, the TWS algorithm can provide a lower bound detection possibility that accurately reflects the coverability of the wireless sensor nodes. Both theoretical and experimental analyses show that the proposed CRM, TWS, and CSM algorithms have O(n2) complexity. © 2011 Tsinghua University Press. |
| 英文摘要 | The coverability of Wireless Sensor Networks (WSNs) is essentially a Quality of Service (QoS) problem that measures how well the monitored area is covered by one or more sensor nodes. The coverability of WSNs was examined by combining existing computational geometry techniques such as the Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques. Three new evaluation algorithms, known as CRM (Comprehensive Risk Minimization), TWS (Threshold Weight Shortest path), and CSM (Comprehensive Support Maximization), were introduced to better measure the coverability. The experimental results show that the CRM and CSM algorithms perform better than the MAM (MAximize Minimum weight) and MIM (MInimize Maximum weight) algorithms, respectively. In addition, the TWS algorithm can provide a lower bound detection possibility that accurately reflects the coverability of the wireless sensor nodes. Both theoretical and experimental analyses show that the proposed CRM, TWS, and CSM algorithms have O(n2) complexity. © 2011 Tsinghua University Press. |
| 收录类别 | EI |
| 语种 | 英语 |
| 公开日期 | 2013-10-08 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16136]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Wang Yin,Huang Zhiyu. coverability of wireless sensor networks[J]. Tsinghua Science and Technology,2011,16(6):622-631. |
| APA | Wang Yin,&Huang Zhiyu.(2011).coverability of wireless sensor networks.Tsinghua Science and Technology,16(6),622-631. |
| MLA | Wang Yin,et al."coverability of wireless sensor networks".Tsinghua Science and Technology 16.6(2011):622-631. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。