Analytical Model for Sybil Attack Phases in Internet of Things
Bibliographic record
Abstract
The sybil attack in Internet of Things (IoT) commonly aims the sensing domain that may impose serious threat to the devices both in perception and communication layer. The singularity of the sybil attack is a sybil node that publish multiple identities of legitimate devices. It is highly essential to learn the behavior and predict possible actions of a sybil attacker while devising a defense mechanism for it. This paper provides a comprehensive characteristic analysis of sybil attack in IoT. Based on the nature of the task performed during this attack, it is classified into three phases as compromise, deployment, and launching phase. The compromise phase is modeled as an automaton with attacker state transition as a Markov chain model. A heuristic is also proposed for selection criteria of an attacker to compromise a node. In the deployment phase of the attack, an algorithm based on K -mean clustering is proposed to group compromised identities and deploy the sybil node for corresponding identities without violating the set of adjacent nodes. In the launching phase, the process of replacing sybil identities either over time or on detection is modeled using age replacement policy. The results depict that the proposed model effectively visualize the behavior of a sybil attacker in challenging environments of IoT.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".