Energy-aware resource allocation in next generation wireless networks : application in large-scale MIMO Systems
Bibliographic record
Abstract
In this thesis, we investigate the resource allocation problem for wireless networks that incorporate large-scale multiple-input multiple-output (MIMO) systems. These systems are considered as key technologies for future 5G wireless networks and are based on using few hundreds of antennas simultaneously to serve tens of users in the same time-frequency resource. The gains obtained by large-scale MIMO systems cannot be fully exploited without adequate resource allocation strategies. Hence, the aim of this thesis is to develop energy-aware resource allocation solutions for large-scale MIMO systems that take into consideration network power cost. \n \nFirstly, this thesis investigates the downlink of a base station equipped with large-scale MIMO system while taking into account a non-negligible transmit circuit power consumption. This consumption involves that activating all RF chains does not always necessarily achieve the maximum sum-rate. Thus, we derive the optimal number of activated RF chains. In addition, efficient antenna selection, user scheduling and power allocation algorithms in term of instantaneous sum-rate are proposed and compared. Also, fairness is investigated by considering equal receive power among users. \n \nSecondly, this thesis investigates a large-scale MIMO system that incorporates energy harvesting that is a promising key technology for greening future wireless networks since it reduces network operation costs and carbon footprints. Hence, we consider distributed large-scale MIMO systems made up of a set of remote radio heads (RRHs), each of which is powered by both an independent energy harvesting source and the grid. The grid energy source allows to compensate for the randomness and intermittency of the harvested energy. Optimal on-line and off-line energy management strategies are developed. In addition, on-line energy management algorithm based on energy prediction is devised. The feasibility problem is addressed by proposing an efficient link removal algorithm and for better energy efficiency, RRH on/off operation is investigated. \n \nThirdly, wireless backhauling was proposed as an alternative solution that enable low-cost connection between the small base stations and the macro base station in heterogeneous networks (HetNets). The coexistence of massive MIMO, HetNets and wireless backhauling is a promising research direction since massive MIMO is a suitable solution to enable wireless backhauling. Thus, we propose a new transmission technique that is able to efficiently manage the interference in heterogeneous networks with massive MIMO wireless backhaul. The optimal time splitting parameter and the allocated transmit power are derived. The proposed transmission technique is shown to be more efficient in terms of transmit power consumption than the conventional reverse time division duplex with bandwidth splitting. \n \nIn this thesis, we developed efficient resource allocation solutions related to system power for wireless networks that incorporate large-scale MIMO systems under different assumptions and network architectures. The results in this thesis can be expanded by investigating the research problems given at the end of the dissertation.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 source (direct Gemma or distilled Codex), 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".