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

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

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/98968

Title:	BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks
Authors:	Po-Jen Chuang;Teng-Tai Hu
Contributors:	電機工程學系暨研究所
Keywords:	wireless sensor networks;WSNs;hierarchy;anycast routing protocols;first declaration wins;location-less;bidirectional routing protocols;network lifetime;simulation
Date:	2014-08
Issue Date:	2014-09-28 15:28:05 (UTC+8)
Abstract:	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.
Relation:	International Journal of Communication Networks and Distributed Systems 13(1), p. 1-24
DOI:	10.1504/IJCNDS.2014.063968
Appears in Collections:	[電機工程學系暨研究所] 期刊論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	47	View/Open