Do neighbor-avoiding walkers walk as if in a small-world network?

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages

  Gianini, Gabriele ^a   Damiani, Ernesto ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION STRUCTURES; COVER TIME; DEGREE OF SEPARATION; DISTRIBUTED ALGORITHM; IN-NETWORK; NETWORKING PROBLEMS; RANDOM WALK; ROUTE MESSAGES; SELF-AVOIDING RANDOM WALKS; SHORT SEQUENCES; SMALL WORLD NETWORKS; SMALL WORLD PHENOMENON; SMALL WORLD TOPOLOGY; SMALL WORLDS; SOCIAL NETWORKS; UNSTRUCTURED NETWORKS;

ACOUSTIC SURFACE WAVE DEVICES; AD HOC NETWORKS; COMPUTER NETWORKS; CUTTING; PARALLEL ALGORITHMS; TECHNICAL PRESENTATIONS; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70349667816     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2009.5072133     Document Type: Conference Paper

References (15)

1. Chen Avin. Random geometric graphs: an algorithmic perspective. PhD thesis, Los Angeles, CA, USA, 2006. Adviser-Judea Pearl and Adviser-Deborah Estrin.
2. Chen Avin. Distance graphs: from random geometric graphs to bernoulli graphs and between. In DIAL M-POMC '08: Proceedings of the fifth international workshop on Foundations of mobile computing, pages 71-78, New York, NY, USA, 2008. ACM.
3. A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky. The electrical resistance of a graph captures its commute and cover times. In STOC '89: Proc.s of 21st annual ACM symposium on Theory of computing, pages 574-586, New York, NY, USA, 1989. ACM.
4. Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker. Making gnutella-like p2p systems scalable. In SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 407-418, New York, NY, USA, 2003. ACM.
5. Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database maintenance. In PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 1-12, New York, NY, USA, 1987. ACM.
6. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, and Nicolas Schabanel. Could any graph be turned into a small-world? Theor. Comput. Sci., 355(1):96-103, 2006.
7. P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst., 21(4):341-374, 2003.
8. Yaacov Fernandess, Antonio Fernańdez, and Maxime Monod. A generic theoretical framework for modeling gossip-based algorithms. SIGOPS Oper. Syst. Rev., 41(5):19-27, 2007.
9. G. Gianini, E. Damiani, and P. Ceravolo. Information dissemination by neighbor-avoiding random walks. In Poster WebSci09, 2009.
10. Gabriele Gianini and Ernesto Damiani. Neighbor-avoiding random walks for information dissemination. In Proceedings of SACC '09, 5th Int. Conf. on Self-organization and Adaptation of Computing and Communications, to be published in CoSIWN Journal, 2009.
11. Barry D. Hughes. Random Walks and Random Environments. Clarendon Press, 1995.
12. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 565, Washington, DC, USA, 2000. IEEE Computer Society.
13. David Kempe, Jon Kleinberg, and Alan Demers. Spatial gossip and resource location protocols. J. ACM, 51(6):943-967, 2004.
14. Jon Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC '00: Proc. 32nd ACM symposium on Theory of computing, pages 163-170, New York, NY, USA, 2000. ACM.
15. Milgram. The small world problem. Psychology Today, 1, (1967).