Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Fundamentals of wireless communication
Fundamentals of wireless communication
The capacity of wireless networks
IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
On the duality of Gaussian multiple-access and broadcast channels
IEEE Transactions on Information Theory
On the capacity of MIMO broadcast channels with partial side information
IEEE Transactions on Information Theory
Communication over a wireless network with random connections
IEEE Transactions on Information Theory
On the power efficiency of sensory and ad hoc wireless networks
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
Crystallization in Large Wireless Networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Capacity of ad hoc wireless networks with infrastructure support
IEEE Journal on Selected Areas in Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Throughput scaling of wireless networks with random connections
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Throughput scaling of wireless networks with random connections
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
Relay networks having n source-to-destination pairs and m half-duplex relays, all operating in the same frequency band and in the presence of block fading, are analyzed. This setup has attracted significant attention, and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed that alleviates these limitations, without sacrificing the system throughput scaling in the regime of large n. The scheme entails a two-hop communication protocol, in which sources communicate with destinations only through half-duplex relays. All nodes operate in a completely distributed fashion, with no cooperation. The key idea is to schedule at each hop only a subset of nodes that can benefit from multiuser diversity. To select the source and destination nodes for each hop, CSI is required at receivers (relays for the first hop, and destination nodes for the second hop), and an index-valued CSI feedback at the transmitters. For the case when n is large and m is fixed, it is shown that the proposed scheme achieves a system throughput of m/2 bits/s/Hz. In contrast, the information-theoretic upper bound of (m/2) log log n bits/s/Hz is achievable only with more demanding CSI assumptions and cooperation between the relays. Furthermore, it is shown that, under the condition that the product of block duration and system bandwidth scales faster than n log log n, the achievable throughput of the proposed scheme scales as Θ(log n). Notably, this is proven to be the optimal throughput scaling even if centralized scheduling is allowed, thus proving the optimality of the proposed scheme in the scaling law sense. Simulation results indicate a rather fast convergence to the asymptotic limits with the system's size, demonstrating the practical importance of the scaling results.