Input-Based Event-Triggering Consensus of Multiagent Systems Under Denial-of-Service Attacks
Bibliographic record
Abstract
This paper applies an input-based triggering approach to investigate the secure consensus problem in multiagent systems under denial-of-service (DoS) attacks. The DoS attacks are based on the time-sequence fashion and occur aperiodically in an unknown attack strategy, which can usually damage the control channels executed by an intelligent adversary. A novel event-triggered control scheme on the basis of the relative interagent state is developed under the DoS attacks, by designing a link-based estimator to estimate the relative interagent state between intermitted communication instead of the absolute state. Compared with most of the existing work on the design of the triggering condition related to the state measurement error, the proposed triggering condition is designed based on the control input signal from the view of privacy protection, which can avoid continuous sampling for every agent. Besides, the attack frequency and attack duration of DoS attacks are analyzed and the secure consensus is reachable provided that the attack frequency and attack duration satisfy some certain conditions under the proposed control algorithm. “Zeno phenomenon” does not exhibit by proving that there exist different positive lower bounds corresponding to different link-based triggering conditions. Finally, the effectiveness of the proposed algorithm is verified by a numerical example.
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.004 |
| 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".