A Hierarchical Green Mean-Field Power Control with eMBB-mMTC Coexistence in Ultradense 5G (Invited Paper)
Bibliographic record
Abstract
Smal1 cell densification is recognized as one of the most significant characteristics in the fifth-generation of communication systems (5G) and beyond. A substantial capacity boost can be achieved at a low cost by supplementing macro networks with numerous small cells to create ultra-dense heterogeneous networks, which can serve as the foundation for the next generation of services. In this paper, we investigate a model that accounts for the location and channel quality of an enhanced Mobile Broadband (eMBB) user as well as the locations, density, and energy levels of a large number of Internet of Things (IoT) devices. More specifically, the eMBB user is randomly distributed in the coverage area of the MBS, and given its channel gain, it adjusts its transmit power to achieve an acceptable Quality of Service (QoS). In contrast, the IoT devices are gathered around SBS and regulate their transmission power in accordance with their energy budget to minimize energy-efficient utility function. Due to the coupling, the Stackelberg-Nash differential game is initially used to model the power allocation problem, with the eMBB user playing the role of the leader and the IoT devices playing the role of the followers. Then, we use the mean-field approximation to construct a hierarchical mean-field game from which we can recover a set of equations that may be solved iteratively to provide the optimal power allocation strategies. Simulation results illustrate the optimal power allocation strategies and show the effectiveness of the proposed approach.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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.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".