It is difficult to search for a node with known property when we are designing the distributed applications. Searching path in routing, determining resource in the service-oriented architectures (SOAs) and searching files in peer-to-peer (P2P) applications can all be cast as a search problem. To solve this search problem we suggested Random walk-based search algorithms in the dynamic systems such as mobile wireless networks. We can measure the effectiveness and the cost of a random walk-based search algorithm with the help of the excepted number of transmissions required before hitting the target. So, our main goal is to have a low hitting time.
Read more about Biased Random Walks in Uniform Wireless Networks …
