Bandwidth and Power Allocation for Cooperative Strategies in Gaussian Relay Networks

Achievable rates with amplify-and-forward (AF) and decode-and-forward (DF) cooperative strategies are examined for relay networks. Motivated by sensor network applications, power-constrained networks with large bandwidth resources and a large number of nodes are considered. It is shown that AF strategies do not necessarily benefit from the available bandwidth. Rather, transmitting in the optimum AF bandwidth allows the network to operate in the linear regime where the achieved rate increases linearly with the available network power. The optimum power allocation among the AF relays, shown to be a form of maximal ratio combining, indicates the favorable relay positions. Orthogonal node transmissions are also examined. While the same optimum bandwidth result still holds, the relay power allocation in this case can be viewed as a form of water-filling. In contrast, the DF strategy will optimally operate in the wideband regime and is shown to require a different choice of relays. Thus, in a large scale network, the choice of a coding strategy goes beyond determining a coding scheme at a node; it also determines the operating bandwidth, as well as the set of relays and best distribution of the relay power.

[1]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[2]  Babak Hassibi,et al.  On the power efficiency of sensory and ad hoc wireless networks , 2003, IEEE Transactions on Information Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Brett Schein,et al.  Distributed coordination in network information theory , 2001 .

[5]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[6]  R. Adve,et al.  On Selection Cooperation in Distributed Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[7]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[8]  Roy D. Yates,et al.  Forwarding strategies for Gaussian parallel-relay networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  M. Vetterli,et al.  On the asymptotic capacity of Gaussian relay networks , 2002, Proceedings IEEE International Symposium on Information Theory,.

[10]  G. Kramer Capacity Theorems for Wireless Relay Channels , .

[11]  Joy A. Thomas,et al.  Feedback can at most double Gaussian multiple access channel capacity , 1987, IEEE Trans. Inf. Theory.

[12]  L.J. Cimini,et al.  Link-failure probabilities for practical cooperative relay networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[13]  Roy D. Yates,et al.  Bandwidth and power allocation for cooperative strategies in Gaussian relay networks , 2004 .

[14]  Michael Gastpar,et al.  The multiple-relay channel: coding and antenna-clustering capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[15]  Sergio Verdú,et al.  Spectral efficiency in the wideband regime , 2002, IEEE Trans. Inf. Theory.

[16]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[17]  Giuseppe Caire,et al.  Suboptimality of TDMA in the low-power regime , 2004, IEEE Transactions on Information Theory.

[18]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[19]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[20]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[21]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.