基于全分布式分组无线网络的蚂蚁路由算法  

Ant Routing Algorithm Based on Packet Radio Network

作　　者：李景[1] 俞忠原[1] 

机构地区：[1]同济大学信息与通信工程系,上海200331

出　　处：《计算机仿真》2005年第7期79-81,共3页Computer Simulation

摘　　要：该文介绍了全分布式分组无线网络中路由算法。当前广泛运用的OSPF路由算法在网络的链路发生阻塞时,不能及时探测到链路状况。当链路发生拥塞时,在发包率继续增大的时候,只能简单地丢弃数据包。就此该文在分布式的无线网络中应用了蚂蚁算法。该算法由发送探测包来担任“觅食蚂蚁”在短时间内找出最优路径,分散流量,避免网络的拥塞。通过仿真结果表明:该算法在网络利用率和数据包传送时延上有较好的改善。In this paper, we introduce the routing algorithm used by distributed Packet Radio Network. Open Shortest Path First （OSPF） ,the commonly used routing algorithms, cant detect the state of link in time. When congestion occurs, packets are dropped without regard to available bandwidth resources on other links. This paper presents an ant algorithm applied in Packet Radio Network. The algorithm sends the test packets as the food finding ant.The method can find the optimal link, release the heavy traffic to an alternate route to avoid congestion quickly. Simulation results show that the algorithm is superior to OSPF in terms of packet delay and the network utilization.

关 键 词：蚂蚁算法 分组无线网络 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]