Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32450
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, W-
dc.contributor.authorWang, Z-
dc.contributor.authorDong, H-
dc.contributor.authorMao, J-
dc.contributor.authorLiu, G-P-
dc.date.accessioned2025-12-04T16:30:29Z-
dc.date.available2025-12-04T16:30:29Z-
dc.date.issued2023-10-10-
dc.identifierORCiD: Wei Chen https://orcid.org/0000-0002-6225-2110-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifierORCiD: Hongli Dong https://orcid.org/0000-0001-8531-6757-
dc.identifierORCiD: Jingfeng Mao https://orcid.org/0000-0002-9638-2546-
dc.identifierORCiD: Guo-Ping Liu https://orcid.org/0000-0002-0699-2296-
dc.identifier.citationChen, W. et al. (2024) 'Privacy-Preserving Distributed Economic Dispatch of Microgrids Over Directed Networks via State Decomposition: A Fast Consensus Algorithm', IEEE Transactions on Industrial Informatics, 20 (3), pp. 4092 - 4102. doi: 10.1109/TII.2023.3321027.en_US
dc.identifier.issn1551-3203-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32450-
dc.description.abstractThis article is concerned with the privacy-preserving distributed economic dispatch problem of microgrids. The main goal of this work is to develop a privacy-preserving distributed optimization algorithm over directed networks, aiming to achieve supply-demand balance at the lowest economic cost under practical constraints while preventing the leakage of power-sensitive information. For this purpose, a distributed optimization algorithm with a constant step size is proposed by combining the decentralized exact first-order algorithm with the push-sum protocol, which offers an advantage in terms of fast convergence. In addition, to ensure privacy preservation, a state-decomposition approach is employed by randomly dividing the state into two parts, where only partial state information is transmitted. Moreover, the effectiveness of the privacy-preserving scheme against honest-but-curious nodes and external eavesdroppers is demonstrated through rigorous analysis. Finally, simulation studies demonstrate the validity and superiority of the developed privacy-preserving distributed algorithm.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62303210, 62173255, 62188101 and U21A2019); Guangdong Basic and Applied Basic Research Foundation of China (Grant Number: 2022A1515110459); Shenzhen Science and Technology Program of China (Grant Number: RCBS20221008093348109); Shenzhen Key Laboratory of Control Theory and Intelligent Systems (Grant Number: ZDSYS20220330161800001); Hainan Province Science and Technology Special Fund of China (Grant Number: ZDYF2022SHFZ105).en_US
dc.format.extent4092 - 4102-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCopyright © 2023 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works ( https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/ ).-
dc.rights.urihttps://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/-
dc.subjectconsensus-based optimization algorithmen_US
dc.subjecteconomic dispatch (ED)en_US
dc.subjectmicrogridsen_US
dc.subjectprivacy preservationen_US
dc.subjectpush-sum protocolen_US
dc.subjectstate decompositionen_US
dc.titlePrivacy-Preserving Distributed Economic Dispatch of Microgrids Over Directed Networks via State Decomposition: A Fast Consensus Algorithmen_US
dc.typeArticleen_US
dc.date.dateAccepted2023-09-06-
dc.identifier.doihttps://doi.org/10.1109/TII.2023.3321027-
dc.relation.isPartOfIEEE Transactions on Industrial Informatics-
pubs.issue3-
pubs.publication-statusPublished-
pubs.volume20-
dc.identifier.eissn1941-0050-
dcterms.dateAccepted2023-09-06-
dc.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2023 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works ( https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/ ).1.54 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.