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

Olamide Jogunola, Bamidele Adebisi, Kelvin Anoh, Augustine Ikpehai, Mohammad Hammoudeh, Georgina Harris and Haris Gacanin
Additional contact information
Olamide Jogunola: School of Engineering, Manchester Metropolitan University, Manchester M1 5GD, UK
Bamidele Adebisi: School of Engineering, Manchester Metropolitan University, Manchester M1 5GD, UK
Kelvin Anoh: School of Engineering, Manchester Metropolitan University, Manchester M1 5GD, UK
Augustine Ikpehai: School of Engineering, Manchester Metropolitan University, Manchester M1 5GD, UK
Mohammad Hammoudeh: School of Engineering, Manchester Metropolitan University, Manchester M1 5GD, UK
Georgina Harris: Faculty of Mathematics, Computing and Technology, The Open University, Milton Keynes MK7 6AA, UK
Haris Gacanin: Nokia-Bell Labs, Copernicuslaan, 50, 2018 Antwerp, Belgium

Energies, 2018, vol. 11, issue 9, 1-16

Abstract: 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.

Keywords: distributed algorithm; peer-to-peer (P2P); energy trading and sharing (ETS); communication; distributed energy resources (DER); multi-commodity network; prosumer; delay; virtual microgrid (VMG) (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/1996-1073/11/9/2331/pdf (application/pdf)
https://www.mdpi.com/1996-1073/11/9/2331/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:11:y:2018:i:9:p:2331-:d:167694

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().