Elements of information theory
Elements of information theory
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
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Multicast throughput for large scale cognitive networks
Wireless Networks
Hi-index | 0.00 |
We mainly study the achievable multicast throughput (AMT) for homogeneous wireless ad hoc networks under Gaussian Channel model. We focus on two typical random networks, i.e., random extended networks (REN) and random dense networks (RDN). In REN and RDN, n nodes are randomly distributed in the square region with side-length √n and 1, respectively. We randomly choose ns nodes as the sources of multicast sessions, and for each source v, we pick uniformly at random nd nodes as the destinations. We propose multicast schemes without using percolation theory, and analyze the achievable multicast throughput by taking account of all possible values of ns and nd. As a special case of our results, we show that for ns = Θ(n), the per-session AMT for RDN is Ω(1/√nd n log n) when nd = O(n/log n) and is Ω(1/n) when nd = Ω(n/log n); the per-session AMT for REN is Ω(1/√nd n ċ (log n)1-α/2) when nd = O(n/log n) and is Ω(1/nd ċ (log n)-α/2) when nd = Ω(n/log n), where α 2 denotes the power attenuation exponent.