Power Distribution Network Carrier Communication Route Hybrid Algorithm Based on Ant Colony

In order to further improve the electricity information acquisition system performance, we put forward a kind of Routing Arithmetic Based on Hybrid Algorithm of Ant Colony Algorithm with Genetic and Simulated Annealing. The algorithm takes the hops, latency and packet loss rate factors into the path overhead cost as the optimal target, and the communication distance between the two nodes and the quality of the communication signal as the constraint conditions to solving the value of the minimum cost routing Generation under these conditions. The algorithm also improved the ant transfer rules and ant colony algorithm pheromone update rule. At the same time, in order to avoid the premature phenomenon of ant colony algorithm, we using genetic algorithm for population initialization, and combined with simulated annealing algorithm to solve the problem of genetic algorithm. The MATLAB simulation show that this algorithm has the advantages of low cost, high reliability and fast convergence to the optimal target and can effectively solve the problem of routing stability, for improving the reliability of power line carrier communication has a great significance. Introduction Due to the complex power line structure of distribution network, the power line carrier communication inevitably affected by the influence such as channel frequency selectivity, low impedance, strong noise interference, weak signal and other factors. All of these will cause some terminal node to add or withdraw with without rules, resulting to PLC network logic topology changes. In addition, the quality of the carrier communication signal is influenced by the channel, which seriously restricts the real-time performance and reliability of the carrier communication. Therefore, it is needed to establish a fast and efficient distribution network carrier communication routing based on network topology. In the physical layer, reference [2] has a black box device which has the capability of communication evaluation, but the performance is unstable and easily affected by the presence of the environmental impact; reference [3] selected cluster head based on the lowest ID clustering algorithm, although the algorithm can quickly got a shortest path, but this path information is not reliable, and the path is single, the survivability is poor. This paper starts from the network layer to improve the adaptability and reliability of the network. The paper takes the minimum path overhead as the optimal target, and takes the communication distance between the two nodes and the quality of the communication signal as the constraint conditions, on the basis of this we put forward a kind of routing arithmetic based on a hybrid algorithm of ant colony algorithm, genetic and simulated annealing. The algorithm takes the hops, latency and packet loss rate factors as the path overhead cost, in order to prevent the occurrence of local target optimization and other target is poor, in the ant colony algorithm using distance and signal quality as the heuristic factor, which not only consider the distance constraint but also increases the signal quality constraints; furthermore, we introduced the genetic algorithm to update the pheromone of ant colony continuously, and eliminate the worst path in the iterative process gradually. Considering the robustness of the ant colony algorithm, the genetic algorithm and the simulated annealing algorithm are introduced to initialize the population, which can improve the adaptability of the ant colony algorithm. Therefore, the influence of the network transmission medium on the 4th International Conference on Machinery, Materials and Information Technology Applications (ICMMITA 2016) Copyright © 2017, the Authors. Published by Atlantis Press. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/). Advances in Computer Science Research, volume 71