Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Hossmann, Theus ^a   Spyropoulos, Thrasyvoulos ^a   Legendre, Franck ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION LEVEL; COMMUNITY DETECTION; COMPLEX NETWORK ANALYSIS; DELAY TOLERANT NETWORKS; DELIVERY RATIO; DTN ROUTING; END-TO-END CONNECTIVITY; GRAPH STRUCTURES; MOBILITY MODEL; ON-LINE ALGORITHMS; OPTIMAL MAPPING; OPTIMAL OPERATING POINT; PREDICTION TASKS; REAL TRACE; SELF-ORGANIZING WIRELESS; SOCIAL GRAPHS; SPECTRAL GRAPH THEORY;

ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; MAPPING; OPTIMIZATION;

LEARNING ALGORITHMS;

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

References (31)

1. 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 ACM ASPLOS-X, 2002.
2. P. Basu and T. D. C. Little, "Networked parking spaces: architecture and applications," in IEEE VTC, 2002.
3. P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket switched networks and human mobility in conference environments," in ACM WDTN, 2005.
4. E. P. Jones and P. A. Ward, "Routing strategies for delay-tolerant networks," Submitted to ACM CCR, 2006.
5. L. Pelusi, A. Passarella, and M. Conti, "Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks," IEEE Communications Magazine, November 2006.
6. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in ACM WDTN, 2005.
7. A. Lindgren, A. Doria, and O. Schelén, "Probabilistic routing in intermittently connected networks," SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp. 19-20, July 2003.
8. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age matters: efficient route discovery in mobile ad hoc networks using encounter ages," in ACM MobiHoc, 2003.
9. V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, "Diversity of forwarding paths in pocket switched networks," in IMC, 2007.
10. V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot, "Delegation forwarding," in ACM MobiHoc, 2008.
11. T. Spyropoulos, T. Turletti, and K. Obrazcka, "Routing in delay tolerant networks comprising heterogeneous populations of nodes," IEEE TMC, 2009.
12. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, "Search in power-law networks," Phys. Rev. E, vol. 64, no. 4, Sep 2001.
13. M. E. J. Newman, "The structure and function of complex networks," SIAM Review, vol. 45, pp. 167-256, March 2003.
14. E. M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," in ACM MobiHoc, 2007.
15. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay tolerant networks," in ACM MobiHoc, 2008.
16. P. Hui, E. Yoneki, S. Y. Chan, and J. Crowcroft, "Distributed Community Detection in Delay Tolerant Networks," in ACM MobiArch, 2007.
17. L. Ford and D. Fulkerson, Flows in networks. Princeton University Press, 1962.
18. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification (2nd Edition). Wiley-Interscience, November 2000.
19. F. R. K. Chung, Spectral Graph Theory. American Mathematical Society, 1997.
20. D. Liben-Nowell and J. Kleinberg, "The link-prediction problem for social networks," Journal of the American Society for Information Science and Technology, vol. 58, no. 7, pp. 1019-1031, 2007.
21. L. C. Freeman, "Centrality in social networks conceptual clarification," Social Networks, 1979.
22. M. Granovetter, "The strength of weak ties: A network theory revisited," Sociological Theory, vol. 1, pp. 201-233, 1983.
23. M. E. J. Newman, "Analysis of weighted networks," Physical Review E, vol. 70, p. 056131, 2004.
24. M. Musolesi, S. Hailes, and C. Mascolo, "An ad hoc mobility model founded on social network theory," in ACM MSWiM, 2004.
25. D. J. Watts, Small Worlds : The Dynamics of Networks between Order and Randomness. Princeton University Press, November 2003.
26. N. Eagle and A. Pentland, "Reality mining: sensing complex social systems," Personal and Ubiquitous Computing, May 2006.
27. "Measurements from an 802.11b mobile ad hoc network," in IEEE ExponWireless, 2006.
28. A. Scherrer, P. Borgnat, E. Fleury, J. L. Guillaume, and C. Robardet, "Description and simulation of dynamic mobility networks," Elsevier Computer Networks, vol. 52, no. 15, 2008.
29. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, p. 026113, 2004.
30. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Advances in Neural Information Processing Systems 14. MIT Press, 2001, pp. 849-856.
31. S. White and P. Smyth, "A spectral clustering approach to finding communities in graph." in SDM, 2005.