基于有序树的电力线网络路由算法  

ORDERED TREE-BASED ROUTING ALGORITHM FOR POWER LINE COMMUNICATION NETWORK

作　　者：何华冰 姚婷婷[1] 李云飞[1] 贾俊铖[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《计算机应用与软件》2016年第5期115-119,共5页Computer Applications and Software

基　　金：国家自然科学基金(61272449;61201212)

摘　　要：电力线通信(PLC)依靠现有的分布广泛的电力线路设施进行数据传输不需要额外布线开销,越来越受到人们的关注。但是,目前电力线网络路由效率不高,通信延迟较大。为解决以上问题,根据电力线网络的树型拓扑结构的特点,提出一种树路由算法(PLC-TR)。算法将电力线网络组织成一棵有序树,并通过地址比较进行路由选择,最大限度降低了因路由维护产生的网络开销。通过仿真表明,和传统上性能优异的最短路径算法(SPR)相比,在同等干扰情况下,PLC-TR具有较低的数据包平均传输时延和较高的数据包交付率。Power line communication（ PLC） is getting more and more attentions because it transmits data only relying on existing widespread power line facilities without additional wiring cost. However,current power line network still has the problems of low routing efficiency and high communication delay. To overcome these problems,we propose a tree routing algorithm,short for PLC-TR,according to the characteristics of tree topology of power line network. Specifically,PLC-TR first organises the power line networks into an ordered tree,and then selects the routes by comparing their addresses,this minimises the network overhead caused by routing maintenance. It is shown through simulation that compared with the shortest path routing（ SPR） which is traditionally one of the optimal algorithms,under the same disturbance the PLC-TR has lower average packet transmission delay and higher packet delivery rate.

关 键 词：电力线网络 有序树 PLC-TR 树路由算法 最短路径算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]