Relay Selection for OFDM Wireless Systems under Asymmetric Information: A Contract-Theory Based Approach
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
User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes to spend their energy acting as relays. Moreover, these potential relays are better informed than the source about their transmission costs, which depend on the exact channel conditions on their relay-destination links. This results in asymmetry of available information between the source and the relays. In this paper, we use contract theory to tackle the problem of relay selection under asymmetric information in OFDM-based cooperative wireless system that employs decode-and-forward (DF) relaying. We first design incentive compatible offers/contracts, consisting of a menu of payments and desired signal-to-noise-ratios (SNR)s at the destination. The source then broadcasts this menu to nearby mobile nodes. The nearby mobile nodes which are willing to relay, notify back the source with the contracts they agree to accept in each subcarrier. We show that when the source is under a budget constraint, the problem of relay selection in each subcarrier with the goal of maximizing capacity is a nonlinear non-separable knapsack problem. We propose a heuristic relay selection scheme to solve this problem. We compare the performance of our overall mechanism and the heuristic solution with a simple relay selection scheme. Selected numerical results show that our solution performs better and is close to optimal. The benefits of the overall mechanism introduced in this thesis is that it is simple to implement, needs limited interaction with potential relays and hence it requires minimal signalling overhead.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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