A Reputation-based Distributed District Scheduling Algorithm for Smart Grids

A Reputation-based Distributed District Scheduling Algorithm for Smart Grids


Subject and more

  • LCC Subject Category: Computer and Information Science, Telecommunications
  • Publisher's keywords: Distributed Algorithms, Autonomous Demand Response management, Energy Consumption Scheduling, Smart Power Grids, Reputation algorithm
  • Language of fulltext: english
  • Full-text formats available: PDF
  • Time From Submission to Publication: 7


    D. Borra, M. Iori, C. Borean, F. Fagnani


To download PDF files Login to your Account.


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.

About Europub

EuroPub is a comprehensive, multipurpose database covering scholarly literature, with indexed records from active, authoritative journals, and indexes articles from journals all over the world. The result is an exhaustive database that assists research in every field. Easy access to a vast database at one place, reduces searching and data reviewing time considerably and helps authors in preparing new articles to a great extent. EuroPub aims at increasing the visibility of open access scholarly journals, thereby promoting their increased usage and impact.