New conceptual representation of collision attack in wireless sensor networks
Bibliographic record
Abstract
Diagrammatic methodologies for modeling information security attacks have been developed in various forms (e.g.attack trees, use cases, and misuse cases) and applied for many purposes (e.g.security requirements specifi cation and identifi cation of commonly occurring attack patterns).They play an important role in the development of more effective communication between technical and nontechnical participants than that made possible by text.Recently, Unifi ed Modeling Language (UML) sequence diagrams have been used to model security attacks (e.g.collision attacks and unintelligent replay attacks) in wireless sensor networks (WSNs).WSNs require protection to preserve the confi dentiality and integrity of sensitive information as well as availability of the system.This is an important research issue because WSNs are used in critical applications such as military battlefi eld surveillance, industrial process monitoring and control, and machine health monitoring.This paper describes an alternative fl ow-based approach for visualizing security attacks in terms of depiction of behavioral interactions.It models security attacks in WSNs and contrasts this method with the sequence-based diagrammatic method.The comparison provides an initial appraisal of the technique with reference to a well-known process modeling methodology.The results indicate that the method can capture the interweaving of attack events to achieve a more complete and detailed picture necessary for better understanding.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 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".