Low complexity and fractional coded cooperation for wireless networks

Wireless networks, and especially wireless sensor networks, have complexity and energy constraints, within which they must confront the challenging wireless fading environment. In this paper, fractional cooperation is introduced, which is shown to provide energy-efficient and low-complexity diversity gains for constant energy costs per bit throughout the network. To minimize complexity, cooperation is based on demodulate- and-forward, wherein the relay nodes encode demodulated, not decoded symbols. A scheme is presented for cooperative error- control coding in complexity-constrained networks, using low- density generator-matrix codes and repeat-accumulate codes, both chosen for being simple to encode, as well as for their easily adaptable rates. It is shown that these codes, coupled with fractional cooperation, are robust to system parameters and conditions, and introduce little added complexity at the receiver, while providing excellent performance.

[1]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Trans. Commun..

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

[3]  Jun Hu,et al.  Low Density Parity Check Codes over Half-duplex Relay Channels , 2006, 2006 IEEE International Symposium on Information Theory.

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

[5]  Ron Dabora,et al.  On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication , 2006, IEEE Transactions on Information Theory.

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

[7]  Aria Nosratinia,et al.  Coded cooperation in wireless communications: space-time transmission and iterative decoding , 2004, IEEE Transactions on Signal Processing.

[8]  Ashutosh Sabharwal,et al.  On the Capacity of 'Cheap' Relay Networks , 2003 .

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[10]  Syed Ali Jafar,et al.  On the Capacity of Memoryless Relay Networks , 2005, 2006 IEEE International Conference on Communications.

[11]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[12]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[13]  Raviraj S. Adve,et al.  Cooperative diversity using message passing in wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[15]  G. Kramer.  Distributed and Layered Codes for Relaying , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[16]  D. Mackay,et al.  Low-Density Parity Check Codes over , 1998 .

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

[18]  Margaret Martonosi,et al.  Hardware design experiences in ZebraNet , 2004, SenSys '04.

[19]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[20]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[21]  Jing Li,et al.  Practical Compress-Forward in User Cooperation: Wyner-Ziv Cooperation , 2006, 2006 IEEE International Symposium on Information Theory.

[22]  Ashutosh Sabharwal,et al.  Half-Duplex Estimate-and-Forward Relaying: Bounds and Code Design , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  Matthew C. Valenti,et al.  Practical relay networks: a generalization of hybrid-ARQ , 2005 .

[24]  Jaekyun Moon,et al.  A low-density generator matrix interpretation of parallel concatenated single bit parity codes , 2001 .

[25]  J. Nicholas Laneman,et al.  Modulation and demodulation for cooperative diversity in wireless systems , 2006, IEEE Transactions on Wireless Communications.

[26]  Zixiang Xiong,et al.  Practical compress-forward code design for the half-duplex relay channel , 2005 .

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

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

[29]  Zheng Zhang,et al.  Capacity-approaching turbo coding and iterative decoding for relay channels , 2005, IEEE Transactions on Communications.

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

[31]  Dariush Divsalar,et al.  Accumulate repeat accumulate codes , 2004, ISIT.

[32]  Wei Zhong,et al.  Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix , 2003, IEEE Communications Letters.

[33]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.