Enhanced delegation forwarding in delay tolerant networks

International Journal of Parallel, Emergent and Distributed Systems

Volumn 26, Issue 5, 2011, Pages 331-345

  Chen, Xiao ^a   Shen, Jian ^b   Wu, Jie ^c  

^a Texas State University   (United States)

^b TEXAS STATE UNIVERSITY   (United States)

^c Temple University   (United States)

Author keywords

Delay tolerant networks; Forwarding algorithms; Routing; Traces

Indexed keywords

CRITICAL ISSUES; DELAY TOLERANT NETWORKS; DELIVERY RATIO; FORWARDING ALGORITHMS; LOW LATENCY; LOWER COST; RESEARCH COMMUNITIES; ROUTING; TRACES; WIRELESS MOBILE NETWORKS;

ALGORITHMS; PROBABILITY DENSITY FUNCTION; ROUTERS; WIRELESS NETWORKS;

COST REDUCTION;

EID: 81255177037     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760903548317     Document Type: Article

References (21)

1. A. Broder, A. Kirsh, R. Kumar, M. Mitzenmacher, E. Upfal, and S. Vassilvitskii, The Hiring Problem and Lake Wobegon Strategies, Proceedings of ACM-SIAM SODA, 2008.
2. 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. 6(6) (2007), pp. 606-620. (Pubitemid 46685740)
3. X.C. Chen and A.L. Murphy, Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks, Proceedings of the Workshop on Principles of Mobile Computing (POMC), August, 2001, pp. 21-27.
4. CRAWDAD. A community resource for archiving wireless data at dartmouth. Available at http://crawdad.cs.dartmouth.edu
5. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages, Proceedings of ACM MobiHoc, 2003.
6. V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, Diversity offorwardingpaths inpocket switched networks, Proceedings of ACM/SIGCOMM IMC, 2007, pp. 41-50.
7. V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot, Delegation Forwarding., Proceedings of Mobi Hoc, May 2008, pp. 251-259.
8. J. Ghosh, S.J. Philip, and C. Qiao, Sociological Orbit Aware Location Approximation and Routing (SOLAR) in MANET, Proceedings of ACM Mobi Hoc, 2005.
9. S. Jain, K. Fall, and R. Patra, Routing in a Delay Tolerant Network, Proceedings of ACM SIGCOMM, 2004.
10. E.P.C. Jones and P.A.S. Ward, Routing Strategies for Delay-Tolerant Networks, Proceedings of ACM SIGCOMM, 2004.
11. P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, and D. Rubenstein, Energy-Efficient Computing for Wildlife Tracking: Design Tradesoffs and Early Experiences with Zebranet, Proceedings of ASPLOS-X, 2002, pp. 96-107. (Pubitemid 44892226)
12. J. Leguay, T. Friedman, and V. Conan, DTN Routing in a Mobility Pattern Space, Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking, 2005.
13. A. Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, Lect. Notes Comput. Sci. 3126 (2004), pp. 239-254.
14. C. Liu and J. Wu, Routing in a Cyclic MobiSpace., Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobi Hoc), 2008.
15. C. Liu and J. Wu, An Optimal Probabilistically Forwarding Protocol in Delay Tolerant Networks, Proceedings of 10th ACM International Symposium Mobile Ad Hoc Networking and Computing (Mobi Hoc), 2009.
16. S. Merugu, M. Ammar, and E. Zegura, Routing in Space and Time inNetwork with Predictable Mobility, Technical report: GIT-CC-04-07, College of Computing, Georgia Institute of Technology, Atlantic Drive, Atlanta, GA 30332, 2004.
17. T. Spyropoulos, K. Psounis, and C.S. Raghavendra, Single-Copy Routing in Intermittently Connected Mobile Networks, Proceedings of IEEE Secon, 2004.
18. T. Spyropoulos, K. Psounis, and C.S. Raghavendra, Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility, Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workships (PERCOMW), 2007.
19. M.M.B. Tariq, M. Ammar, and E. Zegura, Message Ferry Route Design for Sparse Ad Hoc Networks with Mobile Nodes., Proceedings of ACM Mobi Hoc, 2005.
20. A. Vahdat and D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks., Technical Report CS-200006, Duke University, Durham, NC 27708, 2000.
21. J. Wu, S. Yang, and F. Dai, Logarithmic store-carry-forward routing in mobile ad hoc networks, IEEE Trans. Parallel Distribut. Syst. 18(6) (2007), pp. 735-748. (Pubitemid 46767738)