Multicast capacity of wireless ad hoc networks with hierarchical routing

The focus of this paper is on presenting new results on throughput capacity of wireless ad hoc networks with multicast traffic. In seminal works, Gupta and Kumar introduced a new line of research. It is about the asymptotic throughput capacity of dense wireless ad hoc networks as a function of the number of nodes in the network. In this paper, we present an upper bound on the throughput capacity of an ad hoc network with multicast traffic using a hierarchical routing strategy. We start first by generating the upper bound and the strategy gain for the 2-level hierarchical strategy. Then, we generalize the result for multi-level hierarchical routing by giving the recurrence expression of the multicast gain. Finally, we apply the basic result to a broadcast traffic in the network.