The power of choice in random walks: An empirical study

ACM MSWiM 2006 - Proceedings of the 9th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Volumn 2006, Issue , 2006, Pages 219-228

  Chen, Avin ^a   Krishnamachari, Bhaskar ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

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

Author keywords

Power of choice; Random walks; Wireless networks

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; RANDOM PROCESSES; ROUTERS;

LOAD BALANCING; POWER CHOICE; RANDOM WALKS; WIRELESS NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 33750897776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. M. Alanyali, V. Saligrama, and O. Sava. A random-walk model for distributed computation in energy-limited network. In In Proc. of 1st Workshop on Information Theory and its Application, San Diego, 2006.
2. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. 1999. Unpublished. http://stat-www.berkeley.edu/users/aldous/RWG/book. html.
3. D. J. Aldous. Lower bounds for covering times for reversible Markov chains and random walks on graphs. J. Theoret. Probab., 2(1):91-100, 1989.
4. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th, Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979), pages 218-223. IEEE, New York, 1979.
5. C. Avin and C. Brito. Efficient and robust query processing in dynamic environments using random walk techniques. In Proc. of the third international symposium on Information processing in sensor networks, pages 277-286, 2004.
6. C. Avin and G. Ercal. On the cover time of random geometric graphs. In Proc. Automata, Languages and Programming, 32nd International Colloquium, ICALP05, pages 677-689, 2005.
7. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. In Proc. 26th ACM Symp. Theory of Computing, pages 593-602, 1994.
8. D. Braginsky and D. Estrin. Rumor routing algorthim for sensor networks. In Proc. of the 1st ACM Int. workshop on Wireless sensor networks and applications, pages 22-31. ACM Press, 2002.
9. A. Broder and A. Karlin. Bounds on the cover time, J. Theoret. Probab., 2:101-120, 1989.
10. A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky. The electrical resistance of a graph captures its commute and cover times. In Proc. of the twenty-first annual ACM symposium on Theory of computing, pages 574-586. ACM Press, 1989.
11. C. Cooper and A. Frieze, The cover time of sparse random graphs. In Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), pages 140-147, Baltimore, Maryland, USA, 2003. ACM Press.
12. S. Dolev, E. Schiller, and J. Welch. Random walk for self-stabilizing group communication in ad-hoc networks. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), page 70, IEEE Computer Society, 2002.
13. U. Feige. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algonthms, 6(4):433-438, 1995.
14. U. Feige. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(1):51-54, 1995.
15. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). to appear, 2004.
16. C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24(1-2):67, Feb 2000.
17. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pages 547-566, 1998.
18. M. Jerrum and A. Sinclair. The markov chain monte carlo method: an approach to approximate counting and integration. In Approximations for NP-hard Problems, Dorit Hochbaum ed., pages 482-520. PWS Publishing, Boston, MA, 1997.
19. J. Jonasson. On the cover time for random walks on random graphs. Comb. Probab. Comput., 7(3):265-279, 1998.
20. J. Jonasson and O. Schramm. On the cover time of planar graphs. Electronic Communications in Probability, 5:85-90, 2000.
21. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science pages 482-491, 2003.
22. L. Lovász. Random walks on graphs: A survey. In Combinatorics, Paul Erdos is eighty, Vol. 2 (Keszthely, 1993). volume 2 of Bolyai Soc. Math. Stud., pages 353-397. János Bolyai Math. Soc., Budapest, 1996.
23. P. Matthews. Covering problems for Brownian motion on spheres. Ann. Probab., 16(1):189-199, 1988.
24. M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In R. et al, editor, In Handbook of Randomized Computing, volume I, pages 255-312. Kluwer Academic Press, 2001.
25. R. Motwani and P. Raghuvan. Randomized algorithms. Cambridge University Press, 1995.
26. R. Pemantle. Vertex-reinforced random walk. Probability Theory and Related Fields, 92(1):117-136, 1992.
27. J. S. Rosenthal. Convergence rates for markov chains. SIAM Rev., 37(3):387-405, 1995.
28. N. Sadagopan, B. Krishnamachari, and A. Helmy. Active query forwarding in sensor networks (acquire). Journal of Ad Hoc Networks, 3(1):91-113, January 2005.
29. S. D. Servetto and G. Barrenechea. Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks. In Proc. of the first ACM Int. workshop on Wireless sensor networks and applications, pages 12-21. ACM Press, 2002.
30. A. Sinclair. Improved bounds for mixing rates of markov chains and multicommodity flow. Combinatorics, Probability and Computing, 1:351-370, 1992.
31. S. Volkov. Vertex-reinforced random walk on arbitrary graphs. Annals of Probability, 29(1):66-91, Jan 2001.
32. I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein. Robotic exploration, brownian motion and electrical resistance. Lecture Notes in Computer Science, 1518:116-130, 1998.
33. D. Zuckerman. A technique for lower bounding the cover time. In Proc. of the twenty-second annual ACM symposium on Theory of computing, pages 254-259. ACM Press, 1990.