ISCAS OpenIR
coverability of wireless sensor networks
Wang Yin; Huang Zhiyu
2011
SourceTsinghua Science and Technology
ISSN1007-0214
Volume16Issue:6Pages:622-631
English AbstractThe 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.
Indexed TypeEI
KeywordAlgorithms Computational Geometry Electric Network Synthesis Graph Theory Graphic Methods Quality Of Service Sensors Triangulation
Department(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
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/16136
Collection中国科学院软件研究所
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang Yin]'s Articles
[Huang Zhiyu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang Yin]'s Articles
[Huang Zhiyu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang Yin]'s Articles
[Huang Zhiyu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.