Collaborative communications: Joint relay and protocol selection
Bibliographic record
Abstract
We consider a decode and forward collaborative network and investigate the relay selection problem. Users are able to collaborate with each other; decode messages of each other, re-encode and forward along with their own messages to the destination (collaborative protocol). We study the performance obtained from collaboration in terms of 1) increasing the achievable rate, 2) saving the transmit energy, and 3) reducing the resource requirement. To ensure fairness among the users, we assume that the transmit energy to the rate ratio is fixed for all users. We allocate resource optimally for the proposed collaborative protocol (CP) with the imposed fairness constraint, and compare the result with the non-collaborative protocol (NCP) where users transmits their messages directly to the destination. We show that a considerable gain can be obtained if the direct source-destination channel gain is significantly smaller than those of alternative involved links. We demonstrate that a rate and energy improvement of up to (1 + etaradic(k/k+1)) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">eta</sup> can be obtained, where eta is the environment path loss exponent and k is the ratio of the rates of involved users. The maximum gain can be obtained for low transmit-energy-to-received-noise-ratio (TERN). In contrast, in a high TERN environment the NCP is preferred.
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.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 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".