jumps for wireless ad hoc networks
Random walk with long jumps for wireless ad hoc networks
FREE-DOWNLOAD [PDF] R Beraldi – Ad Hoc Networks, 2009
This paper considers a random walk-based search algorithm in which the random walk occasionally
makes longer jumps. The algorithm is tailored to work over wireless networks with uniform node
distribution. In a classical random walk each jump has the same mean length. On the