Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks
- 4 February 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 25 (3) , 706-716
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 (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 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
This publication has 22 references indexed in Scilit:
- Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location ExtrapolationJournal of Computer Networks and Communications, 2011
- Collection tree protocol2009
- Dynamic Source Routing in Ad Hoc Wireless Networks2007
- A survey on real-world implementations of mobile ad-hoc networksAd Hoc Networks, 2007
- Ad-hoc multicast routing on resource-limited sensor nodes2006
- TinyOS: An Operating System for Sensor Networks2005
- AODVjr, AODV simplifiedACM SIGMOBILE Mobile Computing and Communications Review, 2002
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersACM SIGCOMM Computer Communication Review, 1994
- The complexity of the network design problemNetworks, 1978
- On Finding Lowest Common Ancestors in TreesSIAM Journal on Computing, 1976