Secure dynamic event-triggering control for consensus under asynchronous denial of service
Bibliographic record
Abstract
Introduction This article proposes a secure implementation for consensus using a dynamic event-triggered control (DETC) scheme for general autonomous multi-agent systems (MAS) under asynchronous (distributed) denial of service (DoS) attacks. The asynchronous DoS attacks can block each communication channel independently in an unknown pattern. Depending on the impact of DoS on the communication topology, the attacks are categorized into (i): connectivity-preserved DoS (CP-DoS), and (ii): connectivity-broken DoS (CB-DoS). In CP-DoS, the operating communication topology remains connected. On the other hand, in CB-DoS the adversary breaks the communication graph into isolated sub-graphs. Methods The DETC scheme is employed to reduce the control updates for each agent. To guarantee consensus under both the CP-DoS and CB-DoS, a linear matrix inequality (LMI) based optimization approach is proposed, which simultaneously designs all the unknown DETC parameters as well as the state feedback control gain. Results The proposed optimization method prioritizes the minimum inter-event interval (MIET) between consecutive control updates. The trade-off between relevant features of the MAS, namely the consensus convergence rate, intensity of control updates, and level of resilience to DoS can be handled by the proposed optimization. Discussion Simulation results quantify the effectiveness of the proposed approach, showcasing its ability to maintain secure consensus in MAS under varying DoS attack scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".