Capacity and stable scheduling in heterogeneous wireless networks

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Heterogeneous wireless networks (HetNets) provide a means to increase network capacity by introducing small cells and adopting a layered architecture. HetNets allocate resources flexibly through time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper, we define the capacity of a HetNet down link in terms of the maximum number of downloads per second, which can be achieved for a given offered traffic density. Given this definition we show that the capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then there is a scheduler such that the number of mobiles in the network has ergodic properties with finite mean waiting time. If the solution is greater than 1 then no such scheduler exists. These results have clear implications for network planning. The above results continue to hold if a more general class of schedulers is considered.

LanguageEnglish
Pages1266-1279
Number of pages14
JournalIEEE Journal on Selected Areas in Communications
Volume33
Issue number6
DOIs
Publication statusPublished - 1 Jun 2015

Fingerprint

Heterogeneous networks
Wireless networks
Scheduling
Planning

Cite this

@article{a608212582b146719cffb446b6ac2ee6,
title = "Capacity and stable scheduling in heterogeneous wireless networks",
abstract = "Heterogeneous wireless networks (HetNets) provide a means to increase network capacity by introducing small cells and adopting a layered architecture. HetNets allocate resources flexibly through time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper, we define the capacity of a HetNet down link in terms of the maximum number of downloads per second, which can be achieved for a given offered traffic density. Given this definition we show that the capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then there is a scheduler such that the number of mobiles in the network has ergodic properties with finite mean waiting time. If the solution is greater than 1 then no such scheduler exists. These results have clear implications for network planning. The above results continue to hold if a more general class of schedulers is considered.",
author = "Hanly, {Stephen V.} and Chunshan Liu and Philip Whiting",
year = "2015",
month = "6",
day = "1",
doi = "10.1109/JSAC.2015.2416971",
language = "English",
volume = "33",
pages = "1266--1279",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
number = "6",

}

Capacity and stable scheduling in heterogeneous wireless networks. / Hanly, Stephen V.; Liu, Chunshan; Whiting, Philip.

In: IEEE Journal on Selected Areas in Communications, Vol. 33, No. 6, 01.06.2015, p. 1266-1279.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Capacity and stable scheduling in heterogeneous wireless networks

AU - Hanly, Stephen V.

AU - Liu, Chunshan

AU - Whiting, Philip

PY - 2015/6/1

Y1 - 2015/6/1

N2 - Heterogeneous wireless networks (HetNets) provide a means to increase network capacity by introducing small cells and adopting a layered architecture. HetNets allocate resources flexibly through time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper, we define the capacity of a HetNet down link in terms of the maximum number of downloads per second, which can be achieved for a given offered traffic density. Given this definition we show that the capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then there is a scheduler such that the number of mobiles in the network has ergodic properties with finite mean waiting time. If the solution is greater than 1 then no such scheduler exists. These results have clear implications for network planning. The above results continue to hold if a more general class of schedulers is considered.

AB - Heterogeneous wireless networks (HetNets) provide a means to increase network capacity by introducing small cells and adopting a layered architecture. HetNets allocate resources flexibly through time sharing and cell range expansion/contraction allowing a wide range of possible schedulers. In this paper, we define the capacity of a HetNet down link in terms of the maximum number of downloads per second, which can be achieved for a given offered traffic density. Given this definition we show that the capacity is determined via the solution to a continuous linear program (LP). If the solution is smaller than 1 then there is a scheduler such that the number of mobiles in the network has ergodic properties with finite mean waiting time. If the solution is greater than 1 then no such scheduler exists. These results have clear implications for network planning. The above results continue to hold if a more general class of schedulers is considered.

UR - http://www.scopus.com/inward/record.url?scp=84930227122&partnerID=8YFLogxK

UR - http://purl.org/au-research/grants/arc/DP130101760

U2 - 10.1109/JSAC.2015.2416971

DO - 10.1109/JSAC.2015.2416971

M3 - Article

VL - 33

SP - 1266

EP - 1279

JO - IEEE Journal on Selected Areas in Communications

T2 - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 6

ER -