CAJ | 학술논문

Ad hoc(自组织)网络中包含延迟、延迟抖动、带宽和丢包率等约束条件在内的 QoS(服务质量)路由问题,是一个 NP 完全问题,传统的平面 QoS蚂蚁路由算法难以解决提高算法全局搜索能力和加快收敛速度之间的矛盾。针对以上问题,提出了HQAC(分级 QoS蚁群)算法,在分级的基础上对蚁群算法的路由搜寻过程进行了改进,同时对信息素更新公式进行了优化。仿真结果表明,与传统的 QoS路由算法相比,HQAC算法在搜索全局最优解,尤其是收敛速度等性能上有了很大的提高。
Ad hoc(자조직)망락중포함연지、연지두동、대관화주포솔등약속조건재내적 QoS(복무질량)로유문제,시일개 NP 완전문제,전통적평면 QoS마의로유산법난이해결제고산법전국수색능력화가쾌수렴속도지간적모순。침대이상문제,제출료HQAC(분급 QoS의군)산법,재분급적기출상대의군산법적로유수심과정진행료개진,동시대신식소경신공식진행료우화。방진결과표명,여전통적 QoS로유산법상비,HQAC산법재수색전국최우해,우기시수렴속도등성능상유료흔대적제고。
QoS routing problem in Ad hoc networks including such constraints as delay,delay jitter,bandwidth and packet loss is an NP-complete problem.It is difficult for the traditional plane QoS ant routing algorithm to solve the contradiction between improving the global search ability of the algorithm and speeding up the convergence rate.In relation to the above problem, this paper presents a Hierarchical QoS Ant Colony (HQAC)algorithm.On the basis of the hierarchical structure,it improves the routing search process of the algorithm and optimizes the pheromone update formula.Simulation results show that com-pared with the traditional QoS routing algorithms,this algorithm is remarkably improved in searching the global optimal solu-tion,especially in convergence rate and other performances.