Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks
Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks
复制标题
DOI：
10.1109/tpds.2014.9
复制
发表时间：
2014-03
影响因子：
5.3
通讯作者：
Taehong Kim;S. Kim;Jinyoung Yang;Seong-eun Yoo;Daeyoung Kim
中科院分区：
文献类型：
--
作者：
Taehong Kim;S. Kim;Jinyoung Yang;Seong-eun Yoo;Daeyoung Kim
ZigBee树路由广泛用于许多资源有限的设备和应用中，因为它不需要任何路由表和路由发现开销来将分组发送到目的地。然而，ZigBee树路由有一个根本的限制，即一个数据包遵循树拓扑结构，因此，它不能提供最优的路由路径，在本文中，我们提出了捷径树路由（STR）协议，提供近最优的路由路径，以及保持的优势，ZigBee树路由，如没有路由发现开销和低内存消耗。捷径树路由的主要思想是使用ZigBee中的分层寻址方案来计算从任意源到目的地的剩余跳数，并且每个源或中间节点将分组转发到其邻居表中具有最小剩余跳数的邻居节点。捷径树路由是完全分布式的，并且与ZigBee标准兼容，因为它只利用寻址方案和邻居表而不改变规范。数学分析证明，1跳邻居信息通过提供有效的路由路径和分配集中在树链路上的流量负载来改善网络的整体性能。在性能评估中，我们表明，快捷树路由实现了与AODV具有有限的邻居表维护开销的性能相当，以及在所有网络条件下，如网络密度，网络配置，流量类型和网络流量的ZigBee树路由。
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.