Multicast capacity for multi-hop multi-channel multi-radio wireless networks
Shaojie Tang, Xiang‐Yang Li, Cheng Wang, Ping Xu · 2009
Assume that n wireless nodes are randomly deployed in a square region with side-length a and all nodes have the uniform transmission range r and uniform interference range R = Θ(r). Each node is equipped with φ interfaces. There are C = O(min(nr 2 /a 2, log n)) channels of equal bandwidth W available. We consider a random C (C, g) channel assignment where each node may switch between a preassigned random subset of g channels (with g ≥ φ). In this paper, we study the multicast capacity of such a random wireless network, where for each node vi, we randomly pick k − 1 nodes from the other n−1 nodes as the receivers of the multicast session rooted at node vi. We derive matching asymptotic upper bounds and lower bounds on multicast capacity. We show that the per-flow multicast