D0617032414

Shortcut Tree Routing Algorithm for Efficient Data Delivery in ZigBee Wireless Networks
Sharmilaa. S¹, Jagadeesan. A², Sathesh Kumar.T^3
1Sharmilaa.S, Department of Embedded Systems, PRIST University, India.
²Jagadeesan.A, Department of Embedded Systems, PRIST University, India.
³Satheshkumar.T, Department of Embedded Systems, PRIST University, India.
Manuscript received on March 05, 2014. | Revised Manuscript received on March 11, 2014. | Manuscript published on March 15, 2014. | PP: 11-15 | Volume-2 Issue-4, March 2014. | Retrieval Number: D0617032414/2014©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The ZigBee tree routing is widely used in many resource-limited devices and applications, since it does not require any routing table and route discovery overhead to send a packet to the destination. However, the ZigBee tree routing has the fundamental limitation that a packet follows the tree topology; thus, it cannot provide the optimal routing path. In this paper, we propose the shortcut tree routing 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 low memory consumption. The main idea of the shortcut tree routing is to calculate remaining hops from an arbitrary source to the destination using the hierarchical addressing scheme in ZigBee, and each source or intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. The shortcut tree routing is fully distributed and compatible with ZigBee standard in that it only utilizes addressing scheme and neighbor table without any changes of the specification. The mathematical analysis proves that the 1- hop neighbor information improves overall network performances by providing an efficient routing path and distributing the traffic load concentrated on the tree links. In the performance evaluation, we show 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 density, network configurations, traffic type, and the network traffic.
Keywords: ZigBee, Shortcut tree routing, Neighbor table, AODV.