摘要: 针对AODVjr算法在路由查找过程中的盲目性导致网络能量利用率不高的问题,提出一种基于路径宽度的W-AODVjr算法。该算法通过在源节点与目的节点之间形成一个环状封闭路由查找区域,并采用指数查找的方式确认最优路径宽度。通过源节点选取路径中节点剩余能量最大的节点,以此作为路由的方法来最大限度保护低能量节点。NS2仿真结果表明,W-AODVjr算法能有效保证数据包发送的成功率,与AODVjr算法相比,网络能量利用率提升8%,生命周期延长约为12%,在Zigbee网络中W-AODVjr算法更具优越性。
关键词:
W-AODVjr算法,
网络能量利用率,
路径宽度,
指数查找,
最小剩余能量,
NS2仿真
Abstract: Aiming at the problem that blindness at route discovery period in AODVjr algorithm, which leads to the utilization of network energy is low, W-AODVjr is proposed, which is based on route width. It is formed between the source node and the destination node of a cyclic route area, and recognized through the index to find the optimal path width. In terms of a balanced energy consumption, the algorithm minimum residual energy maximum for route through the source node selected path to protect energy with maximize node. The result of NS2 simulation reveals that the W-AODVjr algorithm can effectively guarantee packet transmission success rate and the utilization of network energy increase by 8% and extend the life cycle by approximately 12% compared with AODVjr algorithm. The superiority of the Zigbee network proves the W-AODVjr algorithm is better than the original algorithm.
Key words:
W-AODVjr algorithm,
network energy utilization rate,
route width,
index search,
minimum residual energy,
Network Simulator version 2(NS2) simulation
中图分类号: