Searching with multiple random walk queries

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Volumn , Issue , 2007, Pages

  Dhillon, Santpal S ^a   Van Mieghem, Piet ^a  

^a Department of Microelectronics   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; QUERY PROCESSING;

MESSAGE OVERHEAD; MULTIPLE RANDOM WALK QUERIES;

MOBILE RADIO SYSTEMS;

EID: 44349127896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PIMRC.2007.4394157     Document Type: Conference Paper

References (19)

1. B.J. Kim, C.N. Yoon, S.K. Han and H. Jeong, "Path finding strategies in scale-free networks", Physical Review E, vol. 65, 2002.
2. M. Castro, M. Costa and A. Rowstron, Peer-to-peer overlays: structured, unstructured or both?, Technical Report MSR-TR-2004-73, 2004.
3. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham and S. Shenker, "Making Gnutella-like P2P Systems Scalable", Proc. SIGCOMM Conference, 2003.
4. Q. Lv, P. Cao, E. Cohen, K. Li and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks", Proc. 16th ACM International Conference on Supercomputing, 2002.
5. S. Dolev, E. Schiller and J. Welch, "Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks", Proc. 21st Symposium on Reliable Distributed Systems, 2002.
6. J. Jonasson, "On the cover time of random walks on random graphs", Combinatorics, Probability and Computing, 7, pp. 265-279, 1998.
7. L. Lovász, "Random Walks on Graphs: A Survey", Combinatorics, Paul Erdos is Eighty (Volume 2), János Bolyai Mathematical Society Budapest, pp. 353-398, 1996.
8. L. A. Adamic, R. M. Lukose, A. R. Puniyani and B. A. Huberman, "Search in power-law networks", Physical Review E, vol. 64, 2001.
9. B. Bollobas, Random Graphs, Academic Press, 1985.
10. C. Gkantsidis, M. Mihail and A. Saberi, "Random walks in peer-to-peer networks: Algorithms and Evaluation", Performance Evaluation 63, pp. 241-263, 2006.
11. R. Hekmat and P. Van Mieghem, "Degree Distribution and Hopcount in Wireless Ad-hoc Networks", Proc. 11th IEEE ICON, 2003.
12. Z. Bar-Yossef, R. Friedman and G. Kliot, "RaWMS- Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks", Proc. MobiHoc, pp. 238-249, 2006.
13. S.S. Dhillon and P. Van Mieghem, "Comparison of Random Walk strategies for Ad-hoc Networks", Proc. 6th Annual Mediterranean Ad Hoc Networking Workshop, pp. 204-211, 2007.
14. C. Cooper and A. Frieze, "Crawling on web graphs", Proc. 34th annual ACM symposium on Theory of computing, pp. 419 - 427, 2002.
15. N. Bisnik and A. A. Abouzeid, "Optimizing Random Walk Search Algorithms in P2P Networks", Computer Networks, 2006.
16. S.R. Das, C.E. Perkins and E. E. Royer, "Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks", Proc. INFOCOM, pp. 3-12, 2000.
17. C. Cooper and A. Frieze, "The cover time of the preferential attachment graph", Journal of Combinatorial Theory, Series B 97, 269-290.
18. A. Barabási, R. Albert and H. Jeong, "Mean-field theory for scale-free random networks", PhysicaA 272, pp. 173-187, 1999.
19. S.S. Dhillon and P. Van Mieghem, "Performance analysis of the AntNet algorithm", Computer Networks, vol 51, Issue 8, pp. 2104-2125, 2007.