REVIEW
A Jamming-resilient Algorithm for Self-triggered Network Coordination
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A Jamming-resilient Algorithm for Self-triggered Network Coordination
read the original abstract
The issue of cyber-security has become ever more prevalent in the analysis and design of cyber-physical systems. In this paper, we investigate self-triggered consensus networks in the presence of communication failures caused by Denialof- Service (DoS) attacks. A general framework is considered in which the network links can fail independent of each other. By introducing a notion of Persistency-of-Communication (PoC), we provide an explicit characterization of DoS frequency and duration under which consensus can be preserved by suitably designing time-varying control and communication policies. An explicit characterization of the effects of DoS on the consensus time is also provided. The considered notion of PoC is compared with classic average connectivity conditions that are found in pure continuous-time consensus networks. Finally, examples are given to substantiate the analysis.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.