1. APPLYING HEURISTIC TECHNIQUE TO AD-HOC ON DEMAND DISTANCE TECTOR ROUTING TO REDUCE BROADCAST.
- Author
-
Nagaraju, A., Ramachandram, S., and Rao, C. R.
- Subjects
- *
AD hoc computer networks , *COMPUTER networks , *WIRELESS communications , *BANDWIDTHS , *ALGORITHMS - Abstract
In this paper we propose an approach to improve the performance of existing flood based routing algorithm Ad-hoc on demand Distance Vector Routing [2] for mobile Ad-hoc wireless networks based on heuristic searching technique. Flooding technique is often used for route discovery in on demand mechanism in MANET such as AODV, DSR. To avoid the problem of wireless broadcast storm, the heuristic searching approach was introduced in the process of finding route from source node to destination node. Heuristic function considers the characteristics of MANET (Bandwidth, number of nodes in the given range). If a node S wants to send a packet to D in the flooding method S sends packet to all its neighbor nodes, but in the proposed scheme tries to reduce broadcasting by finding heuristic measures of the neighbors of S. The heuristic measures are evaluated by applying a function to all neighbors. [ABSTRACT FROM AUTHOR]
- Published
- 2007