On the capacity of HetNets

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

6 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 languageEnglish
Title of host publication2014 Information Theory and Applications Workshop (ITA)
Place of PublicationPiscataway, N.J.
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-9
Number of pages9
ISBN (Electronic)9781479935895
ISBN (Print)9781479935901
DOIs
Publication statusPublished - 2014
Event2014 IEEE Information Theory and Applications Workshop, ITA - 2014 - San Diego, United States
Duration: 9 Feb 201414 Feb 2014

Other

Other2014 IEEE Information Theory and Applications Workshop, ITA - 2014
CountryUnited States
CitySan Diego
Period9/02/1414/02/14

Fingerprint Dive into the research topics of 'On the capacity of HetNets'. Together they form a unique fingerprint.

Cite this