Network Coding Aided Collaborative Real-Time Scalable Video Transmission in D2D Communications
Bibliographic record
Abstract
There has been an increasing demand for providing real-time video streaming services in the next-generation cellular networks. To improve the quality of such services without additional infrastructure, neighboring devices can recover missing packets by using network coding aided collaborative transmission via device-to-device (D2D) communication. However, most existing work in this area had not considered the issue of how to schedule such coding aided collaborative transmissions effectively for supporting real-time scalable video applications in such environment. In this paper, we study how to improve the quality of real-time scalable video services by efficiently scheduling coding aided collaborative transmissions. We first formulate the problem of optimal collaborative transmission scheduling that determines the optimal transmitting sequence and coding pattern at each transmitting device, which is shown to be NP-hard. To address this problem, we propose a new weight function for measuring the quality of a coding pattern by considering packet recovery gain and potential video decoding gain at receivers. Based on this new weight function, we propose a low complexity centralized algorithm using global state information and an efficient distributed mechanism supporting localized operations in dynamic environment. We deduce their computational complexities. Simulation results verify that the proposed solution outperforms the representative work in the literature.
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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".