Multicast Capacity of Wireless Ad Hoc Networks
Xiang‐Yang Li · IEEE/ACM Transactions on Networking · 2008
Assume thatnwireless nodes are uniformly randomly deployed in a square region with side-lengthaand all nodes have the uniform transmission rangerand uniform interference rangeR>r. We further assume that each wireless node can transmit (or receive) atWbits/second over acommonwireless channel. For each nodevi, werandomlyandindependentlypickk-1 pointspi,j(1 lesjlesk-1) from the square, and then multicast data to the nearest node for eachpi,j. We derive matching asymptotic upper bounds and lower bounds on multicast capacity of random wireless networks. Under protocol interference model, whena2/r2=O(n/log(n)), we show that the total multicast capacity is Theta(radic{n/logn}middot(W/radick)) whenk=O(n/logn); the total multicast capacity is Theta(W) whenk=Omega(n/logn). We also study the capacity of group-multicast for wireless networks where for each source node, we randomly selectk-1 groups of nodes as receivers and the nodes in each group are within a constant hops from the group leader. The same asymptotic upper bounds and lower bounds still hold. We also extend our capacity bounds tod-dimensional networks.