BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks

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

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

题名:	BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks
作者:	Po-Jen Chuang;Teng-Tai Hu
贡献者:	電機工程學系暨研究所
关键词:	wireless sensor networks;WSNs;hierarchy;anycast routing protocols;first declaration wins;location-less;bidirectional routing protocols;network lifetime;simulation
日期:	2014-08
上传时间:	2014-09-28 15:28:05 (UTC+8)
摘要:	This paper presents a bidirectional hierarchy-based anycast routing (BHAR) protocol to facilitate data collection in multi-hop wireless sensor networks (WSNs). In contrast to existing HAR mechanisms (Thepvilojanapong et al., 2005), the proposed BHAR is able to prolong network lifetime as it constructs hierarchical trees and repairs routes faster. BHAR is unique in letting sinks and sources initialise the construction of a hierarchical tree. Whenever a node knows its own parent and neighbour nodes, it can join a tree, exchange/refresh the routing table, and perform route repair without the aid of geographical information or being controlled remotely. As simulation results have demonstrated, such a design makes BHAR a faster and better protocol in constructing trees and repairing routes than HAR.
關聯:	International Journal of Communication Networks and Distributed Systems 13(1), p. 1-24
DOI:	10.1504/IJCNDS.2014.063968
显示于类别:	[電機工程學系暨研究所] 期刊論文

文件中的档案:

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

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

TAIR相关文章