Editing List of ad hoc routing protocols

{{Short description|none}}
An '''ad hoc routing protocol''' is a convention, or standard, that controls how [[Node (networking)|nodes]] decide which way to [[routing|route]] [[Packet (information technology)|packets]] between computing devices in a [[mobile ad hoc network]].

In ad hoc networks, nodes are not familiar with the [[Network topology|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 (computing)|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|Optimized Link State Routing Protocol (OLSR)]] [https://tools.ietf.org/html/rfc3626 RFC 3626], [https://tools.ietf.org/html/rfc7181 RFC 7181].
* [[Babel (protocol)|Babel]] [https://tools.ietf.org/html/rfc6126 RFC 6126]
* [[Destination-Sequenced Distance Vector routing|Destination Sequence Distance Vector (DSDV)]]
* [[DREAM (protocol)|DREAM]]
* [[B.A.T.M.A.N.]]

==On-demand (reactive) routing==
This type of protocol 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:
* ABR - [[Associativity-Based Routing]]<ref>[[Chai Keong Toh]]  Ad Hoc Mobile Wireless Networks, Prentice Hall Publishers, 2002. {{ISBN|978-0-13-007817-9}}</ref>
* [[Ad hoc On-Demand Distance Vector Routing|Ad hoc On-demand Distance Vector(AODV)]] ([https://tools.ietf.org/html/rfc3561 RFC 3561])<ref>C. Perkins, E. Royer and S. Das: [[rfc:3561|''Ad hoc On-demand Distance Vector (AODV) Routing'']], [[rfc:3561|RFC 3561]]</ref>
* [[Dynamic Source Routing]] ([https://tools.ietf.org/html/rfc4728 RFC 4728])<ref>David Johnson, David Maltz, Yih-Chun Hu: [[rfc:4728|''The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks for IPv4'']], [[rfc:4728|RFC 4728]]</ref><ref>{{Cite book |doi = 10.1007/978-0-585-29603-6_5|chapter = Dynamic Source Routing in Ad Hoc Wireless Networks|title = Mobile Computing|volume = 353|pages = 153–181|series = The Kluwer International Series in Engineering and Computer Science|year = 1996|last1 = Johnson|first1 = David B.|last2 = Maltz|first2 = David A.|isbn = 978-0-7923-9697-0}}</ref>
* Power-Aware DSR-based<ref>{{Cite journal |doi = 10.1016/j.adhoc.2008.11.003|title = On eliminating packet droppers in MANET: A modular solution|journal = Ad Hoc Networks|volume = 7|issue = 6|pages = 1243–1258|year = 2009|last1 = Djenouri|first1 = Djamel|last2 = Badache|first2 = Nadjib}}</ref>
* Link-life base routing protocols <ref>{B. S. Manoj, R. Ananthapadmanabha and C. S. R. Murthy, "Link life based routing protocol for ad hoc wireless networks," Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495), Scottsdale, AZ, USA, 2001, pp. 573-576, {{doi|10.1109/ICCCN.2001.956324}}.}</ref>

==Hybrid (both proactive and reactive) routing==
This type of protocol combines the advantages of proactive and reactive routing. The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. The choice of one or the other method requires predetermination for typical cases. The main disadvantages of such algorithms are:

# Advantage depends on number of other nodes activated.
# Reaction to traffic demand depends on gradient of traffic volume.
Examples of hybrid algorithms are:
* [[Zone Routing Protocol|ZRP]] (Zone Routing Protocol) ZRP uses IARP as pro-active and IERP as reactive component.
* ZHLS (Zone-based Hierarchical Link State Routing Protocol) <ref name=":0">{{Cite journal |doi = 10.1109/49.779923|title = A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks|journal = IEEE Journal on Selected Areas in Communications|volume = 17|issue = 8|pages = 1415–1425|year = 1999|last1 = Joa-Ng|first1 = M.|last2 = i-Tai Lu}}</ref>

==Hierarchical routing protocols==
With this type of protocol the choice of proactive and of reactive routing depends on the hierarchic level in which a node resides. The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding on the lower levels. The choice for one or the other method requires proper attributation for respective levels. The main disadvantages of such algorithms are:

# Advantage depends on depth of nesting and addressing scheme.
# Reaction to traffic demand depends on meshing parameters.

Examples of hierarchical routing algorithms are:
* [[CBRP]] (Cluster Based Routing Protocol)
* [[Fisheye State Routing|FSR]] (Fisheye State Routing protocol)
* [[Order One Network Protocol]]; Fast logarithm-of-2 maximum times to contact nodes. Supports large groups.
* ZHLS (Zone-based Hierarchical Link State Routing Protocol) <ref name=":0" />

==See also==
*[[Ad Hoc Configuration Protocol]]
*[[Mobile wireless sensor network#Routing|Routing for Mobile Wireless Sensor Networks]]
*[[MMARP]]

==References==
<references/>

==Further reading==
* [https://www.freedomlayer.org Freedomlayer Research Project]

[[Category:Wireless networking|Ad hoc routing protocols]]
[[Category:Ad hoc routing protocols|*]]
[[Category:Lists of network protocols|ad hoc routing]]