On the capacity of HetNets

S. V. Hanly; Philip A. Whiting

doi:10.1109/ITA.2014.6804260

On the capacity of HetNets

S. V. Hanly, Philip A. Whiting

School of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

7 Citations (Scopus)

Abstract

Heterogeneous wireless networks provide a means to increase network capacity by introducing small cells and adopting a layered architecture. These networks allocate resources flexibly through a combination of time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper we define capacity of such networks in terms of the maximum number of downloads per second which can be achieved for a given offered traffic density. In a simplified model we show that this capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then we show that there is a scheduler such that the number of mobiles in the network has ergodic properties with finite limiting moments. On the other hand if the solution is greater than 1 then we show that no such scheduler exists.

Original language	English
Title of host publication	2014 Information Theory and Applications Workshop (ITA)
Place of Publication	Piscataway, N.J.
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1-9
Number of pages	9
ISBN (Electronic)	9781479935895
ISBN (Print)	9781479935901
DOIs	https://doi.org/10.1109/ITA.2014.6804260
Publication status	Published - 2014
Event	2014 IEEE Information Theory and Applications Workshop, ITA - 2014 - San Diego, United States Duration: 9 Feb 2014 → 14 Feb 2014

Other

Other	2014 IEEE Information Theory and Applications Workshop, ITA - 2014
Country/Territory	United States
City	San Diego
Period	9/02/14 → 14/02/14

Access to Document

10.1109/ITA.2014.6804260

Cite this

@inproceedings{194d045c40704876afb255a91209f6b1,

title = "On the capacity of HetNets",

abstract = "Heterogeneous wireless networks provide a means to increase network capacity by introducing small cells and adopting a layered architecture. These networks allocate resources flexibly through a combination of time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper we define capacity of such networks in terms of the maximum number of downloads per second which can be achieved for a given offered traffic density. In a simplified model we show that this capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then we show that there is a scheduler such that the number of mobiles in the network has ergodic properties with finite limiting moments. On the other hand if the solution is greater than 1 then we show that no such scheduler exists.",

author = "Hanly, \{S. V.\} and Whiting, \{Philip A.\}",

year = "2014",

doi = "10.1109/ITA.2014.6804260",

language = "English",

isbn = "9781479935901",

pages = "1--9",

booktitle = "2014 Information Theory and Applications Workshop (ITA)",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2014 IEEE Information Theory and Applications Workshop, ITA - 2014 ; Conference date: 09-02-2014 Through 14-02-2014",

}

TY - GEN

T1 - On the capacity of HetNets

AU - Hanly, S. V.

AU - Whiting, Philip A.

PY - 2014

Y1 - 2014

N2 - Heterogeneous wireless networks provide a means to increase network capacity by introducing small cells and adopting a layered architecture. These networks allocate resources flexibly through a combination of time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper we define capacity of such networks in terms of the maximum number of downloads per second which can be achieved for a given offered traffic density. In a simplified model we show that this capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then we show that there is a scheduler such that the number of mobiles in the network has ergodic properties with finite limiting moments. On the other hand if the solution is greater than 1 then we show that no such scheduler exists.

AB - Heterogeneous wireless networks provide a means to increase network capacity by introducing small cells and adopting a layered architecture. These networks allocate resources flexibly through a combination of time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper we define capacity of such networks in terms of the maximum number of downloads per second which can be achieved for a given offered traffic density. In a simplified model we show that this capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then we show that there is a scheduler such that the number of mobiles in the network has ergodic properties with finite limiting moments. On the other hand if the solution is greater than 1 then we show that no such scheduler exists.

UR - https://www.scopus.com/pages/publications/84901236317

U2 - 10.1109/ITA.2014.6804260

DO - 10.1109/ITA.2014.6804260

M3 - Conference proceeding contribution

AN - SCOPUS:84901236317

SN - 9781479935901

SP - 1

EP - 9

BT - 2014 Information Theory and Applications Workshop (ITA)

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, N.J.

T2 - 2014 IEEE Information Theory and Applications Workshop, ITA - 2014

Y2 - 9 February 2014 through 14 February 2014

ER -

On the capacity of HetNets

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this