A Modified Simulated Annealing Algorithm Based On Principle Of The Greedy Algorithm For Networks With Mobile Nodes

A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of the QoS parameter by deleting / adding nodes in it. To determine the effectiveness of the modified algorithm when creating a data transmission route between the nodes of the network used the concept of relative failure rate of the route. It is shown that the proposed algorithm provides more successful routing at network scalability than the greedy routing algorithm.