An achievable capacity for hierarchical multicast ad hoc networks

In this paper, we consider a dense ad hoc network with multicast type of traffic handling using a hierarchical routing with clustering. We investigate the scaling of throughput capacity versus the number of nodes and destinations. We construct an elementary spatial-temporal routing scheme that achieves the throughput capacity of a dense ad hoc wireless network with high probability as the number of nodes increases. The derived lower bound on the throughput capacity under the proposed routing strategy holds with probability one as the number of nodes goes to infinity. Finally, we provide numerical validation of the achievable throughput using a multicast capacity simulator based on the proposed constructive scheme.