Most secure updating routing information
This article discusses proposed routing protocols for these ad hoc networks.These routing protocols can be divided into two categories: table-driven and on-demand routing based on when and how the routes are discovered.
Storing predecessor and successor in the table is beneficial in detecting loops and avoiding counting-to-infinity problems.
The following sections discuss some of the existing table-driven ad hoc routing protocols.
The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm [Perkins94]is based on the idea of the classical Bellman-Ford Routing Algorithm with certain improvements.
So, the update is both time-driven and event-driven.
The routing table updates can be sent in two ways:- a "full dump" or an incremental update.