### 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.

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 | |

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 | United States |

City | San Diego |

Period | 9/02/14 → 14/02/14 |

### Fingerprint

### Cite this

*2014 Information Theory and Applications Workshop (ITA)*(pp. 1-9). [6804260] Piscataway, N.J.: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ITA.2014.6804260

}

*2014 Information Theory and Applications Workshop (ITA).*, 6804260, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, N.J., pp. 1-9, 2014 IEEE Information Theory and Applications Workshop, ITA - 2014, San Diego, United States, 9/02/14. https://doi.org/10.1109/ITA.2014.6804260

**On the capacity of HetNets.** / Hanly, S. V.; Whiting, Philip A.

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

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 - http://www.scopus.com/inward/record.url?scp=84901236317&partnerID=8YFLogxK

U2 - 10.1109/ITA.2014.6804260

DO - 10.1109/ITA.2014.6804260

M3 - Conference proceeding contribution

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.

ER -