摘要： 针对ZigBee网络的Cluster-Tree算法对簇首能量要求高、选择的路由非最佳路由等问题，结合节点能量分析和节点邻居表，提出一种改进的簇首生成方法，利用AODVjr算法为节点选择最佳路由。仿真结果证明，与原Cluster-Tree算法相比，改进的算法能有效提高数据发送成功率，减少源节点与目标节点间的跳数，降低端到端的报文传输时延，提高网络的使用价值。

关键词: ZigBee网络, 路由算法, Cluster-Tree算法, AODVjr算法, 邻居表

Abstract: Aiming at the problems of Cluster-Tree algorithm that cluster head node demands high energy and the routes selected between nodes is not optimal in ZigBee, this paper proposes an advanced method for forming the cluster head nodes resulting from node energy and neighbor table and a method for finding the best route resulting from AODVjr algorithm. Simulation results indicate that the advanced algorithm can effectively improve the success rate of packet transmission, cut down the hops between the target and the source node, reduce the end-to-end packet transmission delay, and enhance the network value.

Key words: ZigBee network, routing algorithm, Cluster-Tree algorithm, AODVjr algorithm, neighbor table

中图分类号: 

• TP393