Convex Optimization
Fundamentals of wireless communication
Fundamentals of wireless communication
Achievable rates for the AWGN channel with multiple parallel relays
IEEE Transactions on Wireless Communications
Asymptotic capacity of large fading relay networks under random attacks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Capacity scaling laws in MIMO relay networks
IEEE Transactions on Wireless Communications
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
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
IEEE Transactions on Information Theory
Outage Capacity of the Fading Relay Channel in the Low-SNR Regime
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper, we investigate the asymptotic capacity of a half-duplex large fading relay network, which consists of one source node, one destination node, and N relay nodes. The relay nodes are assumed to be randomly deployed in a given area and subject to independent random failures (e.g., due to fatal random physical attacks) with probability p. With a total power constraint on all the nodes, we examine the performance of the decode-and-forward (DF) strategy when N tends to infinity, assuming zero or perfect forward link channel state information (CSI) at the relays, respectively. For the noncoherent relay scheme, we study the ε-outage capacity. The multiple access (MAC) cut-set upper bound and the achievable rate (i.e, the lower bound) are derived with the optimal power allocation between the source and relays. It is proved that the DF strategy is asymptotically optimal as the outage probability goes to zero. Given the random attacks, it is shown that there is less than a p-fraction achievable rate loss in the low SNR regime and a constant loss in the high SNR regime. For the coherent relay scheme, we study the ergodic capacity. It is shown that the capacity upper bound scales as O(log (SNRN)), while the DF achievable rate scales as O(log (SNR log(N))). Finally, we discuss the optimal power allocation strategy among the relays.