Benefits of network coding for unicast application in disruption-tolerant networks

IEEE/ACM Transactions on Networking

Volumn 21, Issue 5, 2013, Pages 1407-1420

  Zhang, Xiaolan ^a   Neglia, Giovanni ^b   Kurose, Jim ^c   Towsley, Don ^c   Wang, Haixiang ^a,d  

^a FORDHAM UNIVERSITY   (United States)

^b INRIA   (France)

^c The Manning College of Information and Computer Sciences   (United States)

^d Flextrade Systems   (United States)

Author keywords

Disruption tolerant networking; Network coding; Routing protocols; Unicast

Indexed keywords

DISRUPTION TOLERANT NETWORKS; DISRUPTION-TOLERANT NETWORKING; LINEAR COMBINATIONS; NETWORK TRANSMISSION; NUMBER OF TRANSMISSIONS; RANDOM LINEAR CODING; UNICAST; UNICAST APPLICATIONS;

NETWORK CODING; ROUTING PROTOCOLS;

DELAY TOLERANT NETWORKS;

EID: 84887034803     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2224369     Document Type: Article

References (52)

1. First Mile Solutions, Cambridge,MA, "First Mile Solutions," [Online]. Available: http://firstmilesolutions.com/
2. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2809-2816, Jun. 2006. (Pubitemid 43898929)
3. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
4. A. Balasubramanian, B. N. Levine, and A. Venkataramani, "DTN routing as a resource allocation problem," in Proc. ACM SIGCOMM, 2007, pp. 373-384. (Pubitemid 350239799)
5. M. Borokhovich, C. Avin, and Z. Lotker, "Tight bounds for algebraic gossip on graphs," in Proc. IEEE ISIT, 2010, pp. 1758-1762.
6. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "MaxProp: Routing for vehicle-based disruption-tolerant networks," in Proc. IEEE INFOCOM, 2006, pp. 1-11.
7. H. Cai and D. Y. Eun, "Crossing over the bounded domain: From exponential to power-law intermeeting time in mobile ad hoc networks," IEEE/ACM Trans. Netw., vol. 17, no. 5, pp. 1578-1591, Oct. 2009.
8. H. Cai and E. Y. Eun, "Toward stochastic anatomy of inter-meeting time distribution under general mobility models," in Proc. ACM MobiHoc, 2008, pp. 273-282.
9. S. Deb, M. Medard, and C. Choute, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2486-2507, Jun. 2006. (Pubitemid 43898905)
10. A. Doria, M. Ud'en, and D. P. Pandey, "Providing connectivity to the Saami normadic community," in Proc. dyd02, Dec. 2002.
11. C. Fragouli, J.-Y. Le Boudec, and J.Widmer, "Network coding: An instant primer," Comput. Commun. Rev., vol. 36, no. 1, pp. 63-68, 2006. (Pubitemid 46323585)
12. R. Groenevelt, P. Nain, and G. Koole, "The message delay in mobile ad hoc networks," in Proc. Performance, Oct. 2005, pp. 210-228. (Pubitemid 41240561)
13. Z. J. Haas and T. Small, "A new networking model for biological applications of ad hoc sensor networks," IEEE/ACM Trans. Netw., vol. 14, no. 1, pp. 27-40, Feb. 2006. (Pubitemid 43264667)
14. D. Hay and P. Giaccone, "Optimal routing and scheduling for deterministic delay tolerant networks," in Proc. WONS, 2009, pp. 27-34.
15. 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 ISIT, 2003, p. 442.
16. T. Ho, M. Medard, R. Koetter, and D. R. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
17. P. Hui, A. Chaintreau, R. Gass, J. Scott, J. Crowcroft, and C. Diot, "Pocket switched networking: Challenges, feasibility, and implementation issues," in Proc. IFIP TC6 WAC, 2005, pp. 1-12.
18. B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, A. K. Miu, E. Shih, H. Balakrishnan, and S. Madden, "CarTel: A distributed mobile sensor computing system," in Proc. ACM SenSys, Nov. 2006, pp. 125-138. (Pubitemid 47168682)
19. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005. (Pubitemid 40843620)
20. S. Jain, M. Demmer, R. Patra, and K. Fall, "Using redundancy to cope with failures in a delay tolerant network," in Proc. ACM SIGCOMM, 2005, pp. 109-120. (Pubitemid 46323498)
21. P. Juang, H. Oki, Y. Wang, M. Martonosi, L.-S. Peh, and D. Rubenstein, "Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet," in Proc. ACM ASPLOS, 2002, pp. 96-107. (Pubitemid 44892226)
22. T. Karagiannis, J.-Y. Le Boudec, and M. Vojnovic, "Power law and exponential decay of inter contact times between mobile devices," in Proc. ACM MobiCom, 2007, pp. 183-194.
23. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," IEEE/ACM Trans. Netw., vol. 16, no. 3, pp. 495-510, Jun. 2008.
24. D. Kempe, J. Kleinberg, and A. Kumar, "Connectivity and inference problems for temporal networks," J. Comput. Syst. Sci., vol. 64, pp. 504-513, 2002.
25. J. Kleinberg and E. Tardos, Algorithm Design. Reading, MA: Addison- Wesley, Mar. 2005.
26. A.Krifa, C. Barakat, and T. Spyropoulos, "Optimal buffermanagement policies for delay tolerant networks," in Proc. IEEE SECON, 2008, pp. 260-268.
27. K. Lee, Y. Yi, J. Jeong, H.Won, I. Rhee, and S. Chong, "Max contribution: On optimal resource allocation in delay tolerant networks," in Proc. IEEE INFOCOM, 2010, pp. 1-9.
28. R. Lidl and H. Niederreiter, Finite Fields, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1997.
29. L. Lima, D. Ferreira, and J. Barros, "Topology matters in network coding," Telecommun. Syst. J., vol. 52, no. 3, pp. 1-11, Mar. 2011.
30. Y. Lin, B. Li, and B. Liang, "Efficient network coded data transmissions in disruption tolerant networks," in Proc. IEEE INFOCOM, 2008, pp. 1508-1516.
31. Y. Lin, B. Li, and B. Liang, "Stochastic analysis of network coding in epidemic routing," IEEE J. Sel. Areas Commun., vol. 26, no. 5, pp. 794-808, Jun. 2008.
32. J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks," in Proc. IEEE INFOCOM, 2007, pp. 724-732. (Pubitemid 47334290)
33. M. Luby, "LT codes," in Proc. IEEE FOCS, 2002, pp. 271-282.
34. D. S. Lun, M. Medard, T. Ho, and R. Koetter, "Network coding with a cost criterion," in Proc. ISITA, 2004, pp. 1232-1237.
35. A. Maffei, K. Fall, and D. Chayes, "Ocean instrument internet," in Proc. ASU Ocean Sci. Conf., 2006.
36. J. Partan, J. Kurose, and B. N. Levine, "A survey of practical issues in underwater networks," in Proc. ACM WUWNet, 2006, pp. 17-24. (Pubitemid 46634346)
37. M. Pitkanen, A. Keranen, and J. Ott, "Message fragmentation in opportunistic DTNs," in Proc. WoWMoM, 2008, pp. 1-7.
38. I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Ind. Appl. Math., vol. 8, pp. 300-304, 1960.
39. T. Small and Z. J. Haas, "Resource and performance tradeoffs in delaytolerant wireless networks," in Proc. SIGCOMM WDTN, 2005, pp. 260-267. (Pubitemid 41832985)
40. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multiple-copy case," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 77-90, Feb. 2007.
41. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: The single-copy case," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 63-76, Feb. 2007.
42. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. SIGCOMM WDTN, 2005, pp. 252-259. (Pubitemid 41832984)
43. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," Duke Univ., Durham, NC, Tech. Rep. CS-200006, 2000.
44. Y. Wang, S. Jain, M. Martonosi, and K. Fall, "Erasure-coding based routing for opportunistic networks," in Proc. SIGCOMM WDTN, 2005, pp. 229-236. (Pubitemid 41832981)
45. J. Widmer and J.-Y. Le Boudec, "Network coding for efficient communication in extreme networks," in Proc. SIGCOMM WDTN, 2005, pp. 284-291. (Pubitemid 41832988)
46. J.Widmer, C. Fragouli, and J.-Y. Le Boudec, "Energy-efficient broadcasting in wireless ad-hoc networks," in Proc. IEEE NETCOD, 2005.
47. Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," in Proc. IEEE Inf. Theory Workshop, 2004, pp. 304-309. (Pubitemid 40731340)
48. S.-Y. Kung, Y. Wu, and P. A. Chou, "Information exchange in wireless networks with network coding and physical-layer broadcast," Microsoft, Redmond, WA, Tech. Rep. MSR-TR-2004-78, Aug. 2004.
49. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "On the benefits of random linear coding for unicast applications in disruption tolerant networks," in Proc. IEEE WiOPT, 2006, pp. 1-7.
50. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Performance modeling of epidemic routing," Comput. Netw. 51/10, pp. 2859-2891, 2007.
51. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Benefits of network coding in disruption tolerant networks," INRIA, Sophia Antipolis, France, Tech. Rep. 7277, 2010 [Online]. Available: http://hal.archives-ouvertes.fr/ inria-00494473/en/
52. X. Zhang, H. Zhang, and Y. Gu, "Impact of source counter on routing performance in resource constrained DTNs," J. Pervasive Mobile Comput., vol. 7 2 172-188, 2010.