Bibliographic record
Abstract
In the realm of wireless communications, geographically distributing the serving antennas is pivotal to harness the full potential of multiple-input multiple-output (MIMO) technology. By strategically positioning the network's transmitters, herein called access points (APs), in close proximity to users, we strengthen the desired signal while capitalizing on macro diversity and cooperation. Numerous architectures have been proposed for distributing the antennas and setting cooperation. Herein, we focus on the emerging network scheme called the user-centric cell-free massive MIMO (UC-mMIMO) network. In the first part of this thesis, we consider the problem of placing the APs through a wireless fronthaul. We analyze two possible MIMO fronthaul solutions: multicast and zero-forcing beamforming. Using these solutions, we develop a statistical model that maximizes the achievable rate on the access channel while respecting a fronthaul outage constraint. In this part, we focus on a cell-centric clustering scheme. In the second part, we handle the problem of user-scheduling and beamforming in the UC-mMIMO scheme. We propose two different paradigms for resource allocation. The first is centralized resource allocation scheme where user-scheduling and beamforming are performed at a central unit (CU) located at the network core. The second is distributed or decentralized resource allocation with two variants of decentralization; which we denote as the AP-distributed system and the CU-distributed system. In the third part, we study the management of handoffs (HOs) within the UC-mMIMO network scheme. Due to the user-centric clustering and the dense deployment of the APs, a moving user may frequently encounter HOs, where HOs entail the addition/removal of APs to/from the serving set of the user. This potentially could affect the system performance. We propose two distinct methodologies for the management of HOs within the UC-mMIMO context. The first approach involves modeling HOs as a partially observable Markov decision process (POMDP), where we adopt a divide-and-conquer approach to obtain a HO policy using the value iteration algorithm. While the second approach harnesses the power of reinforcement learning, where we use deep reinforcement learning (DRL) to construct a deep neural network (DNN)-based HO policy that exhibits real-time control and low computational complexity.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 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".