AODV routing overhead analysis based on link failure probability in MANET  

作　　者：ZHANG Qin-juan,WU Mu-qing,ZHEN Yan,SHANG Cui-li School of Telecommunication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China 

出　　处：《The Journal of China Universities of Posts and Telecommunications》2010年第5期109-115,共7页中国邮电高校学报（英文版）

基　　金：supported by the Hi-Tech Research and Development Program of China (2008AA01A322);the National Natural Science Foundation of China (60772109)

摘　　要：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.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 

分 类 号：TN929.5[电子电信—通信与信息系统]