An Enhanced Cluster-tree Routing Algorithm in ZigB
no vote
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.