中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (5): 109-115.doi: 10.1016/S1005-8885(09)60515-X

• Networks • 上一篇    下一篇

AODV routing overhead analysis based on link failure probability in MANET

张钦娟,尚翠丽,武穆清,甄岩   

  1. 北京邮电大学
  • 收稿日期:2010-03-05 修回日期:2010-05-17 出版日期:2010-10-30 发布日期:2010-10-31
  • 通讯作者: 张钦娟 E-mail:zhangqinjuan@gmail.com
  • 基金资助:

    国家级.国家自然科学基金;国家级.国家“863计划”项目

AODV routing overhead analysis based on link failure probability in MANET

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2010-03-05 Revised:2010-05-17 Online:2010-10-30 Published:2010-10-31

摘要:

This article puts forward an Ad-hoc on-demand distance vector routing (AODV) routing overhead analysis method in mobile Ad-hoc network (MANET). Although multiple routing protocols have been proposed to improve the performance, scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way. Routing overhead consumes part of network resources and limits the supported traffic in the network. For on-demand routing protocols like AODV, the routing overhead depends on the link failure probability to a great extent. This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability. In chain and rectangle scenarios, it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability. Simulations on OPNET 14.5 platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.

关键词:

MANET, saturate throughput, AODV, routing overhead

Abstract:

This article puts forward an Ad-hoc on-demand distance vector routing (AODV) routing overhead analysis method in mobile Ad-hoc network (MANET). Although multiple routing protocols have been proposed to improve the performance, scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way. Routing overhead consumes part of network resources and limits the supported traffic in the network. For on-demand routing protocols like AODV, the routing overhead depends on the link failure probability to a great extent. This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability. In chain and rectangle scenarios, it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability. Simulations on OPNET 14.5 platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.

Key words:

MANET, saturate throughput, AODV, routing overhead