Energy-Efficient Carrier Aggregation in 5G Using Constrained Multi-Agent MDP
Bibliographic record
Abstract
Carrier Aggregation (CA) is a promising technology in LTE and 5G networks that enhances the throughput of the users. However, since each User Equipment (UE) has to continuously monitor the activated Component Carriers (CCs) in CA, the UE energy consumption increases. To reduce the energy consumption while maximizing the throughput of UEs, we propose a dynamic and proactive CC management scheme for 5G, using a Q-Learning algorithm. To address our problem, we first model the corresponding Constrained Multi-agent Markov Decision Process (CMMDP) model and then utilize the Q-Learning algorithm to solve it. The time inter-arrival and the size of the next incoming bursts of data are proactively predicted and, along with the data in the buffer, are considered in the state space and the reward function of the machine learning model. Our proposed scheme is compared to three baseline schemes. In the first and second baseline algorithms, all CCs and only single CC are activated for each UE, respectively. For the last baseline algorithm, we simplify our Reinforcement Learning (RL) algorithm, in which the remaining data in the scheduling buffer of users is not considered and also the throughput and the number of activated CCs is balanced in the low traffic load. Simulation results reveal that our proposed Q-Learning algorithm outperforms the baselines. It achieves the same throughput as the all CC activation algorithm while reducing the UE power consumption by about 20%. These benefits are achieved by dynamically activating and deactivating CCs according to the UE traffic pattern.
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.000 | 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.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 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".