AN OVERVIEW OF LOAD BALANCING IN HETNETS: OLD MYTHS AND OPEN PROBLEMS

被引：391

作者：

Andrews, Jeffrey G. ^{[1
]}

Singh, Sarabjot ^{[1
]}

Ye, Qiaoyang ^{[1
]}

Lin, Xingqin ^{[1
]}

Dhillon, Harpreet S. ^{[1
]}

机构：

[1] Univ Texas Austin, Austin, TX 78712 USA

来源：

IEEE WIRELESS COMMUNICATIONS | 2014年 / 21卷 / 02期

基金：

美国国家科学基金会;

关键词：

Mobile telecommunication systems - Markov processes - Frequency division multiple access - Wireless networks - Decision theory - Game theory;

D O I：

10.1109/MWC.2014.6812287

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

080201 [机械制造及其自动化];

摘要：

Matching the demand for resources ("load") with the supply of resources ("capacity") is a basic problem occurring across many fields of engineering, logistics, and economics, and has been considered extensively in both the Internet and wireless networks. The ongoing evolution of cellular communication networks into dense, organic, and irregular heterogeneous networks (HetNets) has elevated load awareness to a central problem, and introduces many new subtleties. This article explains how several long-standing assumptions about cellular networks need to be rethought in the context of a load-balanced HetNet: we highlight these as three deeply entrenched myths that we then dispel. We survey and compare the primary technical approaches to HetNet load balancing: (centralized) optimization, game theory, Markov decision processes, and the newly popular cell range expansion (a.k.a. biasing), and draw design lessons for OFDMA-based cellular systems. We also identify several open areas for future exploration.

引用

页码：18 / 25

页数：8

共 15 条

[1]

3GPP, 23402 3GPP

[2]

Andrews J. G., 2011, U NOTR DAM WIR I SEM

[3]

[Anonymous], 2010 P IEEE INFOCOM

[4]

Aryafar E., 2013, P IEEE INFOCOM