ZD-AOMDV: A New Routing Algorithm for Mobile Ad-Hoc Networks
ZD-AOMDV: A New Routing Algorithm for Mobile Ad-Hoc Networks
复制标题
ZD-AOMDV：一种新的移动自组织网络路由算法
DOI：
10.1109/icis.2009.178
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Dehghan
中科院分区：
文献类型：
--
作者：
Nastooh Taheri Javan;Reza Kiaeifar;Bahram Hakhamaneshi;M. Dehghan
在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.