基于空域覆盖空洞与时域状态滞后感知的配电网异构组网技术

方晓明; 李仕彦; 陈小倩; 陈心怡; 黄诚; 王睿秋雨

方晓明,李仕彦,陈小倩,陈心怡,黄诚,王睿秋雨.基于空域覆盖空洞与时域状态滞后感知的配电网异构组网技术[J].电测与仪表,2026,63(9):107-118.
Fang Xiaoming,Li Shiyan,Chen Xiaoqian,Chen Xinyi,Huang Cheng,Wang Ruiqiuyu.A distribution network heterogeneous networking technology based on spatial-domain coverage void and temporal-domain state delay[J].Electrical Measurement & Instrumentation,2026,63(9):107-118.

基于空域覆盖空洞与时域状态滞后感知的配电网异构组网技术

A distribution network heterogeneous networking technology based on spatial-domain coverage void and temporal-domain state delay

DOI：10.19753/j.issn1001-1390.2026.09.011

中文关键词: 配电网海量分布式资源异构组网空域覆盖空洞时域状态滞后

英文关键词:distribution network, massive distributed resources, heterogeneous networking, spatial-domain coverage void, temporal-domain state delay

基金项目:国网福建省电力有限公司科技项目资助，透明化有源配电网通感算协同关键技术研究

作者中文名	作者英文名	单位
方晓明	Fang Xiaoming	国网福建省电力有限公司信息通信分公司
李仕彦	Li Shiyan	国网福建省电力有限公司信息通信分公司
陈小倩	Chen Xiaoqian	国网福建省电力有限公司信息通信分公司
陈心怡	Chen Xinyi	国网福建省电力有限公司信息通信分公司
黄诚	Huang Cheng	国网福建省电力有限公司福州市长乐区供电公司
王睿秋雨	Wang Ruiqiuyu	华北电力大学

摘要点击次数: 62

中文摘要:

异构组网是解决配电网复杂网络环境下通信补盲以及通信孤岛的关键技术。然而，传统异构组网优化方法面临未来空域难以全面覆盖、通信资源竞争以及优化收敛速度慢的问题。基于此，文章构建面向最小化空域覆盖空洞与时域状态落后的配电网异构组网架构，构建以最小化网络空域覆盖空洞率与端到端排队时延的中继终端调度与时间分片联合优化问题，提出一种面向最小化空域覆盖空洞与时域状态滞后的中继调度和时间分片联合优化算法。所提算法在第一阶段基于空域覆盖空洞感知匹配优化中继终端调度策略，通过在匹配偏好构建中引入覆盖空洞感知值，预防未来空域覆盖空洞的形成。同时，通过比较冲突终端的偏好值解决资源竞争问题。在第二阶段，所提算法基于改进蚁群算法优化时间分片策略，通过在蚁群信息素更新中引入时域状态滞后感知，加快优化收敛速度。仿真结果表明，所提算法在时域状态滞后和覆盖空洞率方面具有良好性能。

英文摘要:

Local heterogeneous networking is a key technology for addressing communication blind spots and communication island in complex network environments of distribution network. However, traditional heterogeneous networking optimization methods face challenges of the difficulty of incomplete spatial-domain coverage, competition for communication resources, and slow optimization convergence speeds. Therefore, this paper constructs a distribution network heterogeneous networking architecture for spatial-domain coverage void and temporal-domain state delay minimization. A joint optimization problem for relay scheduling and time scheduling is formulated to minimize the average number of spatial-domain coverage voids and end-to-end queuing delay. A joint optimization algorithm of relay scheduling and time scheduling for spatial-domain coverage void and temporal-domain state delay minimization is proposed. In the first phase, the proposed algorithm optimizes the relay scheduling strategy based on spatial-domain coverage void-aware matching, preventing the formation of future spatial-domain coverage void by introducing a coverage void awareness value in the construction of matching preferences. At the same time, it resolves resource competition issues by comparing the preference values of conflicting devices. In the second phase, the algorithm optimizes the time scheduling strategy based on an improved ant colony algorithm, accelerating the optimization convergence speed by introducing temporal-domain state delay awareness in the pheromone update. Simulation results show that the proposed algorithm has excellent performances in terms of temporal-domain state delay and coverage void rate.

查看全文查看/发表评论下载PDF阅读器

关闭