The Open UniversitySkip to content
 

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

Jogunola, Olamide; Adebisi, Bamidele; Anoh, Kelvin; Ikpehai, Augustine; Hammoudeh, Mohammad; Harris, Georgina and Gacanin, Haris (2018). Distributed Adaptive Primal Algorithm for P2P-ETS over Unreliable Communication Links. Energies, 11(9), article no. 2331.

Full text available as:
[img]
Preview
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (783kB) | Preview
DOI (Digital Object Identifier) Link: https://doi.org/10.3390/en11092331
Google Scholar: Look up in Google Scholar

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

Item Type: Journal Item
Copyright Holders: 2018 The Authors
ISSN: 1996-1073
Project Funding Details:
Funded Project NameProject IDFunding Body
Not SetNot SetManchester Metropolitan University
Not SetEP/N03466X/1EPSRC (Engineering and Physical Sciences Research Council)
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)
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 59314
Depositing User: Georgina Harris
Date Deposited: 01 Mar 2019 15:12
Last Modified: 03 Aug 2019 03:32
URI: http://oro.open.ac.uk/id/eprint/59314
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU