On benefits of random linear coding for unicast applications in disruption tolerant networks

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006

Volumn , Issue , 2006, Pages

  Zhang, Xiaolan ^a   Neglia, Giovanni ^b   Kurose, Jim ^a   Towsley, Don ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH CONSTRAINT; DISRUPTION TOLERANT NETWORKS; LINEAR COMBINATIONS; PERFORMANCE METRICES; POISSON ARRIVAL PROCESS; RANDOM LINEAR CODING; UNICAST APPLICATIONS; UNICAST COMMUNICATION;

AD HOC NETWORKS; BANDWIDTH; COMPUTER SIMULATION; OPTIMIZATION;

DELAY TOLERANT NETWORKS;

EID: 84886529135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666505     Document Type: Conference Paper

References (19)

1. S. Acedanski, S. Deb, M. Médard, and R. Koetter. How good is random linear coding based distributed networked storage. In Netcod, 2005
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. on Information Theory, 46:1204-1216
3. P. A. Chou, Y. Wu, and K. Jain. Practical network coding. Allerton Conference on Communication, Control, and Computing, October
4. S. Deb and M. Médard. Algebraic gossip: A network coding approach to optimal multiple rumor mongering. 2004. Proc. Allerton
5. C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. Infocom, 2005
6. R. Groenevelt, P. Nain, and G. Koole. The message delay in mobile ad hoc networks. In Performance, October 2005
7. Z. J. Haas and T. Small. A new networking model for biological applications of ad hoc sensor networks. to appear in IEEE/ACM Transactions on Networking
8. T. Ho, R. Hoetter, M. Médard, D. R. Karger, and M. Effros. The benefits of coidng over routing in a randomized setting. In IEEE International Symposium on Information Theory, 2003
9. Sushant Jain, Michael Demmer, Rabin Patra, and Kevin Fall. Using redundancy to cope with failures in a delay tolerant network. In SIGCOMM, 2005
10. S. Katti, D. Katabi, W. Hu, R. Hariharan, and M. Médard. The importance of being opportunistic: Practical network coding for wireless environments. In Allerton Conference on Communication, Control, and Computing, Sep 2005
11. David Kempe, Jon Kleinberg, and Amit Kumar. Connectivity and inference problems for temporal networks. In Journal of Computer and System Sciences, Volume 64,Special issue on STOC 2000, 2002
12. T. Small and Z. J. Haas. Resource and performance tradeoffs in delay-tolerant wireless networks. In ACM workshop on Delay Tolerant Networking, 2005
13. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In ACM workshop on Delay Tolerant Networking, 2005
14. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke Univ., 2000
15. Y. Wang, S. Jain, M. Martonosi, and K. Fall. Erasure-coding based routing for opportunistic networks. ACM workshop on Delay Tolerant Networking, 2005
16. J. Widmer and J.-Y. Le Boudec. Network coding for efficient communication in extreme networks. WDTN, 2005
17. J. Widmer, C. Fragouli, and J.-Y. Le Boudec. Energy-efficient broadcasting in wireless ad-hoc networks. In Netcod 2005, April 2005
18. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. On the benefits of random linear coding for unicast applications in disruption tolerant networks. Technical Report 2006-15, UMASS Computer Science. ftp://gaia. cs. umass. edu/pub/Zhang05 netcoding TR. pdf
19. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. In IFIP Networking, 2006.