A Survey on Trust Models in Heterogeneous Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Heterogeneous networks (HetNets) merge different types of networks into an integrated network system, which has become a hot research area in recent years towards next-generation communication networks. HetNets aim to effectively exploit network resources and provide seamless connectivity for heterogeneous objects. Unlike other networks, HetNets hold such characteristics as heterogeneity, openness, distribution, multi-domain involvement, thus are susceptible to various security threats and attacks. Traditional security approaches are not sufficiently effective in defending against them. With extensive study and practice, researchers found that trust models offer effective measures to enhance the security and reliability of a network system. However, there still lacks a comprehensive survey on the recent advances of trust models in HetNets. In this paper, we fill this gap. We first retrospect the history of HetNets research and introduce important concepts related to trust. Then, we propose a set of criteria that a sound trust model should satisfy, which can also serve as a measure to evaluate the quality of a trust model, i.e., Quality of Trust (QoT). We provide taxonomies of trust models and their applications, and continue with a thorough review on trust models in HetNets. Based on the review, a list of open issues is highlighted, and corresponding future research directions are suggested to advance the research on trustworthy HetNets.
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.
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.017 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it