Modified Routing Algorithms For Self-Organized Networks

The algorithms of routing for self-organized networks are considered and it is found that it is advisable to use modified algorithms for these types of networks: ant colony optimization, genetic and simulated annealing. The modification of the ant colony optimization is proposed by using the parameter of the probability of transition between the nodes with the effective rejection of inappropriate routes. The modification of the genetic algorithm and the simulation annealing is based on the consideration of the reaching range of neighboring nodes.