计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2014年
1期
117-120,143
,共5页
W-AODVjr算法%网络能量利用率%路径宽度%指数查找%最小剩余能量%NS2仿真
W-AODVjr算法%網絡能量利用率%路徑寬度%指數查找%最小剩餘能量%NS2倣真
W-AODVjr산법%망락능량이용솔%로경관도%지수사조%최소잉여능량%NS2방진
W-AODVjr algorithm%network energy utilization rate%route width%index search%minimum residual energy%Network Simulator version 2(NS2) simulation
针对AODVjr算法在路由查找过程中的盲目性导致网络能量利用率不高的问题，提出一种基于路径宽度的W-AODVjr算法。该算法通过在源节点与目的节点之间形成一个环状封闭路由查找区域，并采用指数查找的方式确认最优路径宽度。通过源节点选取路径中节点剩余能量最大的节点，以此作为路由的方法来最大限度保护低能量节点。NS2仿真结果表明，W-AODVjr 算法能有效保证数据包发送的成功率，与 AODVjr 算法陒比，网络能量利用率提升8%，生命周期延长约为12%，在 Zigbee 网络中W-AODVjr算法更具优越性。
針對AODVjr算法在路由查找過程中的盲目性導緻網絡能量利用率不高的問題，提齣一種基于路徑寬度的W-AODVjr算法。該算法通過在源節點與目的節點之間形成一箇環狀封閉路由查找區域，併採用指數查找的方式確認最優路徑寬度。通過源節點選取路徑中節點剩餘能量最大的節點，以此作為路由的方法來最大限度保護低能量節點。NS2倣真結果錶明，W-AODVjr 算法能有效保證數據包髮送的成功率，與 AODVjr 算法陒比，網絡能量利用率提升8%，生命週期延長約為12%，在 Zigbee 網絡中W-AODVjr算法更具優越性。
침대AODVjr산법재로유사조과정중적맹목성도치망락능량이용솔불고적문제，제출일충기우로경관도적W-AODVjr산법。해산법통과재원절점여목적절점지간형성일개배상봉폐로유사조구역，병채용지수사조적방식학인최우로경관도。통과원절점선취로경중절점잉여능량최대적절점，이차작위로유적방법래최대한도보호저능량절점。NS2방진결과표명，W-AODVjr 산법능유효보증수거포발송적성공솔，여 AODVjr 산법희비，망락능량이용솔제승8%，생명주기연장약위12%，재 Zigbee 망락중W-AODVjr산법경구우월성。
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.
