QoS Guaranteed Resource Allocation in Cooperative Cellular Network with MIMO-Based Relays
Bibliographic record
Abstract
Relay-based cooperative transmission in cellular wireless networks has been an area of tremendous research recently. Since MIMO technique has been shown to increase the spectral efficiency significantly, relays with MIMO antennas seem to be potential candidate for future cooperative cellular system in order to achieve reliable transmission, high system throughput and extended network coverage. In this paper, we study a cellular system scenario where quality of service (QoS) of multiple data streams originating from a base station (BS) targeted to multiple mobile stations (MSs) is guaranteed by using pre-installed relay stations (RSs) with MIMO antennas. We propose a low-complexity algorithm to design precoder matrices at BS and RS by using joint zero-forcing strategy to avoid multiuser interference in the signal received at the MSs via both the direct path (BS-MS) and the relay path (BS-RS-MS). The proposed algorithm guarantees a predefined signal-to-noise ratio at each user within the transmit power constraint at BS and with the minimal sum transmit power of BS and RS. Simulation results show that proposed algorithm outperforms the singular value decomposition (SVD)-based scheme existing in the literature by keeping the outage probability lower. Moreover, the performance of proposed algorithm compared to that of SVD-based scheme is further improved when the RS is not situated directly between the BS and the MSs.
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.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".