The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A technique for lower bounding the cover time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Convergence rates for Markov chains
SIAM Review
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the Cover Time for Random Walks on Random Graphs
Combinatorics, Probability and Computing
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fast and energy efficient sensor data collection by multiple mobile sinks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Delay and capacity in energy efficient sensor networks
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Efficient data propagation strategies in wireless sensor networks using a single mobile sink
Computer Communications
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In recent years random-walk-based algorithms have been proposed for a variety of networking tasks. These proposals include searching, routing, self-stabilization, and query processing in wireless networks, peer-to-peer networks and other distributed systems. This approach is gaining popularity because random walks present locality, simplicity, low-overhead and inherent robustness to structural changes. In this work we propose and investigate an enhanced algorithm that we refer to as random walks with choice. In this algorithm, instead of selecting just one neighbor at each step, the walk moves to the next node after examining a small number of neighbors sampled at random. Our empirical results on random geometric graphs, the model best suited for wireless networks, suggest a significant improvement in important metrics such as the cover time and load-balancing properties of random walks. We also systematically investigate random walks with choice on networks with a square grid topology. For this case, our simulations indicate that there is an unbounded improvement in cover time even with a choice of only two neighbors. We also observe a large reduction in the variance of the cover time, and a significant improvement in visit load balancing.