Title: BHAR: a bidirectional hierarchy-based anycast routing protocol for wireless sensor networks

Authors: Po-Jen Chuang; Teng-Tai Hu

Addresses: Department of Electrical Engineering, Tamkang University, Tamsui, New Taipei City, 25137, Taiwan ' Department of Network Operation and Maintenance, Chunghwa Telecom Co., Ltd., No. 21, Sec. 1, Xinyi Rd., Zhongzheng Dist., Taipei City 100, Taiwan

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.

Keywords: wireless sensor networks; WSNs; hierarchy; anycast routing protocols; first declaration wins; location-less; bidirectional routing protocols; network lifetime; simulation.

DOI: 10.1504/IJCNDS.2014.063968

International Journal of Communication Networks and Distributed Systems, 2014 Vol.13 No.1, pp.1 - 24

Received: 26 Oct 2012
Accepted: 30 May 2013

Published online: 28 Jul 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article