HAR: hierarchy-based anycast routing protocol for wireless sensor networks

Abstract

In this paper, we present hierarchy-based any-cast routing (HAR), a routing protocol for collecting data over multihop, wireless sensor networks. The design of the protocol aims to satisfy the requirements of sensor networks that every sensor transmits sensed data to the base station periodically or spontaneously. The base station constructs hierarchical tree by finding its child nodes which in turn discover their own child nodes and so on. HAR avoids both flooding and periodic updating of routing information but the tree will be reconstructed upon node failures or adding of new nodes. By knowing only its own parent and grandparent, each sensor can make forwarding decisions regardless of the knowledge on other neighboring nodes or geographical information. We evaluate the performance of HAR by using the ns-2 simulator and comparing with those of both DSR and AODV. The simulation results demonstrate that HAR achieves much higher delivery ratio and lower latency on various scenarios.