The Research Of ZigBee Routing Algorithm Based On Address-subtree

ZigBee as a new short-range, low-cost, low-power wireless communicationtechnology is widely used in the field of industrial control, building automation, smarthome, health care, retail services. But its protocols and applications are still indevelopment due to the ZigBee technology appeared later, so the research of ZigBeeprotocol has important significance for the development and application of ZigBeetechnology.Through the analysis of ZigBee technology standards, the ZigBee networking,address allocation mechanism and two commonly routing algorithms used in ZigBeestandards: the Cluster-Tree and AODVjr. On this basis, the efficiency problem ofCluster-Tree routing algorithm was pointed out. To resolve this problem, a routingalgorithm based on the Address-Subtree is given, which defined the Address-Subtree ofdestination node based on the ZigBee network address allocation relationship and usingZigBee protocol address assignment mechanism to calculate the Address-Subtree of thedestination node, then the algorithm find the neighbor node, one of the Address-Subtree toselect the next hop, if not, the AODVjr algorithm based on control-overhead reduced isperformed. After that, the NS2simulation platform for the ZigBee protocol was built, toimplement the three aforementioned routing algorithms.Simulation results show that the Address-Tree routing algorithm can reduce thecontrol-overhead as compared to AODVjr routing algorithm, and reduce the number ofrouting hops as compared to Cluster-Tree routing algorithm, which means it achieves abalance between control-overhead and routing hops.