z-logo
open-access-imgOpen Access
Coordinated consensus for smart grid economic environmental power dispatch with dynamic communication network
Author(s) -
Hamdi Mounira,
Chaoui Mondher,
Idoumghar Lhassane,
Kachouri Abdennaceur
Publication year - 2018
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2017.1197
Subject(s) - smart grid , economic dispatch , robustness (evolution) , computer science , telecommunications network , distributed computing , grid , electric power system , communications protocol , distributed generation , computer network , engineering , renewable energy , power (physics) , biochemistry , physics , chemistry , geometry , mathematics , quantum mechanics , electrical engineering , gene
Combined economic environmental dispatch problem (CEEDP) is one of the greatest challenges of the future smart grids. It aims at reducing the total cost during the power production process considering the growing environmental impact due to the emission of gaseous pollutants of fossil fuels. This study develops a robust distributed algorithm based on consensus protocols in multi‐agent systems, to solve the smart grid CEEDP with a practical communication network consisting of a dynamic communication network, randomly communication failure, transmission delay and noise in communication channels. The proposed algorithm is fully distributed and cooperative in such a way that it eliminates the need for a central energy‐management unit, or a leader. The performance of the fully decentralised consensus protocol was evaluated on the IEEE 30‐bus and the IEEE 118‐bus test system. A comparison with previous consensus algorithms proves the supremacy of the proposed approach in terms of its robustness under dynamic communication network with randomly link failure.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here