A distributed cooperative product code for multi-source multi-relay single-destination wireless network

In the paper, we proposed a distributed cooperative product coding scheme, for multi-source multi-relay single-destination network. The coding is jointly coded by sources and relays in a cooperative manner in two time slots. Sources send packets with row sub-code, and then relays add redundancy rows with systematic column sub-code. The iterative decoding algorithm is used to effectively decode the received block at destination. Simulation results showed an improvement of about 2.8dB, compared with non-cooperative soft-decode scheme. Numerical results also showed the proposed system is insensitive to power allocation and relay position. The encoding process in sources and relays are of linear complexity. As a result, it is suitable for power-limited systems like wireless sensors network. Also, the decoding algorithm at the destination(sink) node is parallel, which makes the destination decoding efficient and of low-complexity. Simulation results has shown a coarse power and/or distance planning is enough for power allocation and relays' position.

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

[2]  Sang Wu Kim,et al.  Decentralized Random Parity Forwarding in Multi-Source Wireless Relay Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[3]  Ofir Shalvi,et al.  Multiple source Cooperation diversity , 2004, IEEE Communications Letters.

[4]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[5]  Khaled Ben Letaief,et al.  A Distributed Product Coding Approach For Robust Network Coding , 2008, 2008 IEEE International Conference on Communications.

[6]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[7]  Thomas E. Fuja,et al.  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels , 2006, IEEE Transactions on Information Theory.

[8]  Tiffany Jing Li,et al.  Adaptive network coded cooperation (ANCC) for wireless relay networks: matching code-on-graph with network-on-graph , 2008, IEEE Transactions on Wireless Communications.

[9]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[10]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

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

[12]  R. Morelos-Zaragoza.  The art of error correcting coding , 2002 .

[13]  Young-Joon Kim,et al.  Joint LDPC Codes for Multi-User Relay Channel , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

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