检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]辽宁工程技术大学电子与信息工程学院,辽宁葫芦岛125105
出 处:《计算机工程与设计》2013年第7期2353-2357,共5页Computer Engineering and Design
摘 要:针对Zigbee网状网络AODVjr路由算法在路由发现过程中引起的节点能耗不均衡问题,提出了一种通过有效选择转发节点,动态建立通信路径的路由选择算法。该算法在定义通信代价函数的基础上,通过限定邻居前区集合来确定待选节点集,并综合考虑待选节点的剩余能量以及待选节点转发数据至下一跳的能量损耗,选择具有最小通信代价的节点转发数据,尽可能的减小节点在路由发现过程中所引起的不必要的能量损耗。仿真结果表明,该算法能够有效地均衡节点能量、降低网络能耗、延长网络生命周期。Aimed at the problems that unbalanced node energy consumption in the process of routing discovery in Zigbee AODVjr routing algorithm, a routing algorithm which can effectively select the forward node and dynamically establish communication paths is proposed. In the basis of communication cost, through the former area of neighbors to determine the conditions of matching nodes, comprehensive consideration of the residual energy of candidate nodes, the energy consumption of candidate nodes forward data to the next hop, the minimum communication cost of node is choosen to forward data and to reduce the unnecessary loss of energy in the process of route discovery. The simulation results indicate that the algorithm can effectively balance node energy, reduce network energy consumption, extend the network's lifetime.
关 键 词:ZIGBEE网络 节点能耗 待选节点 剩余能量 通信代价
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117