国网山东省电力公司临沂供电公司
纸质出版:2026
移动端阅览
刘冬, 陈传琦, 夏新志, 等. 智能电网变电站超低时延通信路径择优方案研究[J]. 电测与仪表, 2026,63(10).
Liu Dong, Chen Chuanqi, Xia Xinzhi, et al. Research on optimal scheme for ultra-low latency communication path in smart grid substation[J]. 2026, 63(10).
智能电网变电站规模的不断扩大,使得通信网络拓扑结构日趋复杂,节点与链路数量呈指数级增长,且相互关联性显著增强。链路状态受设备故障、环境干扰、负载波动等多种因素影响,呈现出高度动态变化特征。传统静态路径选择方法仅依靠简单的规则判断进行路径挑选,缺乏对网络全局状态的精确感知,且难以实时适应链路状态的动态变化,导致无法高效、精准地找到最优通信路径,严重制约了智能电网的可靠运行。针对上述问题,提出一种基于改进蚁群算法的超低时延通信路径择优方案。通过深入分析变电站通信网络特性,建立数据业务传输延时与链路运行状态的约束条件,明确以超低时延为优化目标。基于图论理论,构建变电站超低时延通信路径模型,采用邻接矩阵和权重矩阵对复杂网络拓扑进行精确数学描述,为后续路径优化奠定基础。引入动态伪随机转移规则,克服传统固定规则的局限性,增强算法对数据业务传输不确定性的适应能力。同时,设计双层信息素更新机制:局部信息素更新采用动态衰减因子,实时反映链路状态变化;全局信息素更新引入精英策略,加速优质路径的收敛速度。通过多轮迭代搜索,不断优化路径选择策略,最终获得超低时延通信路径。实验结果表明,与传统方法相比,该方案的通信数据传输路径最短,响应的通信时延也最小,吞吐量始终保持在65 MB以上,显著提升网络吞吐量,且在通信节点为130个时,其网络连通度保持在0.55以上,有效减少不必要的带宽占用。
The continuous expansion of smart grid substations has led to increasingly complex communication network topologies
with the number of nodes and links growing exponentially and their interconnections significantly strengthened. The state of links is influenced by various factors such as equipment failures
environmental interference
and load fluctuations
exhibiting highly dynamic characteristics. Traditional static path selection methods rely solely on simple rule-based judgments for path selection
lacking precise awareness of the global network state and struggling to adapt in real-time to the dynamic changes in link states. This results in an inability to efficiently and accurately identify the optimal communication path
severely constraining the reliable operation of the smart grid. To address these issues
this paper proposes an ultra-low latency communication path optimization scheme based on an improved ant colony algorithm. By thoroughly analyzing the characteristics of substation communication networks
constraints on data transmission delay and link operational states are established
with ultra-low latency as the optimization objective. Based on graph theory
a substation ultra-low latency communication path model is constructed
using adjacency matrices and weight matrices to provide an accurate mathematical description of the complex network topology
laying the foundation for subsequent path optimization. A dynamic pseudo-random transfer rule is introduced to overcome the limitations of traditional fixed rules
enhancing adaptability of the algorithm to the uncertainty of data transmission. Additionally
a dual-layer pheromone update mechanism is designed: local pheromone updates employ a dynamic decay factor to reflect real-time changes in link states
while global pheromone updates incorporate an elite strategy to accelerate the convergence speed of high-quality paths. Through multiple rounds of iterative searches
the path selection strategy is continuously optimized
ultimately yielding an ultra-low latency communication path. Experimental results show that
compared to traditional methods
the proposed scheme achieves the shortest communication data transmission path and the smallest corresponding communication delay
with throughput consistently maintained above 65 MB
significantly enhancing network throughput. Furthermore
when the number of communication nodes is 130
the network connectivity remains above 0.55
effectively reducing unnecessary bandwidth usage.
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621