Title :
Searching with Multiple Random Walk Queries
Author :
Dhillon, Santpal S. ; Van Mieghem, Piet
Author_Institution :
Delft Univ. of Technol., Delft
Abstract :
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.
Keywords :
graph theory; queueing theory; Erdos-Renyi random graphs; multiple random walk queries; preferential attachment rule; Ad hoc networks; Erbium; Floods; Land mobile radio; Mobile agents; Mobile communication; Network topology; Peer to peer computing; Power generation; Sampling methods;
Conference_Titel :
Personal, Indoor and Mobile Radio Communications, 2007. PIMRC 2007. IEEE 18th International Symposium on
Conference_Location :
Athens
Print_ISBN :
978-1-4244-1144-3
Electronic_ISBN :
978-1-4244-1144-3
DOI :
10.1109/PIMRC.2007.4394157
