基于ZigBee无线网络的Cluster-Tree路由算法研究  

Research on Cluster-Tree algorithm based on ZigBee wireless network

作　　者：赵博[1,2] 吴静[1,2] 

机构地区：[1]西南科技大学信息工程学院,四川绵阳621010 [2]特殊环境机器人技术四川省重点实验室,四川绵阳621010

出　　处：《电子技术应用》2016年第4期116-119,123,共5页Application of Electronic Technique

基　　金：四川省2014年科技计划项目(2014JY0215)

摘　　要：针对ZigBee无线网络中Cluster-Tree算法只依靠父子关系路由且ZigBee技术传输带宽的限制,致使网络中负载较重的链路不能及时传递信息,而造成网络拥塞、丢包和较低的吞吐量问题,提出了一种改进算法Z-DMHCTR。该算法针对负载超过一定限度的节点,除了按照原等级树算法路由之外,结合引入的邻居列表信息,寻找节点不与原路径相交的路径同时进行信息传输,从而提高网络带宽利用率,达到提升网络的吞吐量的目的。仿真实验主要从网络吞吐量、端到端数据传输延时等方面入手进行对比。结果表明,改进算法能够有效地提高网络吞吐量,并降低了传输数据的延时。For Cluster- tree algorithm only relays on parent- child relationship to rout in Zig Bee wireless network and the limited bandwidth of Zig Bee technology will result in that the heavily loaded link can ′ t timely transmit information and so prone to network congestion, packet loss and lower network throughput problem, this paper proposes an optimization algorithm, the Z- DMHCTR algorithm, which combines with neighbor list among the nodes to find a node disjoint paths with the original path to transmit informa-tion, thereby improving network bandwidth utilization and increasing the network throughput. Through the simulation, this paper com-pares the difference of improved algorithm and the original algorithm in the network throughput, end data transmission delay and other aspects of difference. The result shows that the improved algorithm effectively improves the network throughput, and reduces the time delay of data transmission simultaneously.

关 键 词：ZIGBEE网络 Cluster-Tree算法 Z-DMHCTR算法 邻居列表 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]