Cooperative Device-to-Device Communication for Uplink Transmission in Cellular System
Bibliographic record
Abstract
The rapid development of the Internet of Things has brought new challenges to cellular networks with super-dense devices and deep-fading channels. These challenges may substantially decrease the transmission efficiency and increase the device's power consumption, especially in the uplink. A pressing issue is to improve enhanced Node B's (eNB) scheduler considering a large number of users. In this paper, a semi-centralized cooperative control method is proposed for the cellular uplink transmissions, where the user equipment (UE) relays are randomly selected according to a certain density decided by the eNB. Two specific cooperative schemes based on device-to-device (D2D) communications are proposed, which are the random UE relay scheme and the one further applying network coding. The D2D interference is considered and modeled based on stochastic geometry. The proposed schemes are analyzed based on two distinct traffic models, i.e., the machine type communications traffic with the small-data feature and the full-buffer traffic. Extensive Monte Carlo simulations have been conducted for the small-data traffic and the closed-form theoretical results have been derived for the full-buffer traffic. Performance gains are achieved in various scenarios and the comparisons between two cooperative schemes are made as well. The results provide an important guideline for the eNB to determine how to select and configure cooperative D2D communication for uplink.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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 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".