Hybrid Cluster Tree Routing In Zigbee Network

Saurabh P. Surshe, S. D. Zade, Ms. U. K. Thakur


The ZigBee tree routing is widely used in many resource-limited places and applications it doesnt require any routing table and route discovery overhead to send a packet to the destination. science, the ZigBee tree routing has the only one limitation that a packet follows the tree topology; thus, it cannot provide the shortest routing path, however we propose the shortcut tree routing (STR) protocol that provides the near optimal routing path as well as maintains the advantages of the ZigBee tree routing such as no route discovery overhead and very low memory consumption. The main goal of the shortcut tree routing is to calculate remaining hops from an random source to the destination using the hierarchical addressing scheme in ZigBee, and each source and intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. In the performance evaluation, we will see that the shortcut tree routing achieves the comparable performance to AODV with limited overhead of neighbor table maintenance as well as overwhelms the ZigBee tree routing in all the network conditions such as network overhead, network configurations type, and the network traffic. Taking into account of low efficiency and high power consumption caused by flooding of RREQ in AODV algorithm, the paper proposes a Cluster-tree routing algorithm to reduce network traffic and enhance efficiency of the whole network.

Full Text:



  • There are currently no refbacks.