Efficient multicasting for delay tolerant networks using graph indexing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 1386-1394

  Mongiovì, Misael ^a   Singh, Ambuj K ^a   Yan, Xifeng ^a   Zong, Bo ^a   Psounis, Konstantinos ^b  

^a University of California   (United States)

^b University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DATA SOURCE; DELAY TOLERANT NETWORKS; END-TO-END CONNECTIVITY; EXPERIMENTAL ANALYSIS; GRAPH INDEXING; MULTICAST ROUTING; MULTICASTS; NODE MOBILITY; NP-HARD; OPTIMAL SOLUTIONS; PROBLEM INSTANCES; RADIO COVERAGE; REALISTIC SCENARIO; REMOTE COMMUNICATION; SEARCH SPACES; SYNTHETIC DATASETS; TRAFFIC DEMANDS;

COMMUNICATION; NETWORK ROUTING; WIRELESS NETWORKS;

MULTICASTING;

EID: 84861625680     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195503     Document Type: Conference Paper

References (30)

1. S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant network,"vol. 34, August 2004, pp. 145-158.
2. W. Zhao, M. Ammar, and E. Zegura, "Multicasting in delay tolerant networks: semantic models and routing algorithms," in Proc. of WDTN, 2005, pp. 268-275.
3. U. Lee, S. Y. Oh, K.-W. Lee, and M. Gerla, "Relaycast: Scalable multicast routing in delay tolerant networks," in IEEE ICNP, 2008, pp. 218-227.
4. W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in Proc. of MobiHoc, 2009, pp. 299-308.
5. W. Zhao, M. Ammar, and E. Zegura, "A message ferrying approach for data delivery in sparse mobile ad hoc networks," in Proc. of MobiHoc. New York, NY, USA: ACM, 2004, pp. 187-198.
6. B. K. Polat, P. Sachdeva, M. H. Ammar, and E. W. Zegura, "Message ferries as generalized dominating sets in intermittently connected mobile networks," in Proc. of the MobiOpp, 2010, pp. 22-31.
7. I. F. Akyildiz et al., "Interplanetary internet: state-of-the-art and research challenges," Comput. Netw., vol. 43, pp. 75-112, October 2003.
8. Q. Li and D. Rus, "Sending messages to mobile users in disconnected ad-hoc wireless networks," in Proc. of MobiCom, 2000, pp. 44-55.
9. X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, "Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing," in Proc. of MobiCom, 2007, pp. 195-206.
10. J. Leguay, T. Friedman, and V. Conan, "DTN routing in a mobility pattern space," in Proc. of WDTN, 2005, pp. 276-283.
11. C. Liu and J. Wu, "An optimal probabilistic forwarding protocol in delay tolerant networks," in Proc. of MobiHoc, 2009, pp. 105-114.
12. E. Altman et al., "Decentralized stochastic control of delay tolerant networks," in Proc. of INFOCOM, 2009, pp. 1134-1142.
13. R. Groenevelt, P. Nain, and G. Koole, "Message delay in manet,"SIGMETRICS Perform. Eval. Rev., vol. 33, pp. 412-413, June 2005.
14. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: the single-copy case,"IEEE/ACM Trans. Netw., vol. 16, pp. 63-76, February 2008.
15. T. Spyropoulos et al., "Efficient routing in intermittently connected mobile networks: the multiple-copy case," IEEE/ACM Trans. Netw., vol. 16, pp. 77-90, February 2008.
16. S. Merugu, M. Ammar, and E. Zegura, "Routing in space and time in networks with predictable mobility," Georgia Institute of Technology, Tech. Rep., 2004.
17. V. Borrel, M. H. Ammar, and E. W. Zegura, "Understanding the wireless and mobile network space: a routing-centered classification," in Proc. of ACM CHANTS, 2007, pp. 11-18.
18. A. Faragó and V. R. Syrotiuk, "Merit: A unified framework for routing protocol assessment in mobile ad hoc networks," in Proc. of MobiCom. New York, NY, USA: ACM, 2001, pp. 53-60.
19. S. Bhadra and A. Ferreira, "Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks," Ad Hoc Networks and Wireless, pp. 259-270, 2003.
20. M. Mongiovi et al., "SIGMA: a set-cover-based inexact graph matching algorithm," J Bioinform Comput Biol, vol. 8, no. 2, pp. 199-218, 2010.
21. S. Zhang, J. Yang, and W. Jin, "SAPPER: subgraph indexing and approximate matching in large graphs," PVLDB, vol. 3, pp. 1185-1194, September 2010.
22. Y. Chen and Y. Chen, "An Efficient Algorithm for Answering Graph Reachability Queries," in Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. Washington, DC, USA: IEEE Computer Society, 2008, pp. 893-902.
23. R. Jin et al., "Efficiently answering reachability queries on very large directed graphs," in SIGMOD, 2008, pp. 595-608.
24. H. V. Jagadish, "A compression technique to materialize transitive closure," ACM Trans. Database Syst., vol. 15, pp. 558-598, 1990.
25. M. Mongiovi, A. K. Singh, X. Yan, B. Zong, and K. Psounis, "Efficient multicasting for delay tolerant networks using graph indexing,"http://www.cs.ucsb.edu/research/tech reports/reports/2011-07.pdf, UC Santa Barbara, Tech. Rep., 2011.
26. D. M. Yellin, "Algorithms for subset testing and finding maximal sets,"in SODA, 1992, pp. 386-392.
27. R. Diestel, Graph theory, ser. Graduate texts in mathematics. Springer, 2006.
28. M. Piorkowski et al., "CRAWDAD data set (v. 2009-02-24),"http:/ /crawdad.cs.dartmouth.edu/epfl/mobility, Feb. 2009.
29. "GeoLife GPS Trajectories," http://research.microsoft.com/.
30. M. Berkelaar et al., "Mixed Integer Linear Programming (MILP) solver," http://sourceforge.net/projects/lpsolve.