Dynamic Adjustment A* Routing Algorithm

Abstract

Routing algorithm mainly focuses on routing method to ensure the connection between the sender and the receiver during each session is optimal and effective. It is very useful in packet transmission, especially in meeting the quality of service. Some traditional shortest path search algorithm (Width preferred search algorithm, Dijkstra algorithm) can solve the shortest path problem well within polynomial time when the wireless and cable network have infrastructure. But in the realtime communication environment, high dynamic topology of network structure and the QoS under network structure, we usually need to find out a group of the shortest or the second shortest path as the basis of scheme evaluation and selection. Usually, the heuristic search algorithm can solve the problem well, the heuristic function of the heuristic search algorithm equals sum of the actual passed path cost and the estimated cost of current node to target node. According to the feature of heuristic function, this paper dynamically adjusts the proportion in the searching process, and uses it in the search of the shortest path of network node. The result of this experiment shows that the efficiency of the improved algorithm is about 12.5% higher than that of the original algorithm.