Multicast ad hoc ntworks: A constructive lower bound on throughput capacity

In this paper, we construct an elementary spatial-temporal routing scheme that achieves the throughput capacity of a large ad hoc wireless network with high probability as the number of nodes increases. We consider a 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. 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.