Details

Autor(en) / Beteiligte

• Liang Huang
• Yiqing Zhou
• Xue Han
• Yuanyuan Wang
• Manli Qian
• Jinglin Shi

Titel

Distributed coverage optimization for small cell clusters using game theory

Ist Teil von

• 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013, p.2289-2293

Ort / Verlag

IEEE

Erscheinungsjahr

2013

Quelle

IEEE Electronic Library Online

Beschreibungen/Notizen

• Small cell cluster is a new paradigm to extend the usage of small cells from residential environment to large indoor or outdoor areas. However, coverage optimization is a challenge due to the ad-hoc deployment and plug-and-play feature of small cells. This paper considers decentralized self-optimization network (SON) architecture of small cell cluster and proposes distributed coverage optimization algorithm using game theory (DGT). A non-cooperate game is modeled to tune the Tx power of each small cell with a net utility function considering both gain of throughput and punishment of interference. Nash Equilibrium (NE) is proved to be existed in the game and a power update scheme is proposed which converges to the NE. Simulation results show that DGT can significantly improve throughput as well as coverage ratio with only several iterations. Compared with centralized algorithm such as modified particle swarm optimization (MPSO) and simulated annealing (SA), DGT algorithm reaches higher network throughput, uses less iteration and keeps considerable coverage ratio.