Institutional Repository
| coverability of wireless sensor networks | |
| Wang Yin; Huang Zhiyu | |
| 2011 | |
| 发表期刊 | Tsinghua Science and Technology
![]() |
| ISSN | 1007-0214 |
| 卷号 | 16期号:6页码:622-631 |
| 摘要 | 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 |
| 关键词 | Algorithms Computational Geometry Electric Network Synthesis Graph Theory Graphic Methods Quality Of Service Sensors Triangulation |
| 部门归属 | (1) Tsinghua National Laboratory for Information Science and Technology School of Software Tsinghua University Beijing 100084 China; (2) Institute of Software Chinese Academy of Sciences Beijing 100084 China |
| 语种 | 英语 |
| 内容类型 | 期刊论文 |
| URI标识 | 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. |
| 条目包含的文件 | 条目无相关文件。 | |||||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 查看访问统计 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Wang Yin]的文章 |
| [Huang Zhiyu]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Wang Yin]的文章 |
| [Huang Zhiyu]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Wang Yin]的文章 |
| [Huang Zhiyu]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论