论文部分内容阅读
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 the 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.