Optimized Energy Harvesting in Cell-Free Massive MIMO Using Markov Process Evolution
Bibliographic record
Abstract
This paper investigates a discrete energy state transition model for energy harvesting (EH) in cell-free massive multiple-input-multiple-output (CF-mMIMO) networks. A Markov chain-based stochastic process is conceived to characterize the temporal evolution of the user equipment (UE) energy level by leveraging state transition probabilities (STP) based on the energy differential (E) between the EH and consumed energy within each coherence interval. Tractable mathematical relationships are derived for the STP cases using a new stochastic model of non-linear EH, approximated using a Gamma distribution. This derivation leverages closed-form expressions for the mean and variance of the harvested energy. To improve the positive STP of the minimum energy UE among all network UEs, we aim to maximize the E for this UE using two power allocation (PA) schemes. The first scheme is a heuristic PA using the relative channel characteristics to this UE from all access points (APs). The second scheme is the optimized PA based on the solution of a second-order conic problem to maximize the E using a responsive primal-dual interior point method (PD-IPM) algorithm with modified backtracking line-search, iterating over multiple PA periods. Our simulation results illustrate that both the proposed PA schemes enhance the dynamic minimum UE energy level by around four-fold over full power control, along with the performance improvement attributed to spatial resource diversification of CF-mMIMO systems.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".