Ad Hoc网络中基于模拟退火-蚁群算法的QoS路由发现方法

针对Ad Hoc网络的动态网络环境和链路、节点性能限制等不利因素，提出了一种新的QoS路由发现方法——SAANT．该方法利用蚁群算法增加了发现可用QoS路由的概率，利用基于概率的路由转发策略来减少洪泛造成的网络开销，从而强化所提算法的全局搜索能力和自适应性，减小了洪泛对Ad Hoc网络性能的影响．所提方法还利用模拟退火算法调整路由发现算法的搜索方向，以弥补蚂蚁算法收敛速度上的弱点，减少了搜索过程中的停滞现象．在包投递成功率、平均包延迟和吞吐量等方面，通过仿真实验对SAANT、仅基于蚁群算法的QoS路由算法和传统的按需路由算法的方法进行了性能比较，结果表明，在Ad Hoc网络环境下，SAANT的收敛速度、移动性能和网络负载性能均表现出更好的适应性．

QoS Route Discovery Method Based on Simulated Annealing and Ant Colony Algorithm for Ad Hoc Networks

Focusing on the disadvantageous factors of dynamic environment and node's limited performances of Ad Hoc networks(MANETs), a new QoS(quality of service) route discovery method,namely SAANT,based on simulated annealing algorithm(SA) and ant colony algorithm was presented.The method utilized the powerful global search ability and the adaptability of ant colony algorithm to increase the search probability of QoS feasible paths,and the route switching policy based on probability was used to reduce network overhead caused by flooding.SA was used by the proposed method to remedy the weakness of ant colony algorithm and increase the convergence rate of route discovery algorithm so as to avoid the problem of stagnancy routes.The simulations were carried out to compare the SAANT,the algorithm based on ant colony only and the traditional on-demand routing algorithm each other.The results show that the network performances,such as convergence rate,mobility and throughput,are improved obviously.Therefore,the method proposed is efficient and effective.