Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems

Selection cooperation is proposed for rateless coded relaying by developing a novel low-complexity protocol that exploits all source-destination, source-relay, and relay-destination link qualities for relay selection. The source or any decoding relay having a link to the destination with a gain greater than a preset threshold is a candidate for collaboration. When the number of candidates reaches a preset value, the best of them is selected for passing the source data to the destination. The source and relays are informed of the selected node by a broadcast feedback from the destination. Limited feedback is required only between the destination and the other nodes and merely for declaring success in decoding or selecting the next transmitting node. The system power and complexity are independent of the system parameters. Also, the system dispenses with internode synchronization at carrier or symbol levels, multireception combining, multiaccess interference, and multiuser detection. Assuming independent fading on different links, a general performance analysis of the new system is presented valid for any individual link fading model. It is shown through numerical results that the novel scheme is considerably more energy efficient, for diverse input conditions, than a more complex commensurate scheme previously proposed. Also, the energy efficiency is enhanced as the number of relays increases, such that despite an increase in the capacity, the energy expenditure diminishes.

[1]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[2]  Andreas F. Molisch,et al.  CTH17-2: Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection , 2006, IEEE Globecom 2006.

[3]  Anders Høst-Madsen,et al.  Rateless Coded Cooperation for Multiple-Access Channels in the Low Power Regime , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[5]  Youjian Liu.  A Low Complexity Protocol for Relay Channels Employing Rateless Codes and Acknowledgement , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  K. J. Ray Liu,et al.  SPC12-5: Relay Selection in Multi-Node Cooperative Communications: When to Cooperate and Whom to Cooperate with? , 2006, IEEE Globecom 2006.

[7]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Yongyi Mao,et al.  Rateless coding for wireless relay channels , 2005, ISIT.

[9]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[10]  Andreas F. Molisch,et al.  Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection , 2008, IEEE Transactions on Wireless Communications.

[11]  Norman C. Beaulieu,et al.  Achievable Rates and Fairness in Rateless Coded Relaying Schemes , 2008, IEEE Transactions on Wireless Communications.

[12]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[13]  I. Miller.  Probability, Random Variables, and Stochastic Processes , 1966 .

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

[15]  Andreas F. Molisch,et al.  Performance of Fountain Codes in Collaborative Relay Networks , 2007, IEEE Transactions on Wireless Communications.

[16]  Raviraj S. Adve,et al.  Relay Selection for Low-Complexity Coded Cooperation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[18]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[19]  Ashutosh Sabharwal,et al.  COOPERATIVE COMMUNICATIONS: Fundamental Limits and Practical Implementation , 2006 .

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

[21]  Yuhong Yang.  Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas , 2008 .

[22]  Yongyi Mao,et al.  Rateless coding over fading channels , 2006, IEEE Communications Letters.

[23]  Shlomo Shamai,et al.  Fountain Capacity , 2006, IEEE Transactions on Information Theory.

[24]  Lin Dai,et al.  Power-Efficient Relay Selection for Decentralized Distributed Space-Time Block Coding , 2007, 2007 41st Annual Conference on Information Sciences and Systems.