Erasure-coding based routing for opportunistic networks

Proceedings of ACM SIGCOMM 2005 Workshops: Conference on Computer Communications

Volumn , Issue , 2005, Pages 229-236

  Wang, Yong ^a   Jain, Sushant ^b   Martonosi, Margaret ^a   Fall, Kevin ^c  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c INTEL RESEARCH   (United States)

Author keywords

Delay tolerant network; Erasure coding; Routing

Indexed keywords

DELAY TOLERANT NETWORK; ERASURE CODING; ERASURE-CODING BASED FORWARDING; ROUTING;

ALGORITHMS; DECISION MAKING; ENCODING (SYMBOLS); FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; REDUNDANCY;

DELAY CIRCUITS;

EID: 29244484256     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed Content Delivery Across Adaptive Overlay Networks. In Procs. of ACM SIGCOMM, 2002.
2. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Pocket Switched Networks: Real-World Mobility and its Consequences for Opportunistic Forwarding. Technical Report UCAM-CL-TR-617, University of Cambridge, Computer Laboratory, February 2005.
3. M. Grossglauser and D. Tse. Mobility Increases the Capacity of Ad-hoc Wireless Networks. Transactions on Networking, vol. 10, no. 4, Aug. 2002.
4. Hakim Weatherspoon and John Kubiatowicz. Erasure Coding vs. Replication: A Quantitative Comparison. In Procs. of IPTPS, 2002.
5. S. Jain, M. Demmer, R. Patra, and K. Fall. Using Redundancy to Cope with Failures in a Delay Tolerant Network. In Procs. of ACM SIGCOMM, 2005.
6. S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Procs. of ACM SIGCOMM, 2004.
7. S. Jain, R. Shah, W. Brunette, G. Borriello, and S. Roy. Exploiting Mobility for Energy Efficient Data Collection in Sensor Networks. In Procs. of WiOpt, 2004.
8. 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 Procs. of ACM ASPLOS, 2002.
9. A. Lindgren, A. Doria, and O. Schelén. Probabilistic Routing in Intermittently Connected Networks. In Procs. of SAPIR, 2004.
10. P. Maymounkov and D. Mazieres. Rateless Codes and Big Downloads. In Procs. of IPTPS, 2003.
11. M. Mitzenmacher. Digital Fountains: A Survey and Look Forward. Information Theory Workshop, 2004.
12. R. J. Sterfling. Approximation Theorems of Mathematical Statistics. Wiley Series in Probability and Statistics, 1980.
13. Sukun Kim and Rodrigo Fonseca and David Culler. Reliable Transfer on Wireless Sensor Networks. In Procs. of IEEE SECON, 2004.
14. A. Vahdat and D. Becker. Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report CS-200006, Duke University, 2000.
15. P. Zhang, C. M. Sadler, S. Lyon, and M. Martonosi. Hardware Design Experiences in ZebraNet. In Procs. of ACM Sensys, 2004.