Gerhard Haßlinger
Search Methods in
Dynamic Wireless Networks
Conclusions
–
q   Random walks are useful for search and routing in networks
q     with unreliable or incomplete information on target nodes
q   Random walks outperform flooding for large hop distances
q   Many options for combining routing, flooding & random walks 
q     for improved performance in different scenarios
q   Transient analysis yields accurate evaluation of random walks
q      - for the basic case and many variants
q      - is scalable for networks of large size
q      - bounds can be given on convergence behaviour