.png){kind=icon}
Return
Advanced Coverage Optimization Techniques for Small Cell Clusters
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2015.7224694.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Coverage optimization is a main challenge for small cell clusters which are considered to be a promising solution to provide seamless cellular coverage for large indoor or outdoor areas. This paper focuses on small cell cluster coverage problems and proposes both centralized and distributed self-optimization methods. Modified Particle swarm optimization (MPSO) is introduced to centralized optimization which employs particle swarm optimization (PSO) and introduces a heuristic power control scheme to accelerate the algorithm to search for the global optimum solution. Distributed coverage optimization is modeled as a non-cooperative game, with a utility function considering both throughput and interference. An iterative power control algorithm is then proposed using game theory (DGT) which converges to Nash Equilibrium (NE). Simulation results show that both MPSO and DGT have excellent performance in coverage optimization and outperform optimization using simulated annealing algorithm (SA), reaching higher coverage ratio and throughput while with less iterations.
Keywords:
small cell cluster
coverage optimization
particle swarm optimization
game theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K
Organization
Cited Papers
No cited papers available