Practical Optimization and Game Theory for 6G Ultra-Dense Networks: Overview and Research Challenges
Bibliographic record
Abstract
Ultra-dense networks (UDNs) have been employed to solve the pressing problems in relation to the increasing demand for higher coverage and capacity of the fifth generation (5G) wireless networks. The deployment of UDNs in a very large scale has been envisioned to break the fundamental deadlocks of beyond 5G or the sixth generation (6G) networks and deliver many more orders of magnitude gains that today’s technologies achieve. However, the mathematical tool to optimize the system performance under the stringent radio resource constraints is widely recognized to be a formidable challenge. System-level performance optimization of current UDNs are usually conducted by relying on numerical simulations, which are often time-consuming and have become extremely difficult in the context of 6G with extremely high density. As such, there is an urgent need for developing a realistic mathematical model for optimizing the 6G UDNs. In this paper, we introduce challenges as well as issues that have to be thoroughly considered while deploying UDNs in realistic environment. We revisit efficient mathematical techniques including game theory and real-time optimization in the context of optimizing UDNs performance. In addition, emerging technologies which are suitable to apply in UDNs are also discussed. Some of them have already been used in UDNs with high efficiency while the others which are still under investigation are expected to boost the performance of UDNs to achieve the requirements of 6G. Importantly, for the first time, we introduce the joint optimal approach between realtime optimization and game theory (ROG) which is an effective tool to solve the optimization problems of large-scale UDNs with low complexity. Then, we describe two approaches for using ROG in UDNs. Finally, some case study of ROG are given to illustrate how to apply ROG for solving the problems of different applications in UDNs.
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.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".