UNION: A Trust Model Distinguishing Intentional and Unintentional Misbehavior in Inter-UAV Communication
Bibliographic record
Abstract
Ensuring the desired level of security is an important issue in all communicating systems, and it becomes more challenging in wireless environments. Flying Ad Hoc Networks (FANETs) are an emerging type of mobile network that is built using energy-restricted devices. Hence, the communications interface used and that computation complexity are additional factors to consider when designing secure protocols for these networks. In the literature, various solutions have been proposed to ensure secure and reliable internode communications, and these FANET nodes are known as Unmanned Aerial Vehicles (UAVs). In general, these UAVs are often detected as malicious due to an unintentional misbehavior related to the physical features of the UAVs, the communication mediums, or the network interface. In this paper, we propose a new context-aware trust-based solution to distinguish between intentional and unintentional UAV misbehavior. The main goal is to minimize the generated error ratio while meeting the desired security levels. Our proposal simultaneously establishes the inter-UAV trust and estimates the current context in terms of UAV energy, mobility pattern, and enqueued packets, in order to ensure full context awareness in the overall honesty evaluation. In addition, based on computed trust and context metrics, we also propose a new inter-UAV packet delivery strategy. Simulations conducted using NS2.35 evidence the efficiency of our proposal, called UNION , at ensuring high detection ratios > 87% and high accuracy with reduced end-to-end delay, clearly outperforming previous proposals known as RPM , T - CLAIDS , and CATrust .
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.005 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".