Skip to Main Content
We investigate the scaling law of throughput capacity of hybrid networks with non-trivial node mobility. By non-trivial mobility, we mean it is strong enough to improve capacity. A general model with heterogeneous nodes and spatial inhomogeneities is adopted. We show in a network, whose physical extension grows at f(n), with n users and k base stations, the per-node capacity is Â¿(1/f(n)) + Â¿(k/n). We also propose optimal schedule policy and routing scheme to achieve capacity.