Ad hoc网络中基于时延最小自适应流量分配算法  

An Algorithm of Adaptive Traffic Distribution Based on Minimization of Delay in Ad hoc Networks

作　　者：冯美玉[1] 程胜[1] 张勖[1] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网络实验室,北京100876

出　　处：《电子与信息学报》2006年第2期277-280,共4页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60372101)资助课题

摘　　要：由于Ad hoc网络带宽有限,多径传输能提高有效带宽能力,满足有一定带宽要求的QoS服务需求。该文从理论上论证了合理分配流量实现时延最小的可行性,并提出了基于时延最小自适应流量分配算法(ATDBMD),目的是科学利用多条路径,满足QoS业务对时延的要求。仿真分析证明,ATDBMD算法能降低平均时延和时延抖动, 并具有简单、快速自适应性和准确性等优点,明显优于其它算法。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.

关 键 词：AD HOC 时延 自适应 流量分配 权重 

分 类 号：TN915.04[电子电信—通信与信息系统]