DTN routing using explicit and probabilistic routing table states

Wireless Networks

Volumn 17, Issue 5, 2011, Pages 1305-1321

  Acer, Utku Günay ^a   Kalyanaraman, Shivkumar ^b   Abouzeid, Alhussein A ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b IBM INDIA RESEARCH LAB   (India)

^c RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Delay tolerant networks; Probabilistic routing; Routing state; Weak state

Indexed keywords

AVERAGE DELAY; COMPUTER COMMUNICATIONS; DELAY TOLERANT NETWORKS; DELIVERY RATIO; DTN ROUTING; EXPLICIT INFORMATION; INTERMITTENT CONNECTIVITY; MESSAGE TRANSFERS; MOBILITY PATTERN; NODE MOBILITY; PROBABILISTIC ROUTING; ROUTING STATE; ROUTING TABLE; STATE INFORMATION; STATE REALIZATIONS; WEAK STATE;

COMMUNICATION SYSTEMS; TELECOMMUNICATION NETWORKS;

NETWORK ROUTING;

EID: 79959528003     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-011-0350-y     Document Type: Article

References (33)

1. Acer, U. G.; Abouzeid A.; & Kalyanaraman, S. (2009). An evaluation of weak state mechanism design for indirection in dynamic networks. INFOCOM'09: The 28th IEEE international conference on computer communications (pp. 1125-1133).
2. Acer, U. G.; Kalyanaraman S.; & Abouzeid, A. A. (2007). Weak state routing for large scale dynamic networks. In MobiCom '07: Proceedings of the 13th annual ACM international conference on mobile computing and networking (pp. 290-301).
3. A. Balasubramanian B. Levine A. Venkataramani 2007 Dtn routing as a resource allocation problem SIGCOMM Computer Communication Review 37 4 373 384 10.1145/1282427.1282422 (Pubitemid 350239799)
4. C. Bettstetter H. Hartenstein X. Perez Costa 2004 Stochastic properties of the random waypoint mobility model Wireless Networks 10 5 555 567 10.1023/B:WINE.0000036458.88990.e5
5. B.H. Bloom 1970 Space/time trade-offs in hash coding with allowable errors Communications of the ACM 13 7 422 426 0195.47003 10.1145/362686.362692
6. Burgess, J.; Gallagher, B.; Jensen, D.; & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. INFOCOM 2006 25th IEEE international conference on computer communications proceedings (pp. 1-11).
7. Clark, D. D. (1988). The design philosophy of the DARPA internet protocols. SIGCOMM '88: Symposium proceedings on communications architectures and protocols (pp. 106-114).
8. Daly, E. M.; & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. MobiHoc '07, pp. 32-40.
9. A. Ferreira 2004 Building a reference combinatorial model for manets IEEE Network 18 5 24 29 10.1109/MNET.2004.1337732
10. M. Grossglauser D.N. Tse 2002 Mobility increases the capacity of ad hoc wireless networks IEEE/ACM Transactions on Networking 10 4 477 486 10.1109/TNET.2002.801403 (Pubitemid 35000391)
11. Z. J. Haas J. Y. Halpern L. Li 2006 Gossip-based ad hoc routing IEEE/ACM Transactions on Networking 14 3 479 491 10.1109/TNET.2006.876186 (Pubitemid 43985040)
12. E. Hyytia P. Lassila J. Virtamo 2006 Spatial node distribution of the random waypoint mobility model with applications IEEE Transactions on Mobile Computing 5 6 680 693 10.1109/TMC.2006.86
13. S. Jain K. Fall R. Patra 2004 Routing in a delay tolerant network Computer Communication Review 34 4 145 157 10.1145/1030194.1015484 (Pubitemid 40954876)
14. P. Ji Z. Ge J. Kurose D. Towsley 2007 A comparison of hard-state and soft-state signaling protocols IEEE/ACM Transactions on Networking 15 2 281 294 10.1109/TNET.2007.892849 (Pubitemid 46621610)
15. Johnson, D. B.; & Maltz, D. A. (1996). Dynamic source routing in Ad Hoc wireless networks. Mobile Computing, Vol. 353. Kluwer Academic Publishers.
16. Jones, E. P. C.; Li, L.; & Ward, P. A. S. (2005). Practical routing in delay-tolerant networks. In WDTN '05: Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 237-243). (Pubitemid 41832982)
17. Karp, B.; & Kung, H. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the annual international conference on mobile computing and networking, MOBICOM (pp. 243-254). (Pubitemid 32024699)
18. Keränen, A.; Ott, J.; & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. In SIMUTools'09: Proceedings of the 2nd international conference on simulation tools and techniques, ICST.
19. A. Kumar J. Xu E.W. Zegura 2005 Efficient and scalable query routing for unstructured peer-to-peer networks Proceedings of IEEE INFOCOM 2 1162 1173 (Pubitemid 41390769)
20. J. LeBrun C.N. Chuah D. Ghosal M. Zhang 2005 Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks IEEE Vehicular Technology Conference 61 2289 2293 (Pubitemid 41424399)
21. Leontiadis, I.; & Mascolo, C. (2007). Geopps: Geographical opportunistic routing for vehicular networks. World of Wireless, Mobile and Multimedia Networks, WoWMoM, pp. 1-6.
22. Lindgren, A.; Doria, A.; & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. Workshop on Service Assurance with Partial and Intermittent Resources, SAPIR 2004, pp 239-54.
23. Liu, C.; & Wu, J. (2008). Routing in a cyclic mobispace. MobiHoc '08, pp. 351-360.
24. Perkins, C. E.; & Royer, E. (1999). Ad-hoc on-demand distance vector routing. Second IEEE workshop on mobile computing systems and applications. WMCSA'99. (pp. 90-100).
25. Piorkowski, M.; Sarafijanovic-Djukic, N.; & Grossglauser, M. (2009). CRAWDAD data set epfl/mobility (v. 2009-02-24). Downloaded from http://crawdad.cs.dartmouth.edu/epfl/mobility.
26. Piorkowski, M.; Sarafijanovic-Djukic, N.; & Grossglauser, M. (2009). A parsimonious model of mobile partitioned networks with clustering. 1st international conference on communication systems and networks and workshops, COMSNETS 2009.
27. S. Raman S. McCanne 1999 Model, analysis, and protocol framework for soft state-based communication Computer Communication Review 29 4 15 25 10.1145/316194.316202 (Pubitemid 32081852)
28. Seth, A.; Kroeker, D.; Zaharia, M.; Guo, S.; & Keshav, S. (2006). Low-cost communication for rural internet kiosks using mechanical backhaul. Proceedings of the annual international conference on mobile computing and networking, MOBICOM (pp. 334-345). (Pubitemid 44758727)
29. R.C. Shah S. Roy S. Jain W. Brunette 2003 Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks Ad Hoc Networks 1 2-3 215 233 10.1016/S1570-8705(03)00003-9 (Pubitemid 40421410)
30. Spyropoulos, T.; Psounis, K.; & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM 2005 workshops: Conference on computer communications (pp. 252-259). (Pubitemid 41832984)
31. T. Spyropoulos K. Psounis C.S. Raghavendra 2008 Efficient routing in intermittently connected mobile networks: The multiple-copy case IEEE/ACM Transactions on Networking 16 1 77 90 10.1109/TNET.2007.897964 (Pubitemid 351386757)
32. Vahdat, A.; & Becker, D. (2000). Epidemic routing for partially connected Ad Hoc networks. Tech. rep.; Department of Computer Science, Duke University, Durham, NC, http://citeseer.ist.psu.edu/vahdat00epidemic.htm.
33. Zhao, W.; Ammar, M.; & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the international symposium on mobile Ad Hoc networking and computing (MobiHoc) (pp. 187-198).