Social stability enhanced mobile D2D relay networks: An optimal stopping approach
Bibliographic record
Abstract
Device-to-device (D2D) relay network is regarded as a promising technology to meet the drastically increasing demands on local-based communication services. The relay devices on users with social behaviors will inevitably cause the negative effects on the stability of D2D communications. To improve the stability of the communication over mobile relays, we exploit users' social information in terms of contact duration to characterize the social stabilities of potential relays. Furthermore, with optimal stopping theory, we propose a joint social-physical relay re-selection scheme. This scheme takes into account the mobility of the currently selected relay as well as the social stability and physical conditions of potential relays. This can avoid the interruption of relayed communication and achieve the long-term increase of the relayed data traffic. Our scheme is shown to exhibit the stage-dependent policy structure that is adaptive for different mobility and social stability. This structure indicates that the relay re-selection scheme can achieve the tradeoff between the cost of relay probing and the amount of relayed data traffic. We conduct extensive simulations to demonstrate the superiority of our proposed scheme compared with other baseline schemes. The impact of social stability and mobility on the performance are revealed by our simulation results.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 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.003 | 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".