ZigBee provides a simple and reliable solution for the low-cost networks. The ZigBee ad hoc on-demand distance vector (Z-AODV) could use the global shortest path for data transmission by flooding the routing quest when necessary. However, the current routing algorithms cannot fully address the energy consumption issue. In this paper, we propose a directional broadcasting algorithm in routing discovery (DBRD) to reduce the routing overhead. Based on the network addresses, the network is divided into several continuous ‘clusters’. The node relative positioning and direction information are represented by the sequence of the clusters, and the devices which are not in the clusters covering the shortest path may not take part in the routing request rebroadcasting. The simulation results show that the DBRD could improve the performances of routing discovery, the routing overhead was effectively reduced and the end-to-end delay was also shortened since the algorithm occupied less finding time.
['Jiasong Mu']
A directional broadcasting algorithm for routing discovery in ZigBee networks