摘要
介绍了蚁群算法的原理,然后对现有蚁群算法进行了一些改进,使它能够快速地收敛以满足高速变化的卫星网络拓扑结构.采用改进的虚拟拓扑策略解决了卫星网络拓扑高速变换的问题,将改进的蚁群算法应用于其上,并给出了相应的性能评估.所提出的改进的虚拟拓扑策略,能够大大减少一个系统周期内卫星网的时间片个数.应用于此基础上的改进的蚁群算法也体现了较好的性能.
This paper first introduces the principle of the ant colony algorithm. Then some modifications on the existing ant colony algorithm are done to satisfy the rapidly-changed network topology in space satellite networks. Finally, the problem of the rapidly-changed network topology of the satellite network is solved by the improved virtual topology strategy, and some application of the improved ant colony algorithm in routing computation of satellite networks are illustrated, and the corresponding performance evaluation are given. The improved virtual topology strategy proposed can greatly reduce the number of the time slot in a system cycle. The improved ant colony algorithm based on this presents good performance as well.
出处
《海军工程大学学报》
CAS
北大核心
2005年第6期26-31,共6页
Journal of Naval University of Engineering
基金
国家自然科学基金重点项目(60135010)
国家自然科学基金资助项目(60321002)
国家计划863资助项目(2003AA712022)
国家973计划资助项目(2004CB318108)
关键词
蚁群算法
路由计算
卫星网络
ant colony algorithm
routing computation
satellite network
