ZD-AOMDV：一种新的移动自组网路由算法

中文摘要 AI 辅助

移动自组网中所有流行的多路径路由算法（如AOMDV）的一个共同特点是，通过利用并行路径来减少端到端延迟。在这些并行路径中，相邻节点为获取公共信道而产生的竞争是端到端延迟增加的原因。实际上，由于无线网络中的介质访问机制（如CSMA/CA），即使通过两条节点不相交的路径进行数据传输也不是完全独立的，每条路径都会影响另一条路径。在本文中，我们修改了AODV协议，使其在可行范围内选择区域不相交的路径，从而实现了更低的端到端延迟。所提出的协议在不同场景下进行了效率评估，与AOMDV相比，在分组投递率和端到端延迟减少方面都有显著改善。

英文摘要

A common characteristic of all popular multi-path routing algorithms in mobile ad-hoc networks, such as AOMDV, is that the end to end delay is reduced by utilization of parallel paths. The competition between the neighboring nodes for obtaining a common channel in those parallel paths is the reason for end to end delay increment. In fact, due to medium access mechanism in wireless networks, such as CSMA/CA, data transmissions even through two node-disjoint paths are not completely independent and each path will affect the other one. In this paper we have modified the AODV protocol which results in selection of zone-disjoint paths, to the extent feasible, and as a result we achieve less end to end delay. The efficiency of the proposed protocol has been evaluated on different scenarios and there has been a noticeable improvement in the packet delivery ratio and also in the reduction of end-to-end delay comparing to AOMDV.

发表机构

• Azad University Amirkabir University of Technology Branch of Andimeshk（阿扎德大学阿米卡比尔理工大学安迪梅什克分校）
• Amirkabir University of Technology（阿米卡比尔理工大学）
• California State University（加州州立大学）

机构由 AI 辅助整理，请以论文原文为准。