Identifying multiple optimal paths in Antnet Routing Algorithm with negligible Overhead

In AODV, routes are discovered in an on-demand basis and are maintained as long as they are required. Like DSDV it maintains a sequence number, which it increases each time it finds a change in the topology of its neighborhood. This sequence number e

NS2 用于DSR路由仿真的awk文件，统计了传输层时延、路由层收敛时间、通过量、路由开销和接收成功概率-NS2 awk file for DSR routing simulation, statistical delay the transport layer, routing layer convergence time, throughput, routing overhead and receive the probability of success