Byzantine-Resilient Resource Allocation Over Decentralized Networks

Wang, Runhua; Liu, Yaohua; Ling, Qing

doi:10.1109/tsp.2022.3209010

Cited by 12 publications

(9 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The uniform connectivity also allows for convergence over unreliable networks with packet drops. Resource allocation in the presence of malicious agents [48] is another future direction.…”

Section: Simulationsmentioning

confidence: 99%

Distributed Delay-Tolerant Strategies for Equality-Constraint Sum-Preserving Resource Allocation

Doostmohammadian

Aghasi

Vrakopoulou

et al. 2023

Preprint

View full text Add to dashboard Cite

“…The uniform connectivity also allows for convergence over unreliable networks with packet drops. Resource allocation in the presence of malicious agents [48] is another future direction.…”

Section: Simulationsmentioning

confidence: 99%

Distributed Delay-Tolerant Strategies for Equality-Constraint Sum-Preserving Resource Allocation

Doostmohammadian

Aghasi

Vrakopoulou

et al. 2023

Preprint

View full text Add to dashboard Cite

“…Our proposed algorithms have several advantages over BREDA [29]: simplicity, generality and dual consensus. First, at each iteration of BREDA, each honest agent needs to update a primal variable, a dual variable, and an auxiliary variable that tracks the average of the honest primal variables.…”

Section: B Advantages Over Bredamentioning

confidence: 99%

“…To fill this gap, [28] proposes a primal-dual Byzantineresilient resource allocation algorithm from a robust optimization perspective, but the proposed algorithm is only applicable in a distributed network with a central server. A Byzantineresilient decentralized resource allocation (BREDA) algorithm is developed in [29]. In addition to the updates of primal and dual variables, each honest agent maintains an auxiliary variable that dynamically tracks the average of all honest agents' primal variables.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, we can let each honest agent filter the received neighboring dual variables with properly designed robust aggregation rules, including but not limited to CTM, IOS and SCC. C2) Compared with BREDA that defends against Byzantine attacks in the primal domain [29], the proposed algorithms utilize dual-domain defenses, and have the following advantages: (i) maintaining less variables and simpler updates; (ii) allowing more general robust aggregation rules than CTM; (iii) being able to reach dual consensus. C3) Theoretically, we prove that if the robust aggregation rules are properly designed, the proposed algorithms converge to neighborhoods of the optimal primal-dual pair, and the honest agents are guaranteed to reach consensus in the dual domain even at presence of Byzantine attacks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Byzantine-Resilient Decentralized Resource Allocation

Wang¹,

Liu

Ling³

2022

ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

This paper investigates the problem of decentralized resource allocation in the presence of Byzantine attacks. Such attacks occur when an unknown number of malicious agents send random or carefully crafted messages to their neighbors, aiming to prevent the honest agents from reaching the optimal resource allocation strategy. We characterize these malicious behaviors with the classical Byzantine attacks model, and propose a class of Byzantine-resilient decentralized resource allocation algorithms augmented with dual-domain defenses. The honest agents receive messages containing the (possibly malicious) dual variables from their neighbors at each iteration, and filter these messages with robust aggregation rules. Theoretically, we prove that the proposed algorithms can converge to neighborhoods of the optimal resource allocation strategy, given that the robust aggregation rules are properly designed. Numerical experiments are conducted to corroborate the theoretical results.

show abstract

“…To the best of our knowledge, the topic of resilient resource allocation has been addressed in a limited number of papers, including [23], [24], and [25]. In [23] and [24], the authors propose decentralized primal-dual optimization frameworks that incorporate a trusted coordinator connecting all agents.…”

Section: Introductionmentioning

confidence: 99%

Resilient and Privacy-Preserving Multi-Agent Optimization and Control of a Network of Battery Energy Storage Systems Under Attack

Kaheni,

Usai,

Franceschelli

2024

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

This paper deals with resilient and privacypreserving control to optimize the daily operation costs of networked Battery Energy Storage Systems (BESS) in a multiagent network vulnerable to various types of cyber-attacks. First, we formulate the optimization problem by defining the objective function and the local and coupling constraints. Next, we introduce a novel resilient decentralized control and optimization algorithm that can mitigate the effects of cyber-attacks, specifically false data injection attacks and hijacking, to enhance the network's resilience. The proposed method is based on filtering out outlier Lagrange multipliers in a suitable dual problem. Our proposed algorithm has two main advantages compared to the existing literature. Firstly, it can solve problems where the coupling constraint is not restricted to the average or a function of the average of decision variables. Secondly, our algorithm extends the well-known dual decomposition and Lagrange multiplier method to the decentralized control problem of BESSs. In the proposed algorithm presented in this paper, only the data relevant to the dual problem is exchanged among the agents. Noticing that the data of the dual problem does not contain any private information, mitigating privacy concerns associated with our proposed algorithm. We formally prove the convergence of our algorithm to a feasible and sub-optimal solution. Additionally, simulations demonstrate the effectiveness of our results.Note to Practitioners-Optimal coordinated control of BESSs increases the power system's reliability and reduces costs. With the expansion of the use of small-scale BESSs in household customers, it is possible to considerably increase the free capacity of power networks by optimally controlling these small BESSs.

show abstract

Byzantine-Resilient Resource Allocation Over Decentralized Networks

Cited by 12 publications

References 45 publications

Distributed Delay-Tolerant Strategies for Equality-Constraint Sum-Preserving Resource Allocation

Distributed Delay-Tolerant Strategies for Equality-Constraint Sum-Preserving Resource Allocation

Byzantine-Resilient Decentralized Resource Allocation

Resilient and Privacy-Preserving Multi-Agent Optimization and Control of a Network of Battery Energy Storage Systems Under Attack

Contact Info

Product

Resources

About