Ad hoc網(wǎng)絡(luò)中基于時延最小自適應流量分配算法
An Algorithm of Adaptive Traffic Distribution Based on Minimization of Delay in Ad hoc Networks
-
摘要: 由于Ad hoc網(wǎng)絡(luò)帶寬有限，多徑傳輸能提高有效帶寬能力，滿足有一定帶寬要求的QoS服務(wù)需求。該文從理論上論證了合理分配流量實現(xiàn)時延最小的可行性，并提出了基于時延最小自適應流量分配算法(ATDBMD)，目的是科學利用多條路徑，滿足QoS業(yè)務(wù)對時延的要求。仿真分析證明，ATDBMD算法能降低平均時延和時延抖動，并具有簡單、快速自適應性和準確性等優(yōu)點，明顯優(yōu)于其它算法。
-
關(guān)鍵詞:
- Ad hoc;時延;自適應;流量分配;權(quán)重
Abstract: Because of limited bandwidth capacity in Ad hoc networks, multipath transport is appealing technique to satisfy the requirement of QoS services on bandwidth by improve available bandwidth. In this paper, the feasibility of reasonable distribution for minimization of delay is proved theoretically, and an algorithm of Adaptive Traffic Distribution Based on Minimize Delay(ATDBMD) in Ad hoc networks is proposed, aiming at the minimization of delay and delay jitter, to satisfy another requirement of QoS services on delay. Simulation result shows that ATDBMD wins other algorithm in simpleness, quickly adaptability and precisely control. -
計量
- 文章訪問數(shù): 2241
- HTML全文瀏覽量: 100
- PDF下載量: 758
- 被引次數(shù): 0
下載:
