List of ad hoc routing protocols

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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. The basic idea is that a new node may announce its presence and should listen for announcements broadcast by its neighbors. Each node learns about nodes 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, that is, 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.

Contents

table-driven (Pro-active) routing [edit]

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:

  1. Respective amount of data for maintenance.
  2. Slow reaction on restructuring and failures.

Examples of pro-active algorithms are:

On Demand (Reactive) routing [edit]

This type of protocols finds a route on demand by flooding the network with Route Request packets. The main disadvantages of such algorithms are:

  1. High latency time in route finding.
  2. Excessive flooding can lead to network clogging.

Examples of on demand algorithms are:

Flow-oriented routing [edit]

This type of protocols finds a route on demand by following present flows. One option is to unicast consecutively when forwarding data while promoting a new link. The main disadvantages of such algorithms are:

  1. Takes long time when exploring new routes without a prior knowledge.
  2. May refer to entitative existing traffic to compensate for missing knowledge on routes.

Examples of flow oriented algorithms are:

  • IERP (Interzone Routing Protocol/reactive part of the ZRP)[9]
  • RDMAR (Relative-Distance Micro-discovery Ad hoc Routing protocol)[10]

Hybrid (both pro-active and reactive) routing [edit]

This type of protocols combines the advantages of proactive and of 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 for one or the other method requires predetermination for typical cases. The main disadvantages of such algorithms are:

  1. Advantage depends on number of Mathavan nodes activated.
  2. Reaction to traffic demand depends on gradient of traffic volume.

Examples of hybrid algorithms are:

  • ZRP (Zone Routing Protocol)[11] ZRP uses IARP as pro-active and IERP as reactive component.

Hierarchical Routing Protocols [edit]

With this type of protocols the choice of proactive and of reactive routing depends on the hierarchic level where 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:

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

Examples of hierarchical routing algorithms are:

  • CBRP (Cluster Based Routing Protocol)[12]
  • FSR (Fisheye State Routing protocol)[13]

Others [edit]

  • IMEP (Internet Manet Encapsulation Protocol)[14]

References [edit]

  1. ^ RFC Draft: Better Approach To Mobile Ad-hoc Networking (B.A.T.M.A.N.) - draft-wunderlich-openmesh-manet-routing-00, A. Neumann, C. Aichele, M. Lindner, S. Wunderlich, 07. April 2008
  2. ^ N. Kettaf, A. Abouaissa, T. Vuduong and P. Lorenz: Admission Control enabled On demand Routing (ACOR), July 2006, (Work in progress)
  3. ^ C. Perkins, E. Royer and S. Das: Ad hoc On-demand Distance Vector (AODV) Routing, RFC 3561
  4. ^ David Johnson, David Maltz, Yih-Chun Hu: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks for IPv4, RFC 4728
  5. ^ David 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
  6. ^ Yih-Chun Hu, David B. Johnson, David A. Maltz: Flow State in the Dynamic Source Routing Protocol Internet Draft, work in progress, June 2001.
  7. ^ I. Chakeres and C. Perkins: Dynamic MANET On-demand Routing Protocol (DYMO), Internet Draft, work in progress, June 2008.
  8. ^ D. 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.
  9. ^ Zygmunt J. Haas, Marc R. Pearlman, Prince Samar: The Interzone Routing Protocol (IERP) for Ad Hoc Networks, Internet Draft, work in progress, July 2002.
  10. ^ G. Aggelou, R. Tafazolli: Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol, Internet Draft, work in progress, September 1999.
  11. ^ Zygmunt J. Haas, Marc R. Pearlman, Prince Samar: The Zone Routing Protocol (ZRP) for Ad Hoc Networks, Internet Draft, work in progress, July 2002.
  12. ^ M. Jiang, J. Li, Y. C. Tay: Cluster Based Routing Protocol (CBRP) Functional Specification, Internet Draft, work in progress, June 1999.
  13. ^ Maria Gerla, Guangyu Pei, Xiaoyan Hong, Tsu-Wei Chen: Fisheye State Routing Protocol (FSR) for Ad Hoc Networks, Internet Draft, work in progress, June 2001.
  14. ^ M. S. Corson, S. Papademetriou, P. Papadopoulos, V. Park, A. Qayyum: Internet manet encapsulation protocol (IMEP) specification, Internet Draft
Retrieved from "http://en.wikipedia.org/w/index.php?title=List_of_ad_hoc_routing_protocols&oldid=545635528"