Routing in cooperative wireless networks with mutual-information accumulation

IEEE International Conference on Communications

Volumn , Issue , 2008, Pages 4272-4277

  Draper, Stark C ^a,b   Liu, Lingjia ^a,c   Molisch, Andreas F ^a,d,e   Yedidia, Jonathan S ^a,d  

^a IEEE

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

^d MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^e LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL STATE INFORMATION; DECODING; ELECTRIC LOAD FORECASTING; ENERGY POLICY; LINEAR PROGRAMMING; LOCAL AREA NETWORKS; PARALLEL ALGORITHMS; PLANNING; RESOURCE ALLOCATION; WIRELESS LOCAL AREA NETWORKS (WLAN); WIRELESS NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

CHANNEL STATE INFORMATIONS; INFORMATION-ACCUMULATION; INTERNATIONAL CONFERENCES; LINEAR PROGRAM; ROUTINGS;

ROUTING ALGORITHMS;

EID: 51249095100     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2008.802     Document Type: Conference Paper

References (29)

1. Zigbee Alliance, www.zigbee.org, latest version.
2. A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity-part I: System description," IEEE Trans. Comm., p. 1927-1938, 2003.
3. A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity-part II: Implementation aspects and performance analysis," IEEE Trans. Comm., vol. 51, p. 1939-1948, 2003.
4. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Trans. Inform. Theory, vol. 50, pp. 3062-3080, 2004.
5. A. Stefanov and E. Erkip, "Cooperative coding for wireless networks," IEEE Trans. Comm., vol. 52, pp. 1470-1476, 2004.
6. T. E. Hunter, S. Sanayei, and A. Nosratinia, "Outage analysis of coded cooperation," IEEE Trans. Inform. Theory, vol. 52, pp. 375-391, 2006.
7. R. Madan, N. B. Mehta, A. F. Molisch, and J. Zhang, "Energy- Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading," Allerton Conference, 2007.
8. G. Barriac, R. Mudumbai, and U. Madhow, "Distributed beamforming for information transfer in sensor networks," in 3rd Int. Symp. Inform. Proc. Sensor Networks IPSN 2004, pp. 81-88, 2004.
9. M. Abdallah and H. Papadopoulos, "Beamforming algorithms for decode-and-forward relaying in wireless networks," in Proc. Conf. Inform. Sciences & Systems (CISS), 2005.
10. I. Maric and R. D. Yates, "Cooperative multihop broadcast for wireless networks," IEEE J. Selected Areas Comm., vol. 22, pp. 1080-1088, 2004.
11. I. Maric and R. D. Yates, "Cooperative multicast for maximum network lifetime," IEEE J. Selected Areas Comm., vol. 23, pp. 127-135, 2005.
12. J. Chen, L. Jia, X. Liu, G. Noubir, and R. Sundaram, "Minimum energy accumulative routing in wireless networks," in Proc. IEEE INFOCOM, pp. 1875-1886, 2005.
13. B. Zhao and M. C. Valenti, "Practical relay networks: A generalization of hybrid-ARQ," IEEE J. Selected Areas Comm., vol. 23, no. 1, pp. 7-18, Jan. 2005.
14. J. Luo, R. S. Blum, L. J. Cimini, L. J. Greenstein, and A. M. Haimovich, "Link-failure probabilities for practical cooperative relay networks," in Proc. IEEE VTC 2005-Spring, pp. 1489-1493, 2005.
15. A. Jardine, S. McLaughlin, and J. Thompson, "Comparison of space-time cooperative diversity relaying techniques," in Proc. IEEE VTC 2005-Spring, pp. 2374-2378, 2005.
16. R. Madan, N. B. Mehta, A. F. Molisch, and J. Zhang, "Energy- Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection," in Proc. IEEE Globecom, in press, 2006.
17. M.Luby, "LT codes," in Proc. 43rd Annual IEEE Symp. Foundations of Computer Science(FOCS), pp. 271-282, 2002.
18. J. W. Byers, M. Luby, and W. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast," IEEE J. Selected Areas Comm., vol. 20, pp. 1528-1540, 2002.
19. A. Shokrollahi, "Raptor codes," in Proc. Int. Symp. Inform. Theory, p. 36, 2004.
20. M. Mitzenmacher, "Digital fountains: A survey and look forward," in Proc. IEEE Inform. Theory Workshop 2004, pp. 271-276, Oct. 2004.
21. D. J. C. MacKay, "Fountain codes," IEE Proc. - Comm., vol. 152, pp. 1062-1068, 2005.
22. J. Castura and Y. Mao, "Rateless coding over fading channels," IEEE Comm. Lett., vol. 10, pp. 46-48, 2006.
23. N. Devroye, P. Mitran, and V. Tarokh, "Achievable rates in cognitive radio channels," IEEE Trans. Inform. Theory, pp. 1812-1827, 2006.
24. A. F. Molisch, N. B. Mehta, J. Yedidia, and J. Zhang, "Cooperative relay networks using fountain codes," IEEE Globecom, 2006.
25. D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, D. R. Karger, T. Hio, E. Ahmed, and F. Zhao, "Minimum-Cost Multicast Over Coded Packet Networks", IEEE Trans. Inform. Theory, vol. 20, 2608-2623, 2006.
26. R. Yim, N. B. Mehta, A. F. Molisch, J. Zhang, "Progressive Accumulative Routing in Wireless Networks", Proc. IEEE Globecom, 2006.
27. A. F. Molisch, Wireless communications. IEEE Press - Wiley, 2005.
28. T. H. Cormen, C. E Leiserson, and R. L Rivest, Introduction to Algorithms, 1st edition. MIT Press, 1990. Chapter 25.
29. S. C. Draper, L. Liu, A. F. Molisch, and J. Yedidia, "Routing for large networks with mutual information accumulation", IEEE Trans. Inform. Theory, to be submitted.