Asymptotic throughput for large-scale wireless networks with general node density

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of ns = ω(1) and 1 ≤ nd ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where ns and nd denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$, while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$, we show that for some regimes of nd, the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.