Reliable Ant Colony Routing Algorithm for Dual‐Channel Mobile Ad Hoc Networks

Abstract

For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR), is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

An ACO-based cross-layer routing algorithm in space-air-ground integrated networks

“…The Ant Colony Optimization (ACO) algorithm, a parallel computing SI algorithm, has significant advantages to solve the distributed dynamic combinatorial optimization problem, which could be applied to routing algorithms in SAGINs. Nowadays, many scholars have applied ACObased algorithms to wireless destributed network routing algorithms [11][12][13][14]. G. Di Caro [15] applied the ACO algorithm to wireless ad hoc networks, and proposed an adaptive nature-inspired routing algorithm (so-called AntHocNet) using a measured pheromone value to indicate the path quality.…”