從分析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.