Network slicing resource allocation algorithm based on bipartite graph matching in smart grids
To solve the problem of simultaneously satisfying the quality of service requirements of multiple types of services in smart grids and considering the economic utility of power terminals and network side, a network slicing resource allocation algorithm based on bipartite graph matching was proposed....
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024055/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540041554264064 |
|---|---|
| author | Weiwei XIA Yifei XIN Dong LIANG Jun WU Xin WANG Feng YAN Lianfeng SHEN |
| author_facet | Weiwei XIA Yifei XIN Dong LIANG Jun WU Xin WANG Feng YAN Lianfeng SHEN |
| author_sort | Weiwei XIA |
| collection | DOAJ |
| description | To solve the problem of simultaneously satisfying the quality of service requirements of multiple types of services in smart grids and considering the economic utility of power terminals and network side, a network slicing resource allocation algorithm based on bipartite graph matching was proposed.For the control and collection services in smart grids, the corresponding bidding information was formulated for the power terminals, and the payment price and utility matrix were calculated accordingly.The resource allocation between the network slices and the power terminals was modeled as a bipartite graph matching problem.Different slicing resources were allocated to the terminals according to the latency, transmission rate, or energy consumption requirements of different services to maximize the system utility.Simulation results show that the proposed algorithm is able to improve the system utility by 10%～20% compared to the existing double auction algorithm and greedy algorithm. |
| format | Article |
| id | doaj-art-55db321fe6b94275b8a6648d6ef42d07 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-55db321fe6b94275b8a6648d6ef42d072025-01-14T06:21:50ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-03-0145172859296349Network slicing resource allocation algorithm based on bipartite graph matching in smart gridsWeiwei XIAYifei XINDong LIANGJun WUXin WANGFeng YANLianfeng SHENTo solve the problem of simultaneously satisfying the quality of service requirements of multiple types of services in smart grids and considering the economic utility of power terminals and network side, a network slicing resource allocation algorithm based on bipartite graph matching was proposed.For the control and collection services in smart grids, the corresponding bidding information was formulated for the power terminals, and the payment price and utility matrix were calculated accordingly.The resource allocation between the network slices and the power terminals was modeled as a bipartite graph matching problem.Different slicing resources were allocated to the terminals according to the latency, transmission rate, or energy consumption requirements of different services to maximize the system utility.Simulation results show that the proposed algorithm is able to improve the system utility by 10%～20% compared to the existing double auction algorithm and greedy algorithm.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024055/network slicingresource allocationsmart gridbipartite graph matchingauction |
| spellingShingle | Weiwei XIA Yifei XIN Dong LIANG Jun WU Xin WANG Feng YAN Lianfeng SHEN Network slicing resource allocation algorithm based on bipartite graph matching in smart grids Tongxin xuebao network slicing resource allocation smart grid bipartite graph matching auction |
| title | Network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| title_full | Network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| title_fullStr | Network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| title_full_unstemmed | Network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| title_short | Network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| title_sort | network slicing resource allocation algorithm based on bipartite graph matching in smart grids |
| topic | network slicing resource allocation smart grid bipartite graph matching auction |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024055/ |
| work_keys_str_mv | AT weiweixia networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT yifeixin networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT dongliang networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT junwu networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT xinwang networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT fengyan networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids AT lianfengshen networkslicingresourceallocationalgorithmbasedonbipartitegraphmatchinginsmartgrids |