Published on Jan 09, 2023
A recurrent problem when designing distributed applications is to search for a node with known property. File searching in peer-to-peer (P2P) applications, resource discovery in service-oriented architectures (SOAs), and path discovery in routing can all be cast as a search problem. Random walk-based search algorithms are often suggested for tackling the search problem, especially in very dynamic systems-like mobile wireless networks.
The cost and the effectiveness of a random walk-based search algorithm are measured by the excepted number of transmissions required before hitting the target. Hence, to have a low hitting time is a critical goal
Random walk search has a more fine-grained control of the search space, a higher adaptive ness to termination conditions, and can naturally cope with failures or voluntary disconnections of nodes. Examples of concrete exploitations of random walks in wireless networks are found in the context of routing protocols for MANET
This paper studies the effect of biasing random walk toward the target on the hitting time. For a walk running over a network with uniform node distribution, a simple upper bound that connects the hitting time to the bias level is obtained.
The key result is that even a modest bias level is able to reduce the hitting time significantly. This paper also proposes a search protocol for mobile wireless networks, whose results are interpreted in the light of the theoretical study. The proposed solution is for unstructured wireless mobile networks
Data forwarding module.
Link failure module.
Biased Rand-walk module
System : Pentium IV 2.4 GHz.
Hard Disk : 40 GB.
Floppy Drive : 1.44 Mb.
Monitor : 15 VGA Colour.
Mouse : Logitech.
RAM : 256 Mb
Operating system :- Windows XP Professional
Front End : - Asp .Net 2.0.
Coding Language :- Visual C# .Net