Ad hoc网络路由修复策略优化

Optimal Route Recovery for Ad hoc Networks

针对Ad hoc网络中基于缓存的路由修复机制进行研究.通过对基于缓存的路由修复机制进行数学建模和理论分析,得出了基于缓存的路由修复机制的最优缓存策略应具有如下三个性质:1)优先缓存寿命长的可用路径;2)优先探测寿命长的可用路径;3)对于每次路由发现的可用路径集合.基于这些关键性质,本文设计一个最优缓存算法,并通过ns-2仿真验证了本文设计的最优化缓存策略和最优缓存算法的正确性和有效性.

This paper investigates the issue of cache-based route repair policy in ad hoc networks.Through modeling of the cache-based route repair process and theoretical analysis,we derive three key characters that should be hold by optimal route cache policy：1） Available path with longer life must be cached first;2） Available path with longer life must be probed first;3） For path set found by each route discovery,there exists an optimal buffer threshold.Based on these key characters,an optimal cache algorithm is designed.Finally,we evaluate the correctness and advantages of our optimal policy and algorithm using ns-2 simulation.