Forward correction and fountain codes in delay-tolerant networks

IEEE/ACM Transactions on Networking

Volumn 19, Issue 1, 2011, Pages 1-13

  Altman, Eitan ^a   De Pellegrini, Francesco ^b  

^a INRIA   (France)

^b CREATE NET   (Italy)

Author keywords

Delay tolerant networks (DTNs); forward correction; fountain codes; mobile ad hoc networks

Indexed keywords

ANALYTICAL APPROACH; DELAY TOLERANT; DELAY TOLERANT NETWORKS; DELIVERY DELAY; FLUID APPROXIMATION; FORWARD CORRECTION; FOUNTAIN CODES; OPTIMIZING PARAMETERS; PERFORMANCE MEASURE; RELAY NODE; REPLICATION MECHANISM;

COMPUTER SIMULATION; FOUNTAINS; MOBILE AD HOC NETWORKS; NETWORK CODING; TELECOMMUNICATION NETWORKS;

AD HOC NETWORKS;

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

References (28)

1. J. J. Metzner, "An improved broadcast retransmission protocol," IEEE Trans. Commun., vol. COMM-32, no. 6, pp. 679-683, Jun. 1984.
2. C. Huitema, "The case for packet level FEC," in Proc. IFIP, Sophia Antipolis, France, Oct. 1996, pp. 109-120.
3. J. Kurose, D. Towsley, and D. Rubenstein, "Real-time reliable multicast using proactive forward error correction," in Proc. IEEE NOSSDAV, Cambridge, U.K., Jul. 8-10, 1998.
4. J. Nonnenmacher, E. Biersack, and D. Towsley, "Parity-based loss recovery for reliable multicast transmission," IEEE/ACM Trans. Netw., vol. 6, no. 4, pp. 349-361, Aug. 1998. (Pubitemid 128747922)
5. E. Altman, T. Basar, and F. De Pellegrini, "Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks," Perform. Eval., vol. 67, no. 4, pp. 299-317, 2010.
6. B. Bollobás, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 2001.
7. S. Burleigh, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss, "Delay-tolerant networking: An approach to interplanetary Internet," IEEE Commun. Mag., vol. 41, no. 6, pp. 128-136, Jun. 2003.
8. T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Commun. Mobile Comput., vol. 2, no. 5, pp. 483-502, Aug. 2002. (Pubitemid 135713186)
9. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of human mobility on opportunistic forwarding algorithms," IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 606-620, Jun. 2007. (Pubitemid 46685740)
10. A. E. Fawal, K. Salamatian, D. C. Y. Sasson, and J. L. Boudec, "A framework for network coding in challenged wireless network," in Proc. MobiSys, Uppsala, Sweden, Jun. 19-22, 2006.
11. W. Feller, Introduction to Probability Theory and Its Applications, 3rd ed. New York: Wiley, 1971.
12. C. Fragouli, J.-Y. L. Boudec, and J. Widmer, "Network coding: An instant primer," Comput. Commun. Rev., vol. 36, no. 1, pp. 63-68, 2006. (Pubitemid 46323585)
13. R. Groenevelt and P. Nain, "Message delay in MANET," in Proc. ACM SIGMETRICS, Banff, AB, Canada, Jun. 6, 2005, pp. 412-413. (Pubitemid 43275455)
14. M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477-486, Aug. 2002. (Pubitemid 35000391)
15. S. Jain, M. Demmer, R. Patra, and K. Fall, "Using redundancy to cope with failures in a delay tolerant network," Comput. Commun. Rev., vol. 35, no. 4, pp. 109-120, 2005. (Pubitemid 46323498)
16. T. Karagiannis, J.-Y. L. Boudec, and M. Vojnovic, "Power law and exponential decay of inter contact times between mobile devices," in Proc. ACM MobiCom, Montréal, QC, Canada, Sep. 9-14, 2007, pp. 183-194.
17. J.-Y. L. Boudec and M. Vojnovic, "Perfect simulation and stationarity of a class of mobility models," in Proc. IEEE INFOCOM, Miami, FL, Mar. 13-17, 2005, pp. 183-194.
18. Y. Lin, B. Liang, and B. Li, "Performance modeling of network coding in epidemic routing," in Proc. MobiSys MobiOpp, San Juan, Puerto Rico, Jun. 11, 2007, pp. 67-74. (Pubitemid 47620943)
19. D. J. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2003.
20. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multi-copy case," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 77-90, Feb. 2008. (Pubitemid 351386757)
21. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. ACM SIGCOMM WDTN, Philadelphia, PA, Aug. 26, 2005, pp. 229-236.
22. Y. Wang, S. Jain, M. Martonosi, and K. Fall, "Erasure-coding based routing for opportunistic networks," in Proc. ACM SIGCOMM WDTN, Philadelphia, PA, Aug. 26, 2005, pp. 229-236. (Pubitemid 41832981)
23. J. Widmer and J.-Y. L. Boudec, "Network coding for efficient communication in extreme networks," in Proc. ACM SIGCOMM WDTN, Philadelphia, PA, Aug. 26, 2005, pp. 284-291. (Pubitemid 41832988)
24. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Performance modeling of epidemic routing," Comput. Netw., vol. 51, pp. 2867-2891, Jul. 2007. (Pubitemid 46678915)
25. A. Weiss and A. Shwartz, Large Deviations for Performance Analysis, ISBN 0-412-06311-5. London, U.K.: Chapman & Hall, 1995.
26. T. Spyropoulos, T. Turletti, and O. Obraczka, "Routing in delay tolerant networks comprising heterogeneous node populations," IEEE Trans. Mobile Comput., vol. 8, no. 8, pp. 1132-1147, Aug. 2009.
27. C. Huffman and V. Pless, Fundamentals of Error Correcting Codes. Cambridge, U.K.: Cambridge Univ. Press, 2003.
28. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A Spielman, "Efficient erasure correcting codes. Information Theory," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001. (Pubitemid 32318090)