Searching with Multiple Random Walk Queries

We analyze the performance of searching with multiple random walk queries on Erdos-Renyi (ER) random graphs and power law graphs generated using preferential attachment. Our simulations show that searching with multiple random walk queries reduces message overhead as compared to flooding with sequence numbers. Moreover, the performance of searching by using multiple random walk queries is better in ER random graphs than in power law graphs grown by preferential attachment rule.

[1]  S. S. Dhillon,et al.  Comparison of Random Walk Strategies for Ad Hoc Networks , 2007 .

[2]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[3]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Jennifer L. Welch,et al.  Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[6]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Alan M. Frieze,et al.  Crawling on web graphs , 2002, STOC '02.

[8]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Johan Jonasson.  On the Cover Time for Random Walks on Random Graphs , 1998, Comb. Probab. Comput..

[10]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[11]  Alan M. Frieze,et al.  The cover time of the preferential attachment graph , 2007, J. Comb. Theory, Ser. B.

[12]  Roy Friedman,et al.  RaWMS -: random walk based lightweight membership service for wireless ad hoc network , 2006, MobiHoc '06.

[13]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[14]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[16]  Roy Friedman,et al.  RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks , 2008, TOCS.

[17]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[18]  Miguel Castro,et al.  Peer-to-peer overlays: structured, unstructured, or both? , 2004 .

[19]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.

[20]  Piet Van Mieghem,et al.  Degree distribution and hopcount in wireless ad-hoc networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[21]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.