Exploiting route diversity in multi-packet transmission using mutual information accumulation

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 1793-1800

  Liu, Yanpei ^a   Yang, Jing ^a   Draper, Stark C ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRIVAL PROCESS; BROKEN DOWN; COOPERATIVE WIRELESS NETWORKS; MUTUAL INFORMATIONS; NETWORK RESOURCE; PACKET TRANSMISSIONS; RESOURCE ALLOCATION PROBLEM; ROUTE DIVERSITY; SOURCE NODES; TEMPORAL DIVERSITY; UNICAST;

ALGORITHMS; COMMUNICATION;

PACKET NETWORKS;

EID: 84862923182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120386     Document Type: Conference Paper

References (20)

1. S. C. Draper, L. Liu, A. F. Molisch, and J. S. Yedidia, "Cooperative routing for wireless networks using mutual-information accumulation," IEEE Trans. Inform. Theory, vol. 57, Aug. 2011.
2. S. Biswas and R. Morris, "ExOR: Opportunistic multi-hop routing for wireless networks," ACM SIGCOMM, vol. 35, pp. 133-144, Aug. 2005. (Pubitemid 46323500)
3. J. Castura and Y. Mao, "Rateless coding for wireless relay channels," Proc. Int. Symp. Inform. Theory, pp. 810-814, Sept. 2005.
4. R. Gummadi and R. S. Sreenivas, "Relaying a fountain code across multiple nodes," IEEE Info. Theory Workshop, pp. 149-153, May 2008.
5. M. Mitzenmacher, "Digital fountains: A survey and look forward," Proc. IEEE Inform. Theory Workshop, pp. 271-276, Oct. 2004.
6. M. Luby, "LT codes," Proc. Symp. Foundation of Computer Science, pp. 271-282, 2002.
7. A. Shokrollahi, "Raptor codes," Proc. Int. Symp. Inform. Theory, vol. 52, pp. 2551-2567, Jun. 2006.
8. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, pp. 1936-1948, Apr. 1992.
9. -, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Trans. Inform. Theory, vol. 39, pp. 466-478, Jun. 1993.
10. M. J. Neely and R. Urgaonkar, "Optimal backpressure routing for wireless networks with multi-receiver diversity," Proc. Conf. Info. Sci. Sys., pp. 18-25, Jan. 2006.
11. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," ACM SIGCOMM, vol. 36, pp. 243-254, Sept. 2006. (Pubitemid 44623731)
12. I. Maric and R. D. Yates, "Cooperative multihop broadcast for wireless networks," IEEE J. Select. Areas Commun., vol. 22, pp. 1080-1088, Aug. 2004.
13. -, "Cooperative multicast for maximum network lifetime," IEEE J. Select. Areas Commun., vol. 23, pp. 127-135, Jan. 2005.
14. J. Chen, L. Jia, X. Liu, G. Noubir, and R. Sundaram, "Minimum energy accumulative routing in wireless networks," Proc. IEEE INFOCOMM, vol. 3, pp. 1875-1886, Mar. 2005.
15. R. Urgaonkar and M. J. Neely, "Routing with mutual information accumulation in wireless networks," Tech. Rep., Aug. 2010.
16. S. Katti, D. Katabi, H. Balakrishnan, and M. Medard, "Symbol-level network coding for wireless mesh networks," ACM SIGCOMM, vol. 38, pp. 401-412, Aug. 2008.
17. T. Ho and H. Viswannathan, "Dynamic algorithms for multicast with intra-session network coding," IEEE Trans. Inform. Theory, vol. 55, pp. 797-815, Feb. 2009.
18. A. F. Molisch, N. B. Mehta, J. S. Yedidia, and J. Zhang, "Performance of fountain codes in collaborative relay networks," IEEE Trans. Wireless Comm., vol. 6, pp. 4108-4119, Nov. 2007. (Pubitemid 350121760)
19. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
20. T. H. Cormen, C. Leiserson, and R. L. Rivest, Introduction to Algorithms, 2nd ed. MIT Press and McGraw-Hill, 2001.