• DocumentCode
    2291639
  • Title

    Searching with Multiple Random Walk Queries

  • Author

    Dhillon, Santpal S. ; Van Mieghem, Piet

  • Author_Institution
    Delft Univ. of Technol., Delft
  • fYear
    2007
  • fDate
    3-7 Sept. 2007
  • Firstpage
    1
  • Lastpage
    5
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/PIMRC.2007.4394157
  • Filename
    4394157
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2291639