Elements of information theory
Elements of information theory
Cooperative diversity in wireless networks: algorithms and architectures
Cooperative diversity in wireless networks: algorithms and architectures
Distributed antenna channels with regenerative relaying: relay selection and asymptotic capacity
EURASIP Journal on Wireless Communications and Networking
Distributed compression for MIMO coordinated networks with a backhaul constraint
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
The Wyner-Ziv problem with multiple sources
IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Capacity bounds for Cooperative diversity
IEEE Transactions on Information Theory
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
IEEE Transactions on Information Theory
Distributed cooperation among cognitive radios with complete and incomplete information
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
Asymptotic capacity of randomly-failing relay networks with DF strategy
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Hi-index | 0.01 |
Relaying is a key technology to increase capacity in wireless networks. In this paper, the point-to-point AWGN channel with N parallel relays and time-invariant, frequency-flat fading is studied. For it, we derive achievable rates with four coding techniques, namely: decode-and-forward, partial decode-and-forward, compress-and-forward and linear relaying. The first two are based on signal regeneration at the relay nodes and aim at mimicking a transmit antenna array. We study their scaling law for N → ∞ and Rayleigh fading, and show that is lower than log2 log (N) due to the source-relays broadcast limitation. In turn, compress-and-forward aims at mimicking a receive antenna array and consists of relay nodes distributedly compressing their signals and transmitting them to destination. We provide its achievable rate considering distributed Wyner-Ziv compression at the relays, and show that it also scales as log2 log (N); in this case, due to the relays-destination MAC limitation. Finally, linear relaying is the extension of amplify-and-forward to full-duplex operation. For it we derive the optimum transmitted signal at the source and propose suboptimum linear relaying functions at the relays. All techniques are compared with the max-flow-min-cut upper bound, evaluated for AWGN channels.