基于地址子树zigbee路由算法的分析-analysis of zigbee routing algorithm based on address subtree.docxVIP

AbstractZigBee as a new short-range, low-cost, low-power wireless communication technology is widely used in the field of industrial control, building automation, smart home, health care, retail services. But its protocols and applications are still in development due to the ZigBee technology appeared later, so the research of ZigBee protocol has important significance for the development and application of ZigBee technology.Through the analysis of ZigBee technology standards, the ZigBee networking, address allocation mechanism and two commonly routing algorithms used in ZigBee standards: the Cluster-Tree and AODVjr. On this basis, the efficiency problem of Cluster-Tree routing algorithm was pointed out. To resolve this problem, a routing algorithm based on the Address-Subtree is given, which defined the Address-Subtree of destination node based on the ZigBee network address allocation relationship and using ZigBee protocol address assignment mechanism to calculate the Address-Subtree of the destination node, then the algorithm find the neighbor node, one of the Address-Subtree to select the next hop, if not, the AODVjr algorithm based on control-overhead reduced is performed. After that, the NS2 simulation platform for the ZigBee protocol was built, to implement the three aforementioned routing algorithms.Simulation results show that the Address-Tree routing algorithm can reduce the control-overhead as compared to AODVjr routing algorithm, and reduce the number of routing hops as compared to Cluster-Tree routing algorithm, which means it achieves a balance between control-overhead and routing hops.Keywords: Wireless Sensor NetworksAddress-SubtreeRouting Algorithm Network Simulation目录摘要............................................................................................................... IAbstract ........................................................................................................ II1绪论1.1研究背景 .........................................