Information AboutDsdv |
| CATEGORIES ABOUT DESTINATION-SEQUENCED DISTANCE VECTOR ROUTING | |
| ad hoc routing protocols | |
|
For example the routing table of Node A in this network is Naturally the table contains description of all possible paths reachable by node A, along with the next hop, number of hops and sequence number. SELECTION OF ROUTE If transmitter has received some new information, then it uses the latest sequence number. If sequence number is same better metric is used. Stale entries are those entries that have not been updated for last few time. Such entries as well as the routes using those node as next hop are also deleted. ADVANTAGES DSDV was one of the early algorithms available. It is quite suitable for creating ad hoc networks with small number of nodes. Since no formal specification of this algorithm is present there is no commercial implementation of this algorithm. Many improved forms of this algorithm have been suggested. DISADVANTAGES #DSDV requires a regular update of its routing tables, thus reducing the bandwidth efficiency. #It is not suitable for very large network i.e less scalability. #Whenever topology of network changes, it makes the network unstable for a short period of time. Thus it is not suitable of highly dynamic network. REFERENCES |
|
|