Distributed Adaptive Primal Algorithm for P2P-ETS over Unreliable Communication Links

被引:10
作者
Jogunola, Olamide [1 ]
Adebisi, Bamidele [1 ]
Anoh, Kelvin [1 ]
Ikpehai, Augustine [1 ]
Hammoudeh, Mohammad [1 ]
Harris, Georgina [2 ]
Gacanin, Haris [3 ]
机构
[1] Manchester Metropolitan Univ, Sch Engn, Manchester M1 5GD, Lancs, England
[2] Open Univ, Fac Math Comp & Technol, Milton Keynes MK7 6AA, Bucks, England
[3] Nokia Bell Labs, Copernicuslaan 50, B-2018 Antwerp, Belgium
基金
英国工程与自然科学研究理事会;
关键词
distributed algorithm; peer-to-peer (P2P); energy trading and sharing (ETS); communication; distributed energy resources (DER); multi-commodity network; prosumer; delay; virtual microgrid (VMG); ENERGY-RESOURCES; DISPATCH;
D O I
10.3390/en11092331
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Algorithms for distributed coordination and control are increasingly being used in smart grid applications including peer-to-peer energy trading and sharing to improve reliability and efficiency of the power system. However, for realistic deployment of these algorithms, their designs should take into account the suboptimal conditions of the communication network, in particular the communication links that connect the energy trading entities in the energy network. This study proposes a distributed adaptive primal (DAP) routing algorithm to facilitate communication and coordination among proactive prosumers in an energy network over imperfect communication links. The proposed technique employs a multi-commodity flow optimization scheme in its formulation with the objective to minimize both the communication delay and loss of energy transactional messages due to suboptimal network conditions. Taking into account realistic constraints relating to network delay and communication link capacity between the peers, the DAP routing algorithm is used to evaluate network performance using various figures of merit such as probability of signal loss, message delay, congestion and different network topologies. Further, we address the link communication delay problem by redirecting traffic from congested links to less utilized ones. The results show that the proposed routing algorithm is robust to packet loss on the communication links with a 20% reduction in delay compared with hop-by-hop adaptive link state routing algorithm.
引用
收藏
页数:16
相关论文
共 43 条
  • [31] Su L., 2016, PACKET DROPPING LINK
  • [32] Trdlicka J., CHINA, P1
  • [33] Varagnolo D., 2016, IEEE T AUTOM CONTROL, V61, P994
  • [34] Vukobratovic D, DISTRIBUTED SYSTEMS
  • [35] Distributed Optimal Dispatch of Distributed Energy Resources Over Lossy Communication Networks
    Wu, Junfeng
    Yang, Tao
    Wu, Di
    Kalsi, Karanjit
    Johansson, Karl Henrik
    [J]. IEEE TRANSACTIONS ON SMART GRID, 2017, 8 (06) : 3125 - 3137
  • [36] Distributed Bisection Method for Economic Power Dispatch in Smart Grid
    Xing, Hao
    Mou, Yuting
    Fu, Minyue
    Lin, Zhiyun
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2015, 30 (06) : 3024 - 3035
  • [37] Consensus Based Approach for Economic Dispatch Problem in a Smart Grid
    Yang, Shiping
    Tan, Sicong
    Xu, Jian-Xin
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2013, 28 (04) : 4416 - 4426
  • [38] YANG T, SOCIETY, P26, DOI DOI 10.5194/PIAHS-372-1-2015
  • [39] YANG T, 2016, IEEE T IND ELECTRON, V63, P1318, DOI DOI 10.1109/TIE.2015.2504050
  • [40] A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays
    Yang, Tao
    Lu, Jie
    Wu, Di
    Wu, Junfeng
    Shi, Guodong
    Meng, Ziyang
    Johansson, Karl Henrik
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2017, 64 (06) : 5095 - 5106