一种自适应蚁群算法改进的短波令牌环协议  

Improved HF Token Ring Protocol Based on Adaptive Ant Colony Optimization

作　　者：刘旭冉 任智[1] 舒俊辅 张关鑫 LIU Xuran;REN Zhi;SHU Junfu;ZHANG Guanxing(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《小型微型计算机系统》2024年第6期1482-1488,共7页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61971080)资助。

摘　　要：在短波令牌环组网过程中,由于节点入环的随机性,形成的令牌传递顺序存在多余的中继,导致令牌控制开销过大,网络时延增加,从而影响到整个网络的性能.为了解决上述问题,本文提出了一种自适应蚁群算法优化的短波令牌环协议.首先,由一轮令牌传递得到网络全部节点的距离矩阵,用来构建初始解空间.其次,通过蚁群算法求解每轮周游的最短路径并对各节点的信息素强度进行更新.最终,经过多次迭代比较后,即可得到最优传输路线.实验表明,优化后的协议重组了相邻节点间前驱后继的关系,省去冗余的令牌转发过程,最大化减少了整个环周期长度,从而节省了令牌绕环的时间.同时在网络平均时延和总控制开销方面明显优于现有协议,验证了该协议的可用性和优越性.In theprocessof HF token ring networking,due to the randomness of nodes entering the ring,there are redundant trunks in the token transmission sequence,as a result,the cost of token control is too high and the network delay increases,which affects the performance of the whole network.In order to solve the above problems,this paper proposes a short-wave token ring protocol optimized by adaptive ant colony algorithm.First,the distance matrix of all nodes in the network is obtained by a round of token passing,which is used to construct the initial solution space.Secondly,the ant colony algorithm is used to solve the shortest path of each round and update the pheromone intensity of each node.Finally,After many iterations,the optimal transmission route can be obtained.Experiments show,the optimized protocol reorganizes the sequential relationship between adjacent nodes,eliminates the redundant token forwarding process,and minimizes the whole cycle length.This saves time for the token to loop around.At the same time,the average time delay and total control cost of the protocol are obviously better than the existing protocol,which verifies the availabilityand superiority of the protocol.

关 键 词：短波令牌环 中继优化 传递顺序 蚁群算法 

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