View article

We present capacity and delay scaling laws for random wireless ad hoc networks under all information dissemination modalities (unicast, multicast, broadcast and anycast) when nodes are endowed with multi-packet reception (MPR) capabilities. Information dissemination modalities are modeled with an (n, m, k)-cast formulation, where n, m, and k denote the number of nodes in the network, the number of destinations for each communication group, and the actual number of communication group members that receives the information (i. e., k ≤ m ≤ n), respectively. We show that Θ(R(n)\√m/k), Θ(1/k), and Θ(R ² (n)) bits per second constitute a tight bound for the throughput capacity of random wireless ad hoc networks under the protocol model when m = O(R ^-2 (n)), Ω(k) = R ^-2 (n)= O(m), and k = Ω(R ^-2 (n)), respectively. R(n) denotes the receiver range which depends on the decoding complexity of the nodes. For …