A Meta-Heuristic Data Routing Algorithm for Networks with Dynamically Variable Structure

The paper is devoted to the study of an ant algorithm for increasing the efficiency of the routing process in networks with dynamically changing structure. This algorithm is successfully used to solve complex optimization problems: the search and determination of the most suitable solution for optimizing the target function from a discrete set of possible solutions. In the paper as a target function is considered the time of data delivery. The modification of an ant algorithm of routing, which prevents the implementation of premature cycles, is presented.