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

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 |