Achievable Rates and Scaling Laws of Power-Constrained Wireless Sensory Relay Networks

Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ
IEEE Transactions on Information Theory (Impact Factor: 2.65). 10/2006; DOI: 10.1109/TIT.2006.880029
Source: IEEE Xplore

ABSTRACT A wireless sensory relay network consists of one source node, one destination node and multiple intermediate relay nodes. In this paper, we study the achievable rates and the scaling laws of power-constrained wireless relay networks in the wideband regime, assuming that relay nodes have no a priori knowledge of channel-state information (CSI) for both the backward channels and the forward channels. We examine the achievable rates in the joint asymptotic regime of the number of relay nodes n, the channel coherence interval L, and the bandwidth W (or the SNR per link rho). We first study narrowband relay networks in the low SNR regime. We investigate a relaying scheme, namely amplify-and-forward (AF) with network training, in which the source node and the destination node broadcast training symbols and each relay node carries out channel estimation and then applies AF relaying to relay information. We provide an equivalent source-to-destination channel model, and characterize the corresponding achievable rate. Our findings show that when rhoL, proportional to the transmission energy in each fading block, is bounded below, the achievable rate has the same scaling order as in coherent relaying, thus enabling us to characterize the scaling law of the relay networks in the low SNR regime. We then generalize the study to power-constrained wideband relay networks, where frequency-selective fading is taken into account. Again, the focus is on the achievable rates by using AF with network training for information relaying. In particular, we examine the scaling behavior of the achievable rates corresponding to two power allocation policies across the frequency subbands at relay nodes, namely, a simple equal power allocation policy and the optimal power allocation policy. We identify the conditions under which the scaling law of the wideband relay networks can be achieved by both power allocation policies. Somewhat surprising, our findings indicate that these two power allocati-
on policies result in achievable rates of the same scaling order, and the scaling law can be characterized under the condition that L/W, proportional to the energy per fading block per subband, is bounded below, and that W is sublinear in n

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this deliverable, we analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K single-antenna relays using half-duplex two-hop relaying. We assume that relays have channel state information (CSI), perform matched-filtering, and the destination terminals cannot cooperate. The main contributions of the report are: * We consider two different protocols, P1 introduced (for the finite-M case) in [14] and P2 introduced in [13]. P1 relies on the idea of relay partitioning and requires each relay terminal to know one backward (source to relay) and one forward (relay to destination) fading coefficient only. P2 does not use relay partitioning and requires each relay terminal to know all M backward and all M forward fading coefficients. We prove that in the large-M limit, provided the number of relay terminals grows fast enough as a function of M, under both protocols, the network "decouples" in the sense that the individual source-destination terminal pair capacities are strictly positive. The corresponding minimum rates of growth are shown to be K=M^3 for P1 and K=M^2 for P2. The protocols P1 and P2 are thus found to trade off CSI at the relays for the required (for the network to decouple) rate of growth of relays. * We show that the growth rates K=M^3 for P1 and K=M^2 for P2 are sufficient to not only make the network decouple, but to also lead to the individual source-destination fading links converge to nonfading links. We say that the network "crystallizes" as it breaks up into a set of isolated "wires in the air". A large-deviations analysis is performed to characterize the "crystallization" rate, i.e., the rate (as a function of M, K) at which the decoupled links converge to nonfading links. In the course of this analysis, we develop a new technique for characterizing the large-deviations behavior of certain sums of dependent random variables. * For P1 and P2, we establish the impact of cooperation at the relay level on network capacity scaling. More specifically, it is shown that, asymptotically in M and K, cooperation in groups of L relays (which can also be interpreted as having multi-antenna relays in MEMBRANE settings) leads to an L-fold reduction in the total number of relays needed to achieve a given per source-destination terminal pair capacity.
  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the implementation of distributed antenna systems (DASs), the antenna elements in some cases may only be deployed in the form of distributed antenna-clusters (ACs), due to various practical limitations. Consequently, correlation usually exists among the antenna elements within each AC. In contrast to most of the previous work that focused on the antenna correlation in a single-cell environment, this paper investigates the impact of the antenna correlation in a more general multi-cell scenario, where the inter-cell interference becomes the key challenge. We formulate a joint multi-cell input covariance optimization problem, accounting for the transmit antenna correlation, the propagation path-loss and the shadow fading. We show that the problem is a complicated non-convex problem. Moreover, the objective function, i.e., the ergodic sum capacity, is found difficult to be expressed in a straightforward form. After mathematical simplification, we propose an iterative inter-cell coordination scheme by adopting the successive approximation method. Simulation results demonstrate that, thanks to much more effective adaptation to the antenna correlation, the proposed scheme outperforms the existing ones and can significantly improve the system performance of a DAS with highly-correlated ACs.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014


Available from