An effective communication and computation model based on a hybridgraph-deeplearning approach for SIoT
Bibliographic record
Abstract
Social Edge Service (SES) is an emerging mechanism in the Social Internet of Things (SIoT) orchestration for effective user-centric reliable communication and computation. The services are affected by active and/or passive attacks such as replay attacks, message tampering because of sharing the same spectrum, as well as inadequate trust measurement methods among intelligent devices (roadside units, mobile edge devices, servers) during computing and content-sharing. These issues lead to computation and communication overhead of servers and computation nodes. To address this issue, we propose the HybridgrAph-Deep-learning (HAD) approach in two stages for secure communication and computation. First, the Adaptive Trust Weight (ATW) model with relation-based feedback fusion analysis to estimate the fitness-priority of every node based on directed graph theory to detect malicious nodes and reduce computation and communication overhead. Second, a Quotient User-centric Coeval-Learning (QUCL) mechanism to formulate secure channel selection, and Nash equilibrium method for optimizing the communication to share data over edge devices. The simulation results confirm that our proposed approach has achieved effective communication and computation performance, and enhanced Social Edge Services (SES) reliability than state-of-the-art approaches.
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.002 |
| 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.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".