A Hole Avoiding Routing Protocol using a Relative Neighborhood Graph for Wireless Sensor Networks

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/104268

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/104268

题名:	A Hole Avoiding Routing Protocol using a Relative Neighborhood Graph for Wireless Sensor Networks
作者:	Tsai, Chih-Hsiao;Wang, Ying-Hong;Lee, Liang-Yi
关键词:	Wireless sensor network;Hole detection, Relative neighborhood graph;Hole avoiding routing
日期:	2013-12-01
上传时间:	2016-01-06 10:53:32 (UTC+8)
摘要:	In wireless sensor networks, “holes” are difficult to find and avoid because of various actual geographical environments. A hole can form dynamically due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we propose a novel algorithm, the Relative Neighborhood Graph Hole.Avoiding Routing protocol (RNGHAR), which uses relative neighborhood graphs (RNG) to model holes so that hole information can be collected in order to construct a routing path that avoids holes in advance. Therefore, event packets will be guided to avoid the hole and move along the shortest path from the source node to the sink node. Simulations how that the proposed method achieves good performance in terms of the average hop count, packet delivery success rate, and power consumption in comparison with existing protocols.
關聯:	Journal of Internet Technology 14(7), pp.1021-1031
DOI:	10.6138/JIT.2013.14.7.02
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	288	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章