Convex Optimization
Fundamentals of wireless communication
Fundamentals of wireless communication
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
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
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 |
In this paper, we investigate the asymptotic ε-outage 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 under fatal independent random attacks with probability p. With a total power constraint on all the nodes, we examine the ε-outage rate of the amplify-and-forward (AF) strategy when N tends to infinity, assuming no channel state information at the relays. We further quantify the gap between the ε-outage rate and the ε-outage cut-set bound, which is determined by the attack probability p, the source vs. sum power allocation factor α, and the topology of the networks. Moreover, we examine the effect of random attacks on the ε-outage rate, and calculate the relative losses in low and high SNR regimes, respectively. Finally, for general SNR, we show that it is a quasiconcave problem to determine the optimal power allocation between the source and the relays, and we could obtain the optimal α efficiently.