A Method Based on Infomap Algorithm for Edge Division of Distribution Network

doi:10.12204/j.issn.1000-7229.2021.07.008

Abstract

Abstract:

In the era of energy internet, distribution networks face the demand for the storage and computing of massive distributed data. Edge computing can reduce the computing and storage pressure of master stations by utilizing terminal resources of distribution networks to provide nearby analysis and computing. In order to give full play to the advantages of edge computing and improve the level of refined operation and management of distribution networks, this paper proposes a method for edge division of distribution network, which is based on Infomap algorithm. Firstly, considering the scale of edges and the demand for autonomy, the definition of edge range and principles of edge division in distribution networks are clearly given. Then, theN-1 security check model of a distribution network, which is based on the path description, is proposed, where the switching times of tie-switches measure the tightness of connection between edges. Finally, on the basis of community detection of complex networks, a distribution network is abstracted into a graph model, and divided into edges by Infomap algorithm, which takes characteristics of operation and management of distribution networks into consideration. The validity and rationality of this edge division method are verified in an actual distribution network.

Key words: distribution network, edge division, N-1 security check, Infomap algorithm

CLC Number:

TM732

JIAO Hao, CHEN Jinming, LIU Wei, WANG Hailin, DONG Shufeng, GUO Yajuan. A Method Based on Infomap Algorithm for Edge Division of Distribution Network[J]. ELECTRIC POWER CONSTRUCTION, 2021, 42(7): 65-72.

Figures/Tables 10

Fig.1 Diagram of distribution network edges

Table 1 Interaction data between edges and master stations of distribution networks

Fig.2 Graph abstraction of distribution network

Fig.3 Flow chart of the method for edge division of the distribution network

Fig.4 Topology of a city distribution network

Table 2 Number of actions of loop switches for N-1 security check in spring and autumn

Fig.5 Undirected graph model after abstraction of the distribution network

Table 3 Results of edge division in different seasons

Table 4 Flow volume within and across the edges in different seasons

Table 5 Number of actions of loop switches inside or outside for N-1 security check in edge 1 in spring and autumn

References 21

[1]	田世明, 栾文鹏, 张东霞, 等. 能源互联网技术形态与关键技术[J]. 中国电机工程学报, 2015, 35(14):3482-3494.
	TIAN Shiming, LUAN Wenpeng, ZHANG Dongxia, et al. Technical forms and key technologies on energy internet[J]. Proceedings of the CSEE, 2015, 35(14):3482-3494.
[2]	王成山, 王瑞, 于浩, 等. 配电网形态演变下的协调规划问题与挑战[J]. 中国电机工程学报, 2020, 40(8):2385-2396.
	WANG Chengshan, WANG Rui, YU Hao, et al. Challenges on coordinated planning of smart distribution networks driven by source-network-load evolution[J]. Proceedings of the CSEE, 2020, 40(8):2385-2396.
[3]	丛伟, 盛亚如, 咸国富, 等. 基于智能配电终端的分布式供电恢复方法[J]. 电力系统自动化, 2018, 42(15):77-85.
	CONG Wei, SHENG Yaru, XIAN Guofu, et al. Distributed power service restoration method based on smart terminal unit[J]. Automation of Electric Power Systems, 2018, 42(15):77-85.
[4]	程杉, 王贤宁, 冯毅煁. 电动汽车充电站有序充电调度的分散式优化[J]. 电力系统自动化, 2018, 42(1):39-46.
	CHENG Shan, WANG Xianning, FENG Yichen. Decentralized optimization of ordered charging scheduling in electric vehicle charging station[J]. Automation of Electric Power Systems, 2018, 42(1):39-46.
[5]	司羽飞, 谭阳红, 汪沨, 等. 面向电力物联网的云边协同结构模型[J]. 中国电机工程学报, 2020, 40(24):7973-7979.
	SI Yufei, TAN Yanghong, WANG Feng, et al. Cloud-edge collaborative structure model for power Internet of Things[J]. Proceedings of the CSEE, 2020, 40(24):7973-7979.
[6]	施巍松, 张星洲, 王一帆, 等. 边缘计算:现状与展望[J]. 计算机研究与发展, 2019, 56(1):69-89.
	SHI Weisong, ZHANG Xingzhou, WANG Yifan, et al. Edge computing: State-of-the-art and future directions[J]. Journal of Computer Research and Development, 2019, 56(1):69-89.
[7]	SATYANARAYANAN M. The emergence of edge computing[J]. Computer, 2017, 50(1):30-39.
[8]	王海林, 焦昊, 陈锦铭, 等. 基于稳定连接的配电网边缘划分方法及应用研究[J]. 电力信息与通信技术, 2020, 18(1):26-32.
	WANG Hailin, JIAO Hao, CHEN Jinming, et al. Research and application of the method of edge division of distribution network based on stable connection[J]. Electric Power Information and Communication Technology, 2020, 18(1):26-32.
[9]	龚钢军, 罗安琴, 陈志敏, 等. 基于边缘计算的主动配电网信息物理系统[J]. 电网技术, 2018, 42(10):3128-3135.
	GONG Gangjun, LUO Anqin, CHEN Zhimin, et al. Cyber physical system of active distribution network based on edge computing[J]. Power System Technology, 2018, 42(10):3128-3135.
[10]	吕军, 栾文鹏, 刘日亮, 等. 基于全面感知和软件定义的配电物联网体系架构[J]. 电网技术, 2018, 42(10):3108-3115.
	LÜ Jun, LUAN Wenpeng, LIU Riliang, et al. Architecture of distribution internet of things based on widespread sensing & software defined technology[J]. Power System Technology, 2018, 42(10):3108-3115.
[11]	国网江苏省电力有限公司发展策划部. 江苏配电网网格化单元制规划工作手册[R]. 南京:国网江苏省电力有限公司, 2018.
[12]	吴桂峰, 朱菲菲, 王轩. 配电网小电流接地故障分析[J]. 电气技术, 2013(1):70-74.
	WU Guifeng, ZHU Feifei, WANG Xuan. Analysis of single phase grounded faults about distribution grid[J]. Electrical Engineering, 2013(1):70-74.
[13]	电力技术协作平台. 面向两网融合的智能配用电计算架构白皮书[R/OL]. [2019-11-25]. https://www.eptc.org.cn/news/i/8aae205b6e639759016ea12508c702b0
[14]	孙明, 董树锋, 夏圣峰, 等. 基于路径描述的馈线分区N-1可装容量计算方法[J]. 电力系统自动化, 2017, 41(16):123-129.
	SUN Ming, DONG Shufeng, XIA Shengfeng, et al. Path description based calculation method for available capacity of feeder partition satisfied with N-1 security criterion [J]. Automation of Electric Power Systems, 2017, 41(16):123-129.
[15]	朱嘉麒, 董树锋, 徐成司, 等. 考虑多次转供的配电网最大供电能力评估方法[J]. 电网技术, 2019, 43(7):2275-2282.
	ZHU Jiaqi, DONG Shufeng, XU Chengsi, et al. Evaluation model of total supply capability of distribution network considering multiple transfers[J]. Power System Technology, 2019, 43(7):2275-2282.
[16]	徐成司, 董树锋, 孙洲, 等. 基于网络简化和深度优先遍历的配电网路径搜索算法[J]. 电力系统自动化, 2017, 41(24):170-176.
	XU Chengsi, DONG Shufeng, SUN Zhou, et al. A path searching algorithm for distribution network based on network simplification and depth first traversal[J]. Automation of Electric Power Systems, 2017, 41(24):170-176.
[17]	赖大荣. 复杂网络社团结构分析方法研究[D]. 上海: 上海交通大学, 2011.
	LAI Darong. Studies on methods for analyzing community structure in complex networks[D]. Shanghai: Shanghai Jiaotong University, 2011.
[18]	殷剑宏, 吴开亚. 图论及其算法[M]. 合肥: 中国科学技术大学出版社, 2003.
[19]	ROSVALL M, BERGSTROM C T. Maps of random walks on complex networks reveal community structure[J]. PNAS, 2008, 105(4):1118-1123. doi: 10.1073/pnas.0706851105 URL
[20]	ROSVALL M, AXELSSON D, BERGSTROM C T. The map equation[J]. The European Physical Journal Special Topics, 2009, 178(1):13-23. doi: 10.1140/epjst/e2010-01179-1 URL
[21]	SHANNON C E. A mathematical theory of communication[J]. Bell System Technical Journal, 1948, 27(3):379-423. doi: 10.1002/bltj.1948.27.issue-3 URL