Research Article
A Reputation-based Distributed District Scheduling Algorithm for Smart Grids
@ARTICLE{10.4108/cogcom.1.2.e3, author={D. Borra and M. Iori and C. Borean and F. Fagnani}, title={A Reputation-based Distributed District Scheduling Algorithm for Smart Grids}, journal={EAI Endorsed Transactions on Cognitive Communications}, volume={1}, number={2}, publisher={ICST}, journal_a={COGCOM}, year={2015}, month={5}, keywords={Distributed Algorithms, Autonomous Demand Response management, Energy Consumption Scheduling, Smart Power Grids, Reputation algorithm}, doi={10.4108/cogcom.1.2.e3} }- D. Borra
M. Iori
C. Borean
F. Fagnani
Year: 2015
A Reputation-based Distributed District Scheduling Algorithm for Smart Grids
COGCOM
ICST
DOI: 10.4108/cogcom.1.2.e3
Abstract
In this paper we develop and test a distributed algorithm providing Energy Consumption Schedules (ECS) in smart grids for a residential district. The goal is to achieve a given aggregate load pro le. The NP-hard constrained optimization problem reduces to a distributed unconstrained formulation by means of Lagrangian Relaxation technique, and a meta-heuristic algorithm based on a Quantum inspired Particle Swarm with Levy flights. A centralized iterative reputation-reward mechanism is proposed for end-users to cooperate to avoid power peaks and reduce global overload, based on random distributions simulating human behaviors and penalties on the e ective ECS di ering from the suggested ECS. Numerical results show the protocols e ectiveness.
Copyright © 2015 D. Borra et al., licensed to ICST. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited
