一种用于Ad hoc网络的优化拥塞控制算法

从分析Ad hoc网络的信息流竞争特点出发，引入了链路干扰集的概念，构建了一个基于链路干扰集的价格框架。在此框架中，某链路的拥塞信息被表示为此链路干扰集的总价格。并提出了相应的分布式平行算法－价格协同法PCA来求解在小时间段内网络状态不变的拥塞控制问题。同时，分析了PCA对网络状态变化的自适应性能。仿真结果表明，PCA能快速收敛到全局优化解，对网络状态的变化有较好的自适应能力，所获得的网络性能比TCP-Reno要优越得多。

Based on the characteristics of the contention relationship between flows in Ad hoc networks, the notion of the link’s interference set is introduced in this paper, and then a price framework based on the link’s interference set is built. In such a price framework, the aggregated price over the link interference set is interpreted as the congestion information about this link. Correspondingly, a distributed algorithm, Price Coordination Approach (PCA), is presented to solve the congestion control problem for small time interval; and adaptation of PCA for the uncertain changes of network scenarios is analyzed. Simulation results show that PCA can quickly converge to globally optimal solutions. Compared with the Additional Increase Multiplicative Decrease (AIMD) algorithm in TCP-Reno, PCA is more adaptive to time-varying network situations and achieves better network performance.