Reputation-Aware Relay Selection with Opportunistic Spectrum Access: A Blockchain Approach
Bibliographic record
Abstract
<p>The highly dynamic nature of cognitive radio (CR) systems and their stringent latency requirements pose a major challenge in the realization of efficient intelligent transport systems (ITS). In this paper, we investigate relay selection and opportunistic spectrum access in conjunction with blockchain technology in a secure manner. Specifically, we propose a cross-layer method for secure relay selection, where secondary relays (SRs) are granted access to available spectrum bands based on the balance of their respective virtual wallets. These virtual wallets, which are built based on the SRs' secrecy capacity and their behavior in the network, are the predominant factors that allow SRs to participate in an auction model. To quantify the trustworthiness of the SRs, we formulate a mathematical framework to evaluate the trust value of each SR, which is then leveraged for rewarding or penalizing the SR. Furthermore, we develop an offline blockchain framework to store the information of participating relays and make it available for future operations, in order to detect reputable and non-reputable relays in the presence of multiple eavesdroppers. The stored reputations of the participating relays are used to develop a self-learning algorithm to exclude the non-reputable relays from the selection group. Finally, we present thorough numerical results to demonstrate the superiority of the proposed system in terms of security, credibility, and integrity.</p>
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.002 |
| 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 teacher head, 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".