Category-based routing in social networks: Membership dimension and the small-world phenomenon

Proceedings of the 2011 International Conference on Computational Aspects of Social Networks, CASoN'11

Volumn , Issue , 2011, Pages 102-107

  Eppstein, David ^a   Goodrich, Michael T ^a   Löffler, Maarten ^a   Strash, Darren ^a   Trott, Lowell ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COGNITIVE LOADS; CONNECTED NETWORKS; GREEDY ROUTING; HARVARD; NETWORK PROPERTIES; NETWORK TOPOLOGY; ROUTE MESSAGES; ROUTING MESSAGE; SHORT-PATH; SMALL WORLD PHENOMENON; SOCIAL NETWORKS; UNDERLYING NETWORKS;

ELECTRIC NETWORK TOPOLOGY; MOBILE AD HOC NETWORKS; MOBILE DEVICES; SOCIAL NETWORKING (ONLINE); TELECOMMUNICATION NETWORKS;

NETWORK ROUTING;

EID: 84055199841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASON.2011.6085926     Document Type: Conference Paper

References (26)

1. P. Angelini, F. Frati, and L. Grilli. An algorithm to construct greedy drawings of triangulations. In Graph Drawing, LNCS 5417, pages 26-37. Springer, 2009.
2. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM J. Computing, 14(3):545-568, 1985.
3. H. R. Bernard, P. D. Killworth, M. J. Evans, C. McCarty, and G. A. Shelley. Studying social relations cross-culturally. Ethnology, 27(2):155-179, 1988.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7:609-616, 2001. (Pubitemid 33091058)
5. D. Eppstein and M. T. Goodrich. Succinct greedy graph drawing in the hyperbolic plane. In Graph Drawing, LNCS 5417, pages 14-25. Springer, 2009.
6. G. G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Research report, ISI, 1987.
7. M. Goodrich and D. Strash. Succinct greedy geometric routing in the Euclidean plane. In Algorithms and Computation, LNCS 5878, pages 781-791. Springer, 2009.
8. J. E. Hunter and R. L. Shotland. Treating data collected by the "small world" method as a Markov process. Social Forces, 52(3):321-332, 1974.
9. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In 6th ACM MobiCom, pages 243-254, 2000.
10. P. Killworth and H. Bernard. Reverse small world experiment. Social Networks, 159(1), 1978.
11. J. Kleinberg. The small-world phenomenon: an algorithm perspective. In 32nd ACM STOC, pages 163-170, 2000.
12. R. Kleinberg. Geographic routing using hyperbolic space. In 26th IEEE INFOCOM, pages 1902-1909, 2007.
13. D. E. Knuth. Optimum binary search trees. Acta Informatica, 1:14-25, 1971.
14. C. Korte and S. Milgram. Acquaintance networks between racial groups: Application of the small world method. J. Personality and Social Psychology, 15(2):101-108, 1970.
15. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In 11th CCCG, pages 51-54, 1999.
16. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: of theory and practice. In 22nd ACM PODC, pages 63-72, 2003.
17. T. Leighton and A. Moitra. Some results on greedy embeddings in metric spaces. Discrete Comput. Geom., 44:686-705, 2010.
18. P. Maymounkov. Greedy embeddings, trees, and Euclidean vs. Lobachevsky geometry, 2006. http://pdos.csail.mit.edu/~petar/papers/maymounkov-greedy- prelim.pdf.
19. A. Mei, G. Morabito, P. Santi, and J. Stefa. Social-aware stateless forwarding in pocket switched networks. In 30th IEEE INFOCOM, 2011.
20. S. Milgram. The small world problem. Psychology Today, 1(May):61-67, 1967.
21. R. B. Muhammad. A distributed geometric routing algorithm for ad hoc wireless networks. In 3rd ITNG, pages 961-963, 2007.
22. C. H. Papadimitriou and D. Ratajczak. On a conjecture related to geometric routing. Theor. Comput. Sci., 344:3-14, November 2005. (Pubitemid 41531278)
23. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In 9th ACM MobiCom, pages 96-108, 2003.
24. J. Travers and S. Milgram. An experimental study of the small world problem. Sociometry, 32(4):425-443, 1969.
25. D. J. Watts. Networks, dynamics, and the small-world phenomenon. The American Journal of Sociology, 105(2):493- 527, 1999.
26. D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.