A discrete-time clustered distributed algorithm for solving linear equations under denial-of-service attacks
Bo Wang1, Chen Chen2, Jinghao Li2
1College of Information Science and Engineering, Northeastern University, Shenyang 110819, China; China Tianchen Engineering Corporation Heilongjiang Branch, Harbin 150076, China.
Abstract:
This paper investigates the problem of designing a discrete-time clustered distributed algorithm to solve large-scale linear equations via clustered multi-agent network in the presence of denial-of-service attacks. First, a discrete-time clustered distributed algorithm is proposed to solve linear equations. Then the resilience of the proposed distributed algorithm to denial-of-service attacks is analyzed. It is shown that the distributed algorithm proposed can reach a consensus exponentially on one of the solutions of linear equations provided that certain conditions regarding the number of denial-of-service attacks is satisfied. Finally, the effectiveness of the distributed algorithm proposed is validated via the numerical simulations of the power flow calculation of power systems.
Related Concept Videos
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
Distributed Loads: Problem Solving
Statically Indeterminate Problem Solving
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Transmission-Line Differential Equations
Line Section Model
A circuit representing a line section of length Δx helps in understanding the transmission line parameters. The voltage V(x) and current i(x) are measured...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...


