A Node-Protection-Based ZBR Routing Algorithm

Abstract

The Zigbee network is a new type of wireless short-range communication network with powerful self-organizing capabilities. Routing algorithms are key to Zigbee network research. However, the segmentation of the Zigbee network is commonly observed, as nodes closer to the coordinator consume a larger amount of energy and are thereby vulnerable to early stage death. Thus, we propose a node-protection-based Zigbee routing (NPZBR) algorithm to address this problem. First, Zigbee network allocation mechanisms and shortages of typical routing protocols i.e., the cluster-tree and ad-hoc on-demand distance vector junior (AODVjr) algorithms, are analyzed. Second, the NPZBR algorithm, based on a combination of the cluster-tree and AODVjr algorithms, is proposed, and an energy threshold model for node protection is developed. A node energy flag bit is introduced to determine whether the node should be protected. Finally, the simulation of NPZBR parameters for the selection of the node threshold model, node residual energy, node survival rate, node mortality rate, and end-to-end delay, is performed. Simulations demonstrate that compared to the traditional Zigbee routing (ZBR) algorithm, the proposed algorithm consumes 10% less energy and improves the node survival rate by 4%. Moreover, it reduces the node mortality rate and the end-to-end delay, effectively protecting network nodes and enhancing network integrity.