Elements of information theory
Elements of information theory
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Asymptotic analysis of multistage cooperative broadcast in wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the throughput scaling of wireless relay networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Fundamental limits and scaling behavior of cooperative multicasting in wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
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
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
On adaptive transmission for energy efficiency in wireless data networks
IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
On the scaling laws of dense wireless sensor networks: the data gathering channel
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
Complex Field Network Coding for Multiuser Cooperative Communications
IEEE Journal on Selected Areas in Communications
Combining queueing theory with information theory for multiaccess
IEEE Journal on Selected Areas in Communications
NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A Two-Way MIMO Relaying Scheme with Partial Channel State Information
Wireless Personal Communications: An International Journal
Hi-index | 754.84 |
A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a single source and N destinations, of which f(N) are randomly selected to also act as relays. In high-density networks (i.e., the node density goes to infinity; the network area is fixed), it is shown that the broadcast capacity is upper bounded by Θ(log f(N)). Schemes are provided that achieve i) Θ(log f(N)) throughput if the channel fading is spatially continuous; ii) Θ(log log f(N)) throughput if the channel fading is spatially i.i.d. For extended networks (i.e., the node density is fixed; the network area goes to infinity), the broadcast capacity is upper bounded by Θ(1) under channel models with fading and path-loss exponent α 2. A multistage cooperative broadcasting scheme, which achieves Θ(1) broadcast rate for the high-density extended networks with pathloss channel model is proposed. These results quantifies the gains obtained due to cooperation compared to multihop noncooperative broadcasting, which has a maximum rate that scales as Θ(1) for high-density and Θ(1/(log f(N))α,/2) for extended networks.