Download now Free registration required
The notion of ordered walks is acquaint with a Depth-First Search (DFS) that does not rely on topographical or virtual coordinate information and is much more efficient than meager random walks. The welfare of using DFS as the building block of the signaling in MANET routing protocols are epitomized by the introduction of the Ordered walk Search Algorithm (OSA) as a replacement of flooding, which is used as part of the Ordered Walk with Learning (OWL) protocol. Aim to take advantage of the smaller time complexity of BFS and combine it is the low communication complexity of DFS to further improve the efficient of the search through the use of known topology information.
- Format: PDF
- Size: 343.75 KB