To overcome the flaws of ignoring the energy consumption and flooding RREQ packets in the present hybrid routing algorithms for ZigBee networks, we propose in this paper an efficient hybrid routing algorithm without flooding (EHRA). EHRA sufficiently utilizes the information of nodes' neighbors and includes the depth and the residual energy of nodes in its routing metric, so as to reduce overhead and to select nodes with more remaining energy for routing. Thus network overhead is reduced and the energy consumption of nodes is balanced. Theoretical analysis and simulation results show that EHRA outperforms the classical tree routing (TR) algorithm and the limited flooding ZigBee ad-hoc on-demand distance vector routing algorithm (LF-ZAODV ) in terms of routing overhead, energy balance of nodes, and network lifetime.

No abstract

In order to improve the non-optimal paths worked out by the ZigBee cluster-tree routing (ZTR) algorithm and to reduce the overhead of the AODVjr algorithm, we propose in this paper a low-overhead hybrid routing algorithm (LOHRA) for ZigBee networks. LOHRA effectively limits the flooding range of RREQ through utilizing the descendents of nodes and considers the length of paths and the minimum residual energy in path as routing metrics. Therefore, it not only ensures that the newly built paths are better than those of ZTR, but also reduces the redundant overhead of AODVjr and postpones the death of the nodes with low energy. Theoretical analysis and simulation results show that LOHRA outperforms the classical ZTR algorithm and AODVjr algorithm in terms of network overhead, network lifetime, and the end-to-end delay of data packets.