Privacy-Preserving Distributed Economic Dispatch of Microgrids Over Directed Networks via State Decomposition: A Fast Consensus Algorithm

This 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.

Automated summary

This article discusses the privacy-preserving distributed economic dispatch problem of microgrids. A distributed optimization algorithm with a constant step size is proposed by combining decentralized exact first-order algorithm with the push-sum protocol to achieve privacy preservation. It is demonstrated through analysis that the scheme is effective in protecting privacy in various scenarios.