Cooperative Transmission in a Wireless Cluster Based on Flow Management

In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channel information is available at the nodes. The proposed design involves solving a convex flow optimization problem on a fully connected graph that models the cluster network. A much simpler generalized routing protocol based on the above design is also presented. Both the proposed flow-optimized protocol and the generalized routing protocol are shown to achieve the optimal diversity-multiplexing tradeoff for the cluster network. Moreover, simulation results are presented to quantify the gap between the performance of the proposed protocols and that of a max-flow-min-cut type bound, in terms of outage probability.

[2]  Tat-Ming Lok,et al.  Flow-optimized Cooperative Transmission for the Relay Channel , 2007, ArXiv.

[3]  Sanjeev R. Kulkarni,et al.  Degraded Gaussian multirelay channel: capacity and optimal power allocation , 2004, IEEE Transactions on Information Theory.

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

[5]  Mehul Motani,et al.  The Capacity of the Single Source Multiple Relay Single Destination Mesh Network , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  Jian L. Zhou,et al.  User's Guide for CFSQP Version 2.0: A C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints , 1994 .

[7]  Deniz Gündüz,et al.  Opportunistic cooperation by dynamic resource allocation , 2007, IEEE Transactions on Wireless Communications.

[8]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

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

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

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Elza Erkip,et al.  Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective , 2006, IEEE Transactions on Information Theory.

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

[14]  David Tse,et al.  Outage Capacity of the Fading Relay Channel in the Low-SNR Regime , 2006, IEEE Transactions on Information Theory.

[15]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[16]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[17]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

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

[19]  Mehul Motani,et al.  Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward , 2007, 2007 IEEE International Symposium on Information Theory.

[20]  Aggelos Bletsas,et al.  A simple Cooperative diversity method based on network path selection , 2005, IEEE Journal on Selected Areas in Communications.

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

[22]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[23]  Tat-Ming Lok,et al.  Flow optimization in parallel relay networks with cooperative relaying , 2009, IEEE Transactions on Wireless Communications.