A Secure and Efficient Authentication Mechanism Applied to Cognitive Radio Networks
Bibliographic record
Abstract
Cognitive radio (CR) has been introduced to accommodate the steady increment in the spectrum demand. Wireless security in CR network (CRN) is a challenging technical area due to the dynamic and unique characteristics of CRNs. As a cognitive node can dynamically join or leave the spectrum, providing secure communication becomes problematic and requires more investigation. Authentication is a primary security property in wireless networks, wherein the identity of a cognitive node is verified before providing access to available resources. In this paper, a two-level authentication scheme for communication in a CRN is proposed. Before joining the network, a CR node is validated by obtaining security credentials from an authorized point. The proposed scheme relies on publicand symmetric-key cryptography, instead of using a digital signature-based approach. It encrypts data between the communicating nodes in order to improve network security in terms of resource availability and accessibility. This mitigates attacks such as reflection attack, denial of service attack, and man-in-the-middle attack. The scheme has been evaluated and verified in terms of security functionality, its correctness, and the performance, which shows less computation and communication requirements.
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.002 |
| Research integrity | 0.001 | 0.001 |
| 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".