检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈浩 周克[1] 张庆芳[1] CHEN Hao;ZHOU Ke;ZHANG Qing-fang(Guizhou University,School of Electrical Engineering,Guiyang,Guizhou 550025,China)
出 处:《新型工业化》2017年第12期34-41,共8页The Journal of New Industrialization
基 金:贵州省教育厅科研项目;([2015]490);贵州省科技厅基金项目([黔科合LH字(2016)7434])
摘 要:针对目前Zigbee网络中普遍采用AODVjr算法负载不均衡和能量消耗大等问题,结合AODVjr算法和Cluster-Tree算法的优点,并克服这两种算法结合时传递路径选择比单独Cluster-Tree算法获取的传递路径更长以及在使用AODVjr算法时,可能会发生部分某些节点即使广播发出了RREQ消息分组却依旧没能辅助源节点搜索到并挑选出通向目的节点的传递路径的状况,从限制RREQ控制分组的洪泛方向和范围着手,综合考虑网络中节点的总能量消耗,提出了一种改进的AODVjr节能算法,仿真结果表明,该算法能够有效地减少网络能量消耗,延长网络寿命。Aiming at the problems of unbalanced load and high energy consumption of AODVjr algorithm in ZigBee network,this paper combines the advantages of AODVjr and Cluster-Tree and overcomes the problem that when the two algorithms are combined,the path selection is better than that of Cluster-Tree alone Of the transmission path longer and the use of AODVjr algorithm,some of the nodes may occur even if the broadcast RREQ message packets are still not able to assist the source node to find and pick the path to the destination node transfer path from the restrictions RREQ controls the flood direction and range of the packet.Considering the total energy consumption of nodes in the network,an improved AODVjr energy-saving algorithm is proposed.The simulation results show that the proposed algorithm can effectively reduce the network energy consumption and extend the network lifetime.
关 键 词:ZIGBEE网络 AODVjr算法 Cluster-Tree算法 洪泛方向
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.8