On the improvement of scaling laws for large-scale MANETs with network coding

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 5, 2009, Pages 662-672

  Zhang, Chi ^a   Zhu, Xiaoyan ^b   Fang, Yuguang ^a  

^a University of Florida   (United States)

^b XIDIAN UNIVERSITY   (China)

Author keywords

Fundamental limits; Mobile ad hoc networks (MANETs); Mobility; Network coding; Scaling laws; Throughput delay storage tradeoff

Indexed keywords

CONSTANT IMPROVEMENT; FUNDAMENTAL LIMITS; LINEAR CODING; MOBILE AD HOC NETWORKS (MANETS); MOBILITY; NETWORK CODING; NODE MOBILITY; RANDOM WALK MOBILITY; RELAY NODE; STORAGE REQUIREMENTS;

COMMUNICATION CHANNELS (INFORMATION THEORY); MOBILE AD HOC NETWORKS; NETWORK PERFORMANCE; SCALING LAWS; SYSTEMS ENGINEERING; THROUGHPUT; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 67650620446     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090608     Document Type: Article

References (36)

1. S. Farrell and V. Cahill, Delay- and Disruption-Tolerant Networking. Boston, MA: Artech House, 2006.
2. M. Grossglauser and M. D. Tse, "Mobility increases the capacity of ad hoc wireless networks," in Proc. IEEE INFOCOM 2001, Anchorage, Alaska, April 2001.
3. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404, March 2000.
4. A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," in Proc. IEEE INFOCOM 2004, Hong Kong, China, Mar. 2004.
5. M. Neely and E. Modiano, "Capacity and delay tradeoffs for ad-hoc mobile networks," IEEE Trans. Inform. Theory, vol. 51, no. 6, pp. 1917-1937, June 2005.
6. J. Herdtner and E. Chong, "Throughput-storage tradeoff in ad hoc networks," in Proc. of IEEE INFOCOM 2005, Miami, FL, Mar. 2005.
7. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
8. C. Fragouli and E. Soljanin, Network coding applications, Foundations and Trends in Networking. Boston, MA: Now Publishers Inc., 2007.
9. S. Jaggi, P. A. Chou, and K. Jain, "Low complxity optimal algebraic multicast codes," in Proc. IEEE International Symposium on Information Theory, Yokohama, Japan, June-July 2003.
10. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE International Symposium on Information Theory, Yokohama, Japan, June-July 2003.
11. L. Kleinrock and J. A. Silvester, "Optimum transmission radii in packet radio networks or why six is a magic number," in Proc. National Telecommunications Conference, Dec. 1978.
12. X. Lin and N. Shroff, "The fundamental capacity-delay tradeoff in large mobile ad hoc networks," in Proc. Third Annual Mediterranean Ad Hoc Networking Workshop, Bodrum, Turkey, June 2004.
13. X. Lin, G. Sharma, R. Mazumdar, and N. Shroff, "Degenerate delay-capacity trade-offs in ad hoc networks with brownian mobility," IEEE/ACM Trans. Networking, vol. 52, no. 6, pp. 2777-2784, June 2006.
14. S. Toumpis and A. Goldsmith, "Large wireless networks under fading, mobility, and delay constraints," in Proc. IEEE INFOCOM 2004, Hong Kong, China, March 2004.
15. A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Optimal throughput-delay scaling in wireless networks - part i: the fluid model," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2568-2592, Jun. 2006.
16. -, "Optimal throughput-delay scaling in wireless networks - part ii: Constant-size packets," IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 5111-5116, Nov. 2006.
17. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "Delay and capacity trade-offs in mobile ad hoc networks: A global perspective," in Proc. IEEE INFOCOM 2006, Barcelona, Spain, April 2006.
18. L. Ying, S. Yang, and R. Srikant, "Optimal delay-throughput tradeoffs in mobile ad hoc networks," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 4119-4143, September 2008.
19. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multi-copy case," IEEE Trans. Networking, vol. 16, no. 1, pp. 77-90, Feb. 2008.
20. A. Eryilmaz, A.Ozdaglar, and M. Medard, "On delay performance gains from network coding," in Proc. Conference on Information Sciences and Systems, Princeton, NJ, Mar. 2006.
21. E. Ahmed, A. Eryilmaz, M. Medard, and A. Ozdaglar, "On the scaling law of network coding gains in wireless networks," in Proc. MILCOM 2007, Orlando, FL, Oct. 2007.
22. M. Ghaderi, D. Towsley, and J. Kurose, "Reliability benefit of network coding," Tech. Report 07-08, Computer Science Department, University of Massachusetts Amherst, February 2007. [Online]. Available: http://www.ucalgary.ca/∼mghaderi/docs/reliability.pdf
23. J. Liu, D. Goeckel, and D. Towsley, "Throughput order of ad hoc networks employing network coding and broadcasting," in Proc. Milcom, Washington, DC, Oct. 2006.
24. -, "Bounds on the gain of network coding and broadcasting in wireless networks," in Proc. INFOCOM 2007, Anchorage, Alaska, May 2007.
25. A. Keshavarz-Haddadt and R. Riedi, "Bounds on the benefit of network coding: Throughput and energy saving in wireless networks," in Proc. INFOCOM 2008, Phoenix, AZ, April 2008.
26. M. Penrose, Random Geometric Graphs. Oxford: Oxford University Press, 2003.
27. R. Meester and R. Roy, Continuum Percolation. Cambridge: Cambridge University Press, 1996.
28. O. Dousse, M. Franceschetti, and P. Thiran, "Information theoretic bounds on the throughput scaling of wireless relay networks," in Proc. IEEE INFOCOM 2005, Miami, FL, Mar. 2005.
29. S. Deb, M. Medard, and C. Choute, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2486-2507, June 2006.
30. C. Fragouli, J. Widmer, and J.-Y. L. Boudec, "Efficient broadcasting using network coding," IEEE Trans. Networking, vol. 16, no. 2, pp. 450-463, April 2008.
31. Y. Lin, B. Li, and B. Liang, "Stochastic analysis of network coding in epidemic routing," IEEE J. Sel. Areas Communications, vol. 26, no. 5, pp. 794-808, June 2008.
32. S. Kulkarni and P. Viswanath, "A deternimistic approach to throughput scaling in wireless networks," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1041-1049, Jun. 2004.
33. H. Kesten and V. Sidoravicius, "The spread of a rumor or infection in a moving population," Annals of Probability, vol. 33, no. 6, pp. 2402-2462, 2005.
34. D. Aldous and J. Fill, "Reversible markov chains and random walks on graphs," Monograph in preparation. [Online]. Available: http://www.stat.berkeley.edu/∼aldous/RWG/book.html
35. M. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE J. Sel. Areas Communications, vol. 23, no. 1, pp. 89-103, January 2005.
36. M. J. Neely, "Dynamic power allocation and routing for satellite and wireless networks with time varying channels," PhD thesis, Massachusetts Institute of Technology, 2003.