A Simple Probabilistic Relay Selection Protocol for Asynchronous Multi-Relay Networks Employing Rateless Codes

Cooperative communication with rateless codes has attracted much attention recently because it combines spatial diversity of multiple nodes and high bandwidth efficiency of rateless codes. However, relay selection for asynchronous relaying, which shows great potential for practical applications, has not been carefully studied yet. In this paper, based on rateless codes, we propose a simple probabilistic relay selection protocol for asynchronous multi-relay networks, where no symbol-level inter-node synchronization or multiuser detection is needed. In such asynchronous networks, a decoding relay can help the other relays which have not decoded the message yet. Moreover, the tradeoff between the first hop and the second hop can be controlled by setting the decoding relay threshold. We analyze the average end-to-end throughput and find an optimal decoding relay threshold to maximize the throughput. Simulation results show the superiority of the proposed protocol at low Signal-to-Noise Ratios (SNRs) when the relays are close to the source.

[1]  Herbert A. David,et al.  Order Statistics, Third Edition , 2003, Wiley Series in Probability and Statistics.

[2]  Norman C. Beaulieu,et al.  Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

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

[4]  Vinod Sharma,et al.  Queued Cooperative Wireless Networks With Rateless Codes , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

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

[6]  Zhigang Cao,et al.  ARCOR: Agile Rateless Coded Relaying for Cognitive Radios , 2011, IEEE Transactions on Vehicular Technology.

[7]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

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

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

[10]  Guosen Yue,et al.  Anti-jamming coding techniques with application to cognitive radio , 2009, IEEE Transactions on Wireless Communications.

[11]  H. N. Nagaraja,et al.  Order Statistics, Third Edition , 2005, Wiley Series in Probability and Statistics.

[12]  Zhigang Cao,et al.  Rateless Coded Chain Cooperation in Linear Multi-Hop Wireless Networks , 2010, 2010 IEEE International Conference on Communications.

[13]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

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

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