Link availability prediction enhanced IEEE 802.11-based cooperative MAC with mobile relays
Bibliographic record
Abstract
One of the most challenging issues in cooperative wireless networks at the medium access control (MAC) layer is to select a good helper (relay node) to start cooperation. The helpers' information is often stored in a CoopTable and updated via overhearing of the helpers' traffic. However, when the helpers are transmitting data infrequently or having random mobility, the cooperation may suffer from the out-of-date information in the CoopTable, since the source cannot gather enough timely information to make a good cooperation decision. In this paper, we propose to use link availability prediction to address such out-of-date information problem at the MAC layer. Making use of the possibly out-of-date information, our proposed solution does not introduce any additional signalling overhead but enables the source node to estimate the probability that the helper may appear in each cooperation zone. As such, the source node is able to make an intelligent decision even with the out-of-date information and benefit from a successful cooperation. The simulation results well demonstrate the source throughput improvement even when the helpers are less active in transmission and experiencing random walk mobility.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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".