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
Adventures in stochastic processes
Adventures in stochastic processes
Measuring index quality using random walks on the Web
WWW '99 Proceedings of the eighth international conference on World Wide Web
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Flooding strategy for target discovery in wireless networks
Wireless Networks
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
Hybrid overlay structure based on random walks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
It is a well-known property of random walks that nodes with higher degree are visited more frequently. Based on this property, we propose the use of cluster-heads (high-degree nodes) together with a simple push-pull mechanism to enhance the performance of random walk-based querying: events are pushed towards high-degree nodes (cluster-heads) and pulled from the cluster-heads by a random-walk originated at the sink. Following this simple mechanism, we show that having even a small percentage of cluster-heads (degree-heterogeneity) can provide significant improvements in query performance. For linear topologies, we use connections between random walks and electrical resistances to prove that placing uniformly a fraction of 4/5k cluster-heads (where 2k is the degree of each cluster-head), can reduce querying costs from 驴(n 2) to 驴(n 2/k 2), an improvement of 驴(k 2). For more realistic two-dimensional topologies, we use Markov chain analysis and simulations to show a similar trend--using about 10% of the nodes as cluster-heads provides a query cost improvement between 30% and 70% depending on the coverage of the high-degree nodes.