Gerhard Haßlinger
Search Methods in
Dynamic Wireless Networks
Network exploration by flooding & random walks
–
q Flooding is exhaustive for all neighbors up to a distance d or
q     time to live (TTL);
q     Parallel search; large amount of messages spread in all directions
q  Random walks follow some probabilistic winding route
q