Joint Power Coordination for Spectral-and-Energy Efficiency in Heterogeneous Small Cell Networks: A Bargaining Game-Theoretic Perspective
Bibliographic record
Abstract
Extensive deployment of small cells in heterogenous cellular networks introduces both challenges and opportunities. Challenges come with the reuse of the limited frequency resource for improving spectral efficiency, which always introduces serious mutual inter- and intracell interference between or among small cells and macrocells. The opportunities refer to more potential chances of inter- and intratier cooperations among small cells and macrocells. Energy efficiency will be a critical performance requirement for future green communications, especially when small cells are densely deployed to enhance the quality of user's experience. We exploit the potential cooperation diversities to combat the interference and energy management challenges. To capture the complicated interference interaction and also the possible coordination behavior among small cells and macrocells, this paper proposes a novel bargaining cooperative game (BCG) framework for energy efficient and interference-aware power coordination in a dense small cell network. In particular, a new adjustable utility function is employed in the BCG framework to jointly address both the spectral efficiency and energy efficiency issues. Using the BCG framework, we then derive the closed-form power coordination solutions and further propose a joint interference-aware power coordination scheme (Joint) with the considerations of both interference mitigation and energy saving. Moreover, a simplified algorithm (Simplified) is presented to combat the heavy signaling overhead, which is one of the significant challenges in the scenario of extensive deployment of small cells. Finally, numerical results are provided to illustrate the effectiveness of the proposed Joint and Simplified schemes.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| 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".