coverability of wireless sensor networks

ISCAS OpenIR

	coverability of wireless sensor networks
	Wang Yin; Huang Zhiyu
	2011
Source	Tsinghua Science and Technology
ISSN	1007-0214
Volume	16 Issue:6 Pages:622-631
English Abstract	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(n²) 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(n²) complexity. © 2011 Tsinghua University Press.
Indexed Type	EI
Keyword	Algorithms 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	期刊论文
URI	http://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.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院软件研究所机构知识库