PROJECT TITLE :

Capacity and Stable Scheduling in Heterogeneous Wireless Networks

ABSTRACT:

Heterogeneous wireless networks (HetNets) give a means that to increase network capability by introducing small cells and adopting a layered design. HetNets allocate resources flexibly through time sharing and cell range growth/contraction permitting a wide range of possible schedulers. In this paper, we outline the capacity of a HetNet down link in terms of the maximum number of downloads per second, that 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 answer is smaller than 1 then there is a scheduler such that the number of mobiles within the network has ergodic properties with finite mean waiting time. If the solution is greater than one then no such scheduler exists. These results have clear implications for network coming up with. The on top of results continue to hold if a additional general class of schedulers is taken into account.