首页 | 本学科首页   官方微博 | 高级检索  
     

ZigBee中改进的Cluster-Tree路由算法
引用本文:谢川. ZigBee中改进的Cluster-Tree路由算法[J]. 计算机工程, 2011, 37(7): 115-117. DOI: 10.3969/j.issn.1000-3428.2011.07.038
作者姓名:谢川
作者单位:重庆工商大学计算机科学与信息工程学院,重庆,400067
摘    要:针对ZigBee网络的Cluster-Tree算法对簇首能量要求高、选择的路由非最佳路由等问题,结合节点能量分析和节点邻居表,提出一种改进的簇首生成方法,利用AODVjr算法为节点选择最佳路由。仿真结果证明,与原Cluster-Tree算法相比,改进的算法能有效提高数据发送成功率,减少源节点与目标节点间的跳数,降低端到端的报文传输时延,提高网络的使用价值。

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

Improved Cluster-Tree Routing Algorithm in ZigBee
XIE Chuan. Improved Cluster-Tree Routing Algorithm in ZigBee[J]. Computer Engineering, 2011, 37(7): 115-117. DOI: 10.3969/j.issn.1000-3428.2011.07.038
Authors:XIE Chuan
Affiliation:XIE Chuan(College of Computer Science and Information Engineering,Chongqing Technology and Business University,Chongqing 400067,China)
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.
Keywords:ZigBee network  routing algorithm  Cluster-Tree algorithm  AODVjr algorithm  neighbor table
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号