Cooperative communications: Fundamental limits and practical implementation

Cooperation in Wireless Networks: Principles and Applications: Real Egoistic Behavior is to Cooperate!

Volumn , Issue , 2006, Pages 29-68

  Chakrabarti, Arnab ^a   Sabharwal, Ashutosh ^a   Aazhang, Behnaam ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

amplify and forward; broadcast; coding; decode and forward; estimate and forward; information theory; LDPC; max flow min cut; multiple access; relay; user cooperation; wireless communication

Indexed keywords

EID: 84886232116     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/1-4020-4711-8_2     Document Type: Chapter

References (105)

1. Ahlswede, R., Cai, N., Li, S.-Y. R., and Yeung, R. W. (2000). Network information flow. IEEE Trans. Inform. Theory, 46(4):1204-1216.
2. Ahlswede, R. and Kaspi, A. H. (1987). Optimal coding strategies for certain permuting channels. IEEE Trans. Inform. Theory, 33(3):310-314.
3. Aref, M. R. (1980). Information flow in relay networks. PhD thesis, Stanford University.
4. Bergmans, P. and Cover, T. M. (1974). Cooperative broadcasting. IEEE Trans. Inform. Theory, 20:317-324.
5. Berrou, C., Glavieux, A., and Thitimajshima, P. (1993). Near shannon limit error-correcting coding and decoding: Turbo-codes. In Proc. of ICC, volume 2, pages 1064-1070.
6. Biglieri, E., Proakis, J., and Shamai, S. (1998). Fading channels: Information-theoretic and communications aspects. IEEE Trans. Inform. Theory, 44(6): 2619-2692.
7. Boyer, J., Falconer, D. D., and Yanikomeroglu, H. (2004). Multihop diversity in wireless relaying channels. IEEE Trans. Commun., 52(10):1820-1830.
8. Caire, G.and Shamai, S. (2003).Onthe achievable throughputofamultiantenna Gaussian broadcast channel. IEEE Trans. Inform. Theory, 49:1691-1706.
9. Carleial, A. B.(1982). Multiple-access channels with different generalized feedback signals. IEEE Trans. Inform. Theory, 28(6):841-850.
10. Castura, J. and Mao, Yongyi (2005). Rateless coding for wireless relay channels. In Proc. of ISIT, pages 810-814.
11. Chakrabarti, A., de Baynast, A., Sabharwal, A., and Aazhang, B. LDPC codes for decode-and-forward half-duplex relaying. in preparation for IEEE J. Select. Areas Commun.
12. Chakrabarti, A., deBaynast, A., Sabharwal, A., and Aazhang, B.(2005a).LDPC code design for half-duplex decode-and-forward relaying. In Proc. of the Allerton Conference, Monticello, IL.
13. Chakrabarti, A., Sabharwal, A., and Aazhang, B. (2005b). Sensitivity of achievable rates for half-duplex relay channel. In Proc. of SPAWC.
14. Chong, H. F., Motani, M., and Garg, H. K. (2005). New coding strategies for the relay channel. In Proc. of ISIT, pages 1086-1090.
15. Chou, P. A., Wu, Y., and Jain, K. (2003). Practical network coding. In Proc. of the Allerton conference.
16. Costa, M. H. M. (1983). Writing on dirty paper. IEEE Trans. Inform. Theory, 29:439-441.
17. Cover, T., El Gamal, A., and Salehi, M. (1980). Multiple access channels with arbitrarily correlated sources. IEEE Trans. Inform. Theory, 26(6):648-657.
18. Cover, T. and Thomas, J. (1991). Elements of Information Theory. John Wiley and Sons.
19. Cover, T. M. (1972). Broadcast channels. IEEE Trans. Inform. Theory, 18:2-14.
20. Cover, T. M. (1975). An achievable rate region for the broadcast channel. IEEE Trans. Inform. Theory, 21(4):399-404.
21. Cover, T. M. and El Gamal, A. A. (1979). Capacity theorems for the relay channel. IEEE Trans. Inform. Theory, 25:572-584.
22. Cover, T. M. and Leung, C. S. K. (1981). An achievable rate region for the multiple-access channel with feedback. IEEE Trans. Inform. Theory, 27(3): 292-298.
23. El Gamal, A., Mohseni, M., and Zahedi, S. (2004). On reliable communication over additive white Gaussian noise relay channels. submitted to IEEE Trans. Inform. Theory.
24. El Gamal, A. and van der Meulen, E. C. (1981). A proof of Marton's coding theorem for the discrete memoryless broadcast channel. IEEE Trans. Inform. Theory, 27(1):120-122.
25. El Gamal, A.A. (1981). On information flow inrelay networks. In Proc. of IEEE National Telecommunications Conference, volume 2, pages D4.1.1-D4.1.4.
26. El Gamal, A. A. and Aref, M. (1982). The capacity of the semideterministic relay channel. IEEE Trans. Inform. Theory, 28(3):536.
27. Ford, L. and Fulkerson, D. (1962). Flows in Networks. Princeton University Press.
28. Foschini, G. J. and Gans, M. J. (1998). On limits of wireless communications in a fading environment when using multiple antennas. Wireless Personal Communications, 6(3):311-335.
29. Gaarder, N. T. and Wolf, J. K. (1975). The capacity region of a multiple-access discrete memoryless channel can increase with feedback. IEEE Trans. Inform. Theory, 21(1):100-102.
30. Gallager, R. G. (1963). Low Density Parity Check Codes. PhD thesis, MIT.
31. Gastpar, M. and Vetterli, M. (2005). On the capacity of large Gaussian relay networks. IEEE Trans. Inform. Theory, 51(3):765-779.
32. Gel'fand, S. I. and Pinsker, M. S. (1980). Capacity of a broadcast channel with one deterministic component. Probl. Pered. Inform., 16(1):24-34.
33. Grossglauser, M. and Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Networking, 10(4):477-486.
34. Gupta, P. and Kumar, P. R. (2000). The capacity of wireless networks. IEEE Trans. Inform. Theory, pages 388-404.
35. Gupta, P. and Kumar, P. R. (2003). Towards an information theory of large networks: An achievable rate region. IEEE Transactions on Information Theory, 49(8):1877-1894.
36. Han, T. S. (1981). The capacity region for the deterministic broadcast channel with a common message. IEEE Trans. Inform. Theory, 27(1):122-125.
37. Hasna, M. O. and Alouini, M.-S. (2003). End-to-end performance of transmission systems with relays over Rayleigh-fading channels. IEEE Trans. Wireless Commun., 2(6):1126-1131.
38. Ho, T., Koetter, R., Medard, M., Karger, D., and Effros, M. (2003). The benefits of coding over routing in a randomized setting.
39. Hunter, T. E., Sanayei, S., and Nosratinia, A. (2004). The outage behavior of coded cooperation. In Proc. of ISIT, page 270.
40. Høst-Madsen, A. (2004). Cooperation in the low power regime. In Proc. of the Allerton Conference.
41. Høst-Madsen, A. and Zhang, J. (2005). Capacity bounds and power allocation for the wireless relay channel. IEEE Trans. Inform. Theory, 51(6):2020-2040.
42. Jaggi, S., Sanders, P., Chou, P. A., Effros, M., Egner, S., Jain, K., and Tolhuizen, L. (2005). Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theory, 51:1973-1982.
43. Janani, M., Hedayat, A., Hunter, T. E., and Nosratinia, A. (2004). Coded cooperation in wireless communications: space-time transmission and iterative decoding. IEEE Trans. Signal Processing, 52:362-371.
44. Khojastepour, M. A. (2004). Distributed Cooperative Communications in Wireless Networks. PhD thesis, Dept. of Electrical and Computer Engg., Rice University.
45. Khojastepour, M. A., Ahmed, N., and Aazhang, B. (2004a). Code design for the relay channel and factor graph decoding. In Proc. of Asilomar Conference, volume 2, pages 2000-2004.
46. Khojastepour, M. A., Sabharwal, A., and Aazhang, B. (2002a). Bounds on achievable rates for general multi-terminal networks with practical constraints. In Proc. of IPSN.
47. Khojastepour, M. A., Sabharwal, A., and Aazhang, B. (2002b). On the capacity of 'cheap' relay networks. In Proc. of CISS.
48. Khojastepour, M. A., Sabharwal, A., and Aazhang, B. (2003). On capacity of Gaussian 'cheap' relay channel. GLOBECOM, pages 1776-1780.
49. Khojastepour, M.A., Sabharwal, A., andAazhang, B.(2004b).Improved achievable rates for user cooperation and relay channels. In Proc. of ISIT.
50. King, R. C. (1978). Multiple access channels with generalized feedback. PhD thesis, Stanford University.
51. Kobayashi, K. (1987). Combinatorial structure and capacity of the permuting relay channel. IEEE Trans. Inform. Theory, 33(6):813-826.
52. Koetter, R. and Medard, M. (2003). An algebraic approach to network coding. IEEE/ACM Transactions on network coding, 11:782-795.
53. Kramer, G., Gastpar, M., andGupta, P.(2005). Cooperativestrategies andcapac-ity theorems for relay networks. IEEE Trans. Inform. Theory, 51(9):3037-3063.
54. Kschischang, F. R., Frey, B. J., and Loeliger, H.-A. (2001). Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory, 47:498-519.
55. Laneman, J. N. (2002). Cooperative diversity in wireless networks: Algorithms and Architectures. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
56. Laneman, J. N., Tse, D. N. C., and Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Trans. Inform. Theory, 50:3062-3080.
57. Laneman, J. N. and Wornell, G. W. (2003). Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inform. Theory, 49(10):2415-2425.
58. Li, S.-Y. R., Yeung, R. W., and Cai, N. (2003). Linear network coding. IEEE Trans. Inform. Theory, 49:371-381.
59. Li, Z. and Li, B. (2004). Network coding in undirected networks. Proc. of CISS.
60. Liang, Y.andVeeravalli, V.V.(2005). Gaussian orthogonal relaychannels: Optimal resource allocation and capacity. IEEE Trans. Inform. Theory, 51:3284-3289.
61. Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., and Spielman, D. (2001). Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inform. Theory, 47:585-598.
62. MacKay, D. J. C. (1999). Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, 45:399-431.
63. Marton, K. (1979). A coding theorem for the discrete memoryless broadcast channel. IEEE Trans. Inform. Theory, 25(3):306-311.
64. Mitran, P., Ochiai, H., and Tarokh, V. (2005). Space-time diversity enhancements using collaborative communications. IEEE Trans. Inform. Theory, 51(6):2041-2057.
65. Nabar, R. U., Bolcskei, H., and Kneubuhler, F. W. (2004). Fading relay channels: Performance limits and space-time signal design. IEEE J. Select. Areas Commun., 22:1099-1109.
66. Reznik, A., Kulkarni, S. R., and Verdú, S. (2004). Degraded Gaussian multiple relay channel: capacity and optimal power allocation. IEEE Trans. Inform. Theory, 50(12):3037-3046.
67. Richardson, T. J., Shokrollahi, M. A., and Urbanke, R. L. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory, 47:619-637.
68. Richardson, T. J. and Urbanke, R. L. (2001). The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47:599-618.
69. Richardson, T. J. and Urbanke, R. L. (2004). Modern coding theory (draft of book).
70. Sabharwal, A. (2004). Impact of half-duplex radios and decoding latencies on mimo relay channels. In Proc. of the Allerton Conference, Monticello, IL.
71. Sabharwal, A. and Mitra, U. (2005). Rate-constrained relaying: A model for cooperation with limited relay resources. submitted to IEEE Trans. Inform. Theory.
72. Sato, H. (1976). Information transmission through a channel with relay. The Aloha System, University of Hawaii, Honolulu, Tech. Rep.
73. Sato, H. (1978). An outer bound to the capacity region of broadcast channels. IEEE Trans. Inform. Theory, 24(3):374-377.
74. Schein, B. (2001). Distributed coordination in network information theory. PhD thesis, Massachusetts Institute of Technology.
75. Schein, B. and Gallager, R. (2000). The Gaussian parallel relay network. In Proc. of ISIT, page 22, Sorrento, Italy.
76. Sendonaris, A., Erkip, E., and Aazhang, B. (2003a). User cooperation diversity. Part I. System description. IEEE Trans. Commun., 51:1927-1938.
77. Sendonaris, A., Erkip, E., and Aazhang, B. (2003b). User cooperation diversity. Part II. Implementation aspects and performance analysis. IEEE Trans. Commun., 51:1939-1948.
78. Slepian, D. and Wolf, J. (1973). Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory, 19:471-480.
79. Stefanov, A. and Erkip, E. (2004). Cooperative coding for wireless networks. IEEE Trans. Commun., 52:1470-1476.
80. Tarokh, V., Seshadri, N., and Calderbank, A. R. (1998). Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE Trans. Inform. Theory, 44:744-765.
81. Telatar, I. E. (1999). Capacity of multiple-antenna Gaussian channels. Eur. Trans. Tel., 10(6):585-595.
82. Thomas, J. A. (1987). Feedback can at most double Gaussian multiple access channel capacity. IEEE Trans. Inform. Theory, 33(5):711-716.
83. Toumpis, S. and Goldsmith, A. J. (2003). Capacity regions for wireless ad hoc networks. IEEE Trans. Wireless Commun., 2(4):736-748.
84. van der Meulen, E. C. (1968). Transmission of information in a T-terminal discrete memoryless channel. PhD thesis, Dept. of Statistics, University of California, Berkeley.
85. van der Meulen, E. C. (1971). Three-terminal communication channels. Advanced Applied Probability, 3:120-154.
86. van der Meulen, E. C. (1977). A survey of multi-way channels in information theory: 1961-1976. IEEE Trans. Inform. Theory, 23:1-37.
87. Vanroose, P. and van der Meulen, E. C. (1992). Uniquely decodable codes for deterministic relay channels. IEEE Trans. Inform. Theory, 38(4):1203-1212.
88. Vishwanath, S., Jindal, N., and Goldsmith, A. J. (2003). Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels. IEEE Trans. Inform. Theory, 49(10):2658-2668.
89. Viswanath, P. and Tse, D. N. C. (2003). Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality. IEEE Trans. Inform. Theory, 49:1912-1921.
90. Wang, Bo, Zhang, Junshan, and Høst-Madsen, A. (2005). On the capacity of MIMO relay channels. IEEE Trans. Inform. Theory, 51:29-43.
91. Willems, F. M. J. (1982). Informationtheoretical Results for the Discrete Mem-oryless Multiple Access Channel. PhD thesis, Katholieke Univ. Leuven, Leuven, Belgium.
92. Wyner, A. D. (1978). The rate-distortion function for source coding with side information at the receiver-II: General sources. Inform. Contr., 38:60-80.
93. Wyner, A. D. and Ziv, J. (1976). The rate-distortion function for source coding with side information at the receiver. IEEE Trans. Inform. Theory, 22(1): 1-11.
94. Xie, L. L. and Kumar, P. R. (2005). An achievable rate for the multiple-level relay channel. IEEE Trans. Inform. Theory, 51(4):1348-1358.
95. Xie, Liang-Liang and Kumar, P. R. (2004). A network information theory for wireless communication: Scaling laws and optimal operation. IEEE Trans. Inform. Theory, 50(5):748-767.
96. Xue, F., Xie, Liang-Liang, and Kumar, P. R. (2005). The transport capacity of wireless networks over fading channels. IEEE Trans. Inform. Theory, 51(3):834-847.
97. Yeung, R. W., Li, S.-Y. R., Cai, N., and Zhang, Z. (2005). Theory of network coding.
98. Yeung, R. W. and Zhang, Z. (1999). Distributed source coding for satellite communications. IEEE Trans. Inform. Theory, 45:1111-1120.
99. Yu, Wei and Cioffi, J. M. (2004). Sum capacity of Gaussian vector broadcast channels. IEEE Trans. Inform. Theory, 50:1875-1892.
100. Zahedi, S., Mohseni, M., and El Gamal, A. (2004). On the capacity of AWGN relay channels with linear relaying functions. In Proc. of ISIT, page 399, Chicago, IL.
101. Zeng, C. M., Kuhlmann, F., and Buzo, A. (1989). Achievability proof of some multiuser channel coding theorems using backward decoding. IEEE Trans. Inform. Theory, 35(6):1160-1165.
102. Zhang, Z. (1988). Partial converse for a relay channel. IEEE Trans. Inform. Theory, 34(5):1106-1110.
103. Zhang, Z., Bahceci, I., and Duman, T. M. (2004). Capacity approaching codes for relay channels. In Proc. of ISIT.
104. Zhang, Zheng and Duman, T. M. (2005). Capacity approaching turbo coding for half duplex relaying. In Proc. of ISIT.
105. Zhao, B. and Valenti, M. C. (2003). Distributed turbo coded diversity for relay channel. 39:786-787.