Skip to Main Content
We study the broadcast throughput capacity of random wireless ad hoc networks when the nodes are endowed with multipacket reception (MPR) capability. We show that, in such networks, a per-node throughput capacity of Theta(R2(n)) bits per second can be achieved as a tight bound (i.e., upper and lower bounds) for broadcast communication, where R(n) is the receiver range that depends on the complexity of the nodes. Compared to ad hoc networks in which receivers decode at most one transmission at a time, the minimum capacity gain of MPR-based networks is Theta(logn). This is attained when the minimum value for R(n) is used, which equals the minimum transmission range needed to guarantee connectivity in the network (r(n) = Theta(radiclogn/n)).