首页> 中文期刊>广东工业大学学报 >基于自适应分簇机制的ZigBee路由优化算法

基于自适应分簇机制的ZigBee路由优化算法

     

摘要

ZigBee protocol uses the combination of AODVjr and Cluster-Tree algorithm as its own routing algorithm ( ZBR).But the routing algorithm does not combine the advantages of both ones so it leaves lit-tle possibility to improve the performance of network.In order to solve the problem,this paper proposes an algorithm which combines the advantages of AODVjr and Cluster-Tree routing algorithm,i.e.ACZBR algorithm.This algorithm uses Cluster-Tree algorithm within cluster and uses AODVjr algorithm between clusters.Meanwhile,in order to avoid dead nodes caused by excessive energy consumption of cluster-head nodes,this algorithm uses a cluster-head adaptive switching strategy to ensure the network perform-ance.The simulation result shows that the ZBR algorithm has greatly improved the performance of net-work lifetime,packet loss rate,delay and etc.%ZigBee协议虽然采用AODVjr和Cluster-Tree两种算法的结合体作为自身的路由算法(ZBR),但这种路由算法并没有结合到各自算法的优点,对于提高网络的性能是有限的.为此,提出了一种结合AODVjr和Cluster-Tree优点的分簇路由算法——ACZBR算法,该算法在簇内使用Cluster-Tree算法,在簇间使用AODVjr算法.同时,为了避免簇首节点由于能量过度消耗而成为死亡节点,该算法采用了簇首自适应切换策略,从而保证网络的性能.仿真结果表明,该算法对于ZBR算法在网络生存时间、丢包率、时延等方面都有明显的改善.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号