Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 9th annual international conference on Mobile computing and networking
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Capacity of multi-channel wireless networks with random (c, f) assignment
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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 = ∅(min(nr2=a2 log n)) channels of equal bandwidth W/C available. We consider a random (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 capacity is Θ(W√Prnd/n log n ⋅ 1/√k) when k = ∅(Prnd⋅n/log n), where Prnd denotes the probability that two nodes share at least one channel. Our bounds unify the previous capacity bounds on unicast (when k = 2) by Bhandari and Vaidya [3] for multi-channel multi-radio networks.