Uplink scheduling and resource allocation schemes for LTE-advanced systems that incorporate relays or carry heterogeneous traffic
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
Scheduling and resource allocation is one of the important tasks of the radio resource management layer in long term evolution (LTE) and LTE-Advanced wireless systems. Uplink scheduling and resource allocation is considered more challenging compared to the downlink case because of individual users' power constraints and the discrete nature of spectrum assignment. Downlink scheduling and resource allocation has extensively been studied for relay equipped or heterogeneous traffic networks, but less work has been considered for the LTE uplink case. In this thesis, we have proposed a few uplink scheduling and resource allocation schemes of LTE-Advanced systems that incorporate relay(s) or carry heterogeneous traffic. First, we have proposed a basic uplink scheduling and resource allocation scheme for decode-and-forward relay aided systems. Existing uplink scheduling works have looked at the problem from different angles instead of basic scheduling and resource allocation. In addition of having optimal resource allocation, the proposed scheme is adaptive. If the system has some bad or redundant relays, the proposed scheme can detect and recommends them to be deactivated. Having observed the difficulty in deciding which users to serve for a relay under the constraint of limited power, second, we have proposed a joint source and relay power allocation scheme for an amplify-and-forward relayed system. Existing works of this problem have ignored one term in their problem formulation, and hence failed to offer the optimal solution for all possible scenarios. We have taken care of that missing term in our work, and have shown the performance improvement comparing with the existing works. In this solution, all entities in the network work in an altruistic manner towards maximizing the network capacity. However, in the real world, the nodes may want some benefits while sacrificing their resource. To model the selfish behavior of the nodes, in the third work, we have proposed a game theoretical solution of this problem. Fourth, we have proposed an uplink scheduling and resource allocation scheme for a network which carries heterogeneous traffic. Although there are some existing uplink scheduling works dealing QoS in heterogeneous traffic networks, those were not careful about detailed standard specific all constraints. In addition to meet the conflicting requirements of QoS for different traffic, the proposed scheme takes the resource utilization constraint into account which is designed to benefit the network operators.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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 it