Performance Analysis and Enhancement of Cooperative Retransmission Strategy for Delay-Sensitive Real-Time Services
Bibliographic record
Abstract
As a very promising technique, multi-hop relay has been considered in many wireless networks. It can take advantage of the inherent broadcasting nature of wireless transmission and facilitate cooperative communications. In this paper, we develop an effective analytical framework to study the delay performance of cooperative retransmission strategies. All neighbor nodes overhearing the in-progress transmission cooperate in a distributed manner and contribute to retransmissions. In particular, we focus on the application of cooperative retransmission for delay-sensitive real-time services. Based on the proposed analytical framework, the cumulative distribution function of packet transfer delay can be numerically evaluated. Accordingly, we investigate the delay outage probability (i.e., the probability of violating the maximum delay bound), which is an essential statistical quality-of-service (QoS) metric for real-time services. Further, an enhancement approach is proposed to reduce unnecessary power consumption on retransmissions. It dynamically adapts the transmission probabilities of all participating nodes, depending on current retransmission count. As shown in the numerical results, the adaptive cooperative strategy can achieve a better trade-off between satisfying delay constraint and minimizing total power consumption.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".