從分析Ad hoc網(wǎng)絡(luò)的信息流競(jìng)爭(zhēng)特點(diǎn)出發(fā)，引入了鏈路干擾集的概念，構(gòu)建了一個(gè)基于鏈路干擾集的價(jià)格框架。在此框架中，某鏈路的擁塞信息被表示為此鏈路干擾集的總價(jià)格。并提出了相應(yīng)的分布式平行算法－價(jià)格協(xié)同法PCA來(lái)求解在小時(shí)間段內(nèi)網(wǎng)絡(luò)狀態(tài)不變的擁塞控制問(wèn)題。同時(shí)，分析了PCA對(duì)網(wǎng)絡(luò)狀態(tài)變化的自適應(yīng)性能。仿真結(jié)果表明，PCA能快速收斂到全局優(yōu)化解，對(duì)網(wǎng)絡(luò)狀態(tài)的變化有較好的自適應(yīng)能力，所獲得的網(wǎng)絡(luò)性能比TCP-Reno要優(yōu)越得多。

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.