an ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network. in ad hoc networks, nodes are not familiar with the topology of their networks. instead, they have to discover it: typically, a new node announces its presence and listens for announcements broadcast by its neighbors. each node learns about others nearby and how to reach them, and may announce that it too can reach them. note that in a wider sense, ad hoc protocol can also be used literally, to mean an improvised and often impromptu protocol established for a specific purpose. the following is a list of some ad hoc network routing protocols. == table-driven (proactive) routing== this type of protocols maintains fresh lists of destinations and their routes by periodically distributing routing tables throughout the network. the main disadvantages of such algorithms are: # respective amount of data for maintenance. # slow reaction on restructuring and failures. examples of proactive algorithms are: * optimized link state routing protocol (olsr) optimized link state routing protocol rfc 3626. * babel rfc 6126 * destination sequence distance vector (dsdv) ==on-demand (reactive) routing== this type of protocols finds a route on demand by flooding the network with route request packets. the main disadvantages of such algorithms are: # high latency time in route finding. # excessive flooding can lead to network clogging. examples of on-demand algorithms are: * ad hoc on-demand distance vector(aodv) (rfc 3561)c. perkins, e. royer and s. das: ad hoc on-demand distance vector (aodv) routing, rfc 3561 * dynamic source routing (rfc 4728)david johnson, david maltz, yih-chun hu: the dynamic source routing protocol for mobile ad hoc networks for ipv4, rfc 4728david b. johnson, david a. maltz: dynamic source routing in ad hoc wireless networks, mobile computing, thomasz imielinski and hank korth (editors), vol. 353, chapter 5, pp. 153â181, kluwer academic publishers, 1996 * flow state in the dynamic source routingyih-chun hu, david b. johnson, david a. maltz: flow state in the dynamic source routing protocol internet draft, work in progress, june 2001. * power-aware dsr-basedd. djenouri, n. badache. on eliminating packet droppers in manet: a modular solution, ad hoc networks journal, vol 7, issue 6, pp 1243â1258, elsevier publisher, august 2009. ==hybrid (both proactive and reactive) routing== this type of protocol combines the advantages of proact
Ad_hoc_routing_protocols Wireless_networking