Cooperative wireless multicast: performance analysis and power/location optimization
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
The popularity of multimedia multicast/broadcast applications over wireless networks makes it critical to address the error-prone, heterogeneous and dynamically changing nature of wireless channels. A promising solution to combat channel fading is to explore the cooperative diversity in which users may help each other forward packets. This paper investigates cooperative multicast schemes that use a maximal ratio combiner to enhance the received signal-to-noise ratio (SNR), and provides a thorough performance analysis. Two relay selection schemes are considered: the distributed and the genie-aided cooperation schemes. We derive the closed-form formulation and the approximations of their average outage probabilities.We also analyze the optimal power allocation and relay location strategies, and show that allocating half of the total transmission power to the source minimizes the average outage probability. Our analysis and simulation results show that cooperative multicast gives better performance when more relays help forward signals. Cooperative multicast helps achieve diversity order 2, and user cooperation can significantly reduce the outage probability, especially in the high SNR region. Finally, we compare the two cooperation strategies, and show that distributed cooperative multicast is preferred since it achieves a lower outage probability without introducing extra overhead for control messages.
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.000 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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