1 Adaptive Mode Selection for Bidirectional Relay Networks – Fixed Rate Transmission
Bibliographic record
Abstract
In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not present. We assume that channel state information at the transmitter (CSIT) is not available and/or only one coding and modulation scheme is used at the transmitters due to complexity constraints. Thus, the nodes transmit with a fixed predefined rate regardless of the channel state information (CSI). In general, the nodes in the network can assume one of three possible states in each time slot, namely the transmit, receive, and silent state. Most of the existing protocols assume a fixed schedule for the sequence of the states of the nodes. In this paper, we abandon the restriction of having a fixed and predefined schedule and propose a new protocol which, based on the CSI at the receiver (CSIR), selects the optimal states of the nodes in each time slot such that the sum throughput is maximized. To this end, the relay has to be equipped with two buffers for storage of the information received from the two users. Numerical results show that the proposed protocol significantly outperforms the existing protocols.
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.001 | 0.001 |
| 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".