Foundations and Trends® in Networking
Linear relaying for the Gaussian multiple-access and broadcast channels
IEEE Transactions on Wireless Communications
Achievable rates for the AWGN channel with multiple parallel relays
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Parity forwarding for multiple-relay networks
IEEE Transactions on Information Theory
The effect of noise correlation in amplify-and-forward relay networks
IEEE Transactions on Information Theory
Amplify and forward for correlated data gathering over hierarchical sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Bursty wideband relay networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Optimal schedules for the D-node half duplex phase fading MRC
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A new achievable rate for the Gaussian parallel relay channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Rate-maximizing mappings for memoryless relaying
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the diversity: multiplexing tradeoff in multiple-relay network
IEEE Transactions on Information Theory
IEEE Transactions on Communications
Traffic adaptive relaying topology control
IEEE Transactions on Wireless Communications
Impact of traffic localization on communication rates in ad-hoc networks
Wireless Networks
Source-channel communication in sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Bursty relay networks in low-SNR regimes
IEEE Transactions on Communications
Asymptotic capacity of randomly-failing relay networks with DF strategy
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
Asymptotic capacity of large fading relay networks under random attacks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Asymptotic analysis of multiuser diversity and selection diversity in multiple-relay networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimal relay function in the low-power regime for distributed estimation over a MAC
IEEE Transactions on Signal Processing
Distributed transmit beamforming using feedback control
IEEE Transactions on Information Theory
Ergodic capacity analysis of amplify-and-forward MIMO dual-hop systems
IEEE Transactions on Information Theory
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
Robust power allocation algorithms for wireless relay networks
IEEE Transactions on Communications
On the broadcast capacity of wireless networks with cooperative relays
IEEE Transactions on Information Theory
Cooperative transmission for wireless relay networks using limited feedback
IEEE Transactions on Signal Processing
A new training protocol for channel state estimation in wireless relay networks
IEEE Transactions on Signal Processing
Optimal rate region of two-hop multiple access channel via amplify-and-forward scheme
Information Theory, Combinatorics, and Search Theory
Hi-index | 755.27 |
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and lower bounds coincide in the limit as the number of relays tends to infinity. Hence, this paper provides a new example where a simple cut-set upper bound is achievable, and one more example where uncoded transmission achieves optimal performance. The findings are illustrated by geometric interpretations. The techniques developed in this paper are then applied to a sensor network situation. This is a network joint source-channel coding problem, and it is well known that the source-channel separation theorem does not extend to this case. The present paper extends this insight by providing an example where separating source from channel coding does not only lead to suboptimal performance-it leads to an exponential penalty in performance scaling behavior (as a function of the number of nodes). Finally, the techniques developed in this paper are extended to include certain models of ad hoc wireless networks, where a capacity scaling law can be established: When all nodes act purely as relays for a single source-destination pair, capacity grows with the logarithm of the number of nodes.