Multicast throughput order of network coding in wireless ad-hoc networks

IEEE Transactions on Communications

Volumn 59, Issue 2, 2011, Pages 497-506

  Karande, Shirish S ^a   Wang, Zheng ^b   Sadjadpour, Hamid R ^b   Garcia Luna Aceves, J J ^b,c  

^a TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

^b University of California Santa Cruz   (United States)

^c PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Capacity; multicast; network coding

Indexed keywords

CAPACITY; MULTICAST; MULTICAST GROUPS; MULTICASTS; PHYSICAL MODEL; PROTOCOL MODEL; STORE AND FORWARD; TIGHT BOUND; UNIT SQUARES;

INFORMATION THEORY; MULTICASTING; TELECOMMUNICATION NETWORKS; WIRELESS AD HOC NETWORKS; WIRELESS NETWORKS;

NETWORK CODING;

EID: 79951856565     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2011.121410.090368     Document Type: Article

References (31)

1. R. W. Yeung and Z. Zhang, "Distributed source coding for satellite communications," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1111-1120, 1999.
2. R. Ahlswede, C. Ning, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
3. J. Liu, D. Goeckel, and D. Towsley, "The throughput order of ad hoc networks employing network coding and broadcasting," in Proc. IEEE MILCOM 2006, Washington DC, USA, Oct. 2006.
4. A. Keshavarz-Haddad and R. Riedi, "Bounds on the benefit of network coding: throughput and energy saving in wireless networks," in Infocom 2008, Phoenix, AZ, USA, Apr. 2008.
5. B. Tavli, "Broadcast capacity of wireless networks," IEEE Commun. Lett., vol. 10, no. 2, pp. 68-69, 2006. (Pubitemid 43224871)
6. R. Zheng, "Information dissemination in power-constrained wireless networks," in Proc. IEEE INFOCOM 2006, Barcelona, Catalunya, Spain, Apr. 2006.
7. A. Keshavarz, V. Ribeiro, and R. Riedi, "Broadcast capacity in multihop wireless networks," in Proc. ACM MobiCom 2006, Los Angeles, CA, USA, Sep. 2006.
8. P. Jacquet and G. Rodolakis, "Multicast scaling properties in massively dense ad hoc networks," in Proc. IEEE ICPADS 2005, Fukuoka, Japan, July 2005.
9. S. Shakkottai, X. Liu, and R. Srikant, "The multicast capacity of wireless ad-hoc networks," in Proc. ACMMobiHoc 2007, Montreal, Canada, Sep. 2007.
10. X.-Y. Li, S.-J. Tang, and O. Frieder, "Multicast capacity for large scale wireless ad hoc networks," in Proc. ACM MobiCom 2007, Montreal, Canada, Sep. 2007.
11. Z. Wang, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "A unifying perspective on the capacity of wireless ad hoc networks," in Proc. IEEE INFOCOM 2008, Phoenix, AZ, USA, Apr. 2008.
12. A. Keshavarz-Haddad and R. Riedi, "Multicast capacity of large homogeneous multihop wireless networks," in IEEE WiOpt 2008, Berlin, Germany, Apr. 2008.
13. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "Xors in the air: practical wireless network coding," in ACM SIGCOMM 2006, Pisa, Italy, Sep. 2006.
14. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing," in ACM SIGCOMM 2007, Kyoto, Japan, Aug. 2007.
15. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, 2000.
16. M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "Closing the gap in the capacity of wireless networks via percolation theory," IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 1009-1018, 2007. (Pubitemid 46487788)
17. S. Li, Y. Liu, and X.-Y. Li, "Capacity of large wireless networks under Gaussian channel model," in Proc. ACMMobiCom 2008, San Francisco, CA, USA, Sep. 2008.
18. Z. Li and B. Li, "Network coding in undirected networks," in Proc. CISS 2004, Princeton, NJ, USA, Mar. 2004.
19. Z. Li, B. Li, and L. Lau, "On achieving maximum multicast throughput in undirected networks," IEEE/ACM Trans. Networking, vol. 52, pp. 2467-2485, 2006. (Pubitemid 43898904)
20. S. P. Borade, "Network information flow: limits and achievability," in IEEE International Symp. Inf. Theory, July 2008.
21. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
22. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Netw. Syst. Manag., Mar. 2006.
23. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On capacity of information networks," IEEE/ACM Trans. Networking, June 2006.
24. S. Zhang, S. Liew, and P. P. Lam, "Hot topic: physical-layer network coding," in Proc. ACM MobiCom 2006, Los Angeles, CA, USA, Sep. 2006.
25. S. Katti, S. Gollakota, and D. Katabi, "Embracing wireless interference: analog network coding," in Proc. ACM SIGCOMM 2007, Kyoto, Japan, Aug. 2007.
26. J. J. Garcia-Luna-Aceves, H. R. Sadjadpour, and Z. Wang, "Challenges: towards truly scalable ad hoc networks," in Proc. ACM MobiCom 2007, Montreal, Quebec, Canada, Sep. 2007.
27. S. Karande, Z. Wang, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Optimal scaling of multicommodity flows in wireless ad-hoc networks: beyond the Gupta-Kumar barrier," in Proc. IEEE MASS 2008, Atlanta, GA, USA, Oct. 2008.
28. Z. Wang, S. Karande, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "On the capacity improvement ofmulticast traffic with network coding," in Proc. IEEE MILCOM 2008, San Diego, CA, USA, Nov. 2008.
29. S. Kulkarni and P. Viswanath, "A deterministic approach to throughput scaling wireless networks," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1041-1049, 2004.
30. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," J. ACM, vol. 46, no. 6, pp. 787-832, 1999.
31. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.