Performance Modeling and Analysis of a Class of ARQ Protocols in Multi-Hop Wireless Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper models and analyzes the performances of a class of ARQ (automatic repeat request) protocols in a multi-hop wireless data network. The performance metric here is the number of transmissions required for successful delivery of a packet over a multi-hop path. By using a discrete-time Markov model, the distribution for the total required number of transmissions is modeled as phase type distribution. The effects of different network parameters-such as packet error rate in each hop, maximum number of allowable retransmissions at each hop and retransmission probability at each hop-on the required total number of transmissions are investigated. The novelty of this model is that the probability mass function (pmf) for the number of transmissions required for successful end-to-end delivery of a packet can be easily obtained under different hop-level error control policies. Using the pmf, the tradeoff between transmission energy and percentage of data delivery (i.e., reliability) in a multi-hop path can be analyzed. The analytical model is validated by simulations. While the proposed analytical framework is general enough to capture the impact of any MAC (medium access control) mechanism at each hop, we specifically present typical performance results under IEEE 802.11 DCF (distributed coordination function) MAC
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.
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 it