电力载波通信动态组网算法的研究  

The Research of Algorithm for Dynamic Network of Power Line Carrier Communications

作　　者：林景栋[1] 秦玉龙[1] 廖孝勇[1] 

机构地区：[1]重庆大学自动化学院,重庆400044

出　　处：《控制工程》2013年第5期841-843,848,共4页Control Engineering of China

基　　金：重庆市自然科学基金(CSTC 2009BB3209)资助

摘　　要：电力载波通信网络的不确定性使得其无法用一般的通信组网方法来组建网络,针对这一问题,设计了一种适用于路径寻优的改进遗传算法,该算法能够快速准确的对全局通信网络进行组网。首先通过遗传算法对所有的通信节点和通信路径进行全局搜索;当通信节点出现故障时利用遗传算法全局寻优的特性进行通信网络的组网,在组网过程中引入图的遍历算法思想和Dijkstra算法来克服遗传算法易收敛到局部最优解和处理规模小等缺点;最后根据小生境技术最优保留原则得到最优的组网结果。Matlab仿真实验验证了该算法的收敛性和可行性,该算法提高了组网的快速性和准确性,能够满足电力载波通信动态组网的实时性和正确性要求,具有一定的实用价值。The uncertainty of the Power carrier communication network makes it unable to form a network, using the general communi- cation networking method. To solve this problem, this paper designed a improved genetic algorithm applicable to path optimization. The algorithm can rapidly and accurately build global communication network. Firstly, the genetic algorithm is used to all communications nodes and communication paths for global searching. Then, when the communication node breaks down, the genetic algorithm will uae its global optimization characteristics to build communication network. During the network process, Dijkstra algorithm and the thought of Graph Traversing algorithm are introduced to overcome the shortcomings of the genetic algorithm, such as, easiness to converge to a lo- cal optimal solution and small Processing scale. Finally, according to the most optimized reserved principle of The Niching Technique, the improved genetic algorithm can get the best network results. Matlab simulation experiments verifies the convergence and feasibility of the algorithm. The algorithm improves the efficiency and rapidity of network to meet instantaneous and accuracy requirements of the Power carrier communication dynamic network, and has practical value.

关 键 词：低压电力 遗传算法 通信组网 路径寻优 变异 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]