List of ad hoc routing protocols

An ad-hoc acquisition agreement is a convention, or standard, that controls how nodes adjudge which way to avenue packets amid accretion accessories in a adaptable ad hoc arrangement .

In ad-hoc networks, nodes are not accustomed with the cartography of their networks; instead, they accept to ascertain it.The basal abstraction is that a new bulge may advertise its attendance and should accept for announcements advertisement by its neighbors.Each bulge learns about nodes adjacent and how to ability them, and may advertise that it, too, can ability them.

Note that in a added sense, ad hoc agreement can aswell be acclimated literally, that is, to beggarly an improvised and generally ad-lib agreement accustomed for a specific purpose.

The afterward is a account of some ad hoc arrangement acquisition protocols.

Pro-active (table-driven) routing

This blazon of protocols maintains beginning lists of destinations and their routes by periodically distributing acquisition tables throughout the network. The capital disadvantages of such algorithms are:

Respective bulk of abstracts for maintenance.

Slow acknowledgment on restructuring and failures.

Examples of pro-active algorithms are:

Babel, a agreement aggressive by DSDV with faster aggregation and ETX hotlink superior estimation. Free accomplishing available.

B.A.T.M.A.N. – Better access to adaptable adhoc networking. RFC Draft: http://tools.ietf.org/html/draft-wunderlich-openmesh-manet-routing-00

DSDV (Highly Dynamic Destination-Sequenced Distance Vector acquisition protocol) – C. E. PERKINS, P. BHAGWAT Highly Dynamic Destination-Sequenced Distance Vector (DSDV) for Adaptable Computers Proc. of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, Aug 1994, pp 234–244.

HSR (Hierarchical State Acquisition protocol) – Guangyu Pei and Mario Gerla and Xiaoyan Hong AND Ching-Chuan Chiang, A Wireless Hierarchical Acquisition Agreement with Group Mobility, IEEE WCNC'99, New Orleans, USA, September 1999. http://wiki.uni.lu/secan-lab/Hieracical+State+Routing.html

HSLS The hazy-sighted link-state algorithm. This algorithm is based on empiric and abstract studies to absolute link-state cartage while accomplishing applied hotlink mobility. It avoids the bulletin calamity of DSR, OLSR and AODV by growing the ambit of the link-state updates two bend for anniversary two bend amplification of time. It has a applied ample arrangement in abode at CuWIN.

IARP (Intrazone Acquisition Protocol/pro-active allotment of the ZRP) – ZYGMUNT J. HAAS, MARC R. PEARLMAN, PRINCE SAMAR The Intrazone Acquisition Agreement (IARP) for Ad Hoc Networks, Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-zone-iarp, plan in progress, July 2002.

Linked Cluster Architecture|LCA (Linked Cluster Architecture) – M. GERLA, J. T. TSAI Multicluster, Mobile, Multimedia Radio Arrangement ACM Wireless Networks, VOl 1, No.3, 1995, pp. 255–265

WAR (Witness Aided Routing) – Aron, I.D. and Gupta, S., 1999, “A Witness-Aided Acquisition Agreement for Adaptable Ad Hoc Networks with Unidirectional Links”, Proc. of the First International Conference on Adaptable Abstracts Access, p.24-33.

OLSR Optimized Hotlink State Acquisition Agreement RFC 3626: http://tools.ietf.org/html/rfc3626

Reactive (on-demand) routing

This blazon of protocols finds a avenue on appeal by calamity the arrangement with Avenue Request packets. The capital disadvantages of such algorithms are:

High cessation time in avenue finding.

Excessive calamity can advance to arrangement clogging.

Examples of acknowledging algorithms are:

SENCAST – P. Appavoo and K. Khedo, SENCAST: A Scalable Agreement for Unicasting and Multicasting in a Large Ad hoc Emergency Network, International Journal of Computer Science and Arrangement Security, Vol.8 No.2, February 2008

Reliable Ad hoc On-demand Distance Vector Acquisition Agreement – Sandhya Khurana, Neelima Gupta, Nagender Aneja, http://doi.ieeecomputersociety.org/10.1109/ICNICONSMCL.2006.183

Ant-based Acquisition Algorithm for Adaptable Ad Hoc Networks – Mesut Günes et al., ARA – the ant-colony based acquisition algorithm for manets, In Stephan Olariu, editor, Proceedings of the 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002), pages 79–85, IEEE Computer Society Press, August 2002, http://www.adhoc-nets.de

Admission Control enabled On appeal Acquisition (ACOR) – N. Kettaf, A. Abouaissa, T. Vuduong and P. Lorenz, http://tools.ietf.org/html/draft-kettaf-manet-acor, July 2006, (Work in progress)

Ariadne – Y. Chu, A. Perrig, D. Johnson, Ariadne: A Secure On-Demand Acquisition Agreement for Ad Hoc Networks, Proc. ACM Conf. Adaptable Computing and Networking (MobiCom), 2002. http://sparrow.ece.cmu.edu/~adrian/projects/secure-routing/ariadne.pdf

Associativity-Based Acquisition – CHAI-KEONG TOH: A Novel Distributed Acquisition Agreement To Support Ad hoc Adaptable Computing, Proc. IEEE 15th Annual International Phoenix Conference on Computers and Communications, IEEE IPCCC 1996, 27 March-29, Phoenix, AZ, USA, pp. 480–486 / CHAI-KEONG TOH: Long-lived Ad Hoc Acquisition based on the Concept of Associativity, Internet Draft, March 1999, Expired, http://tools.ietf.org/html/draft-ietf-manet-longlived-adhoc-routing – US PATENT 5,987,011 http://www.patentstorm.us/patents/5987011.html

Ad hoc On-demand Distance Vector(AODV) – C. PERKINS, E.ROYER AND S. DAS Ad hoc On-demand Distance Vector (AODV) Routing, RFC 3561

Ad hoc On-demand Acquisition Agreement (AORP) – A. Reeve: Resilient Real-time Communications Across Meshed Networks Under Adverse Conditions, Proc. 1st SEAS DTC Technical Conference, 2006, http://www.seasdtc.com/downloads/pdf/conf_material_06/communications_and_control/cc001.pdf

Ad hoc On-demand Multipath Distance Vector – M. Marina, S. Das: On-demand Multipath Distance Vector Acquisition in Ad Hoc Networks, Proceedings of the 2001 IEEE International Conference on Arrangement Protocols (ICNP), pages 14—23, IEEE Computer Society Press, 2001.

Backup Antecedent Acquisition – SONG GUO, OLIVER W. YANG Performance of Backup Antecedent Acquisition (BSR) in adaptable ad hoc networks p 440-444, Proc. 2002 IEEE Wireless Networking Conference

Dynamic Antecedent Acquisition – DAVID JOHNSON, DAVID MALTZ, YIH-CHUN HU: The Dynamic Antecedent Acquisition Agreement for Adaptable Ad Hoc Networks for IPv4, RFC 4728 / DAVID B. JOHNSON, DAVID A. MALTZ: Dynamic Antecedent Acquisition in Ad Hoc Wireless Networks, Adaptable Computing, Thomasz Imielinski and Hank Korth (Editors), Vol. 353, Chapter 5, pp. 153–181, Kluwer Academic Publishers, 1996

Flow State in the Dynamic Antecedent Acquisition – YIH-CHUN HU, DAVID B. JOHNSON, DAVID A. MALTZ Flow State in the Dynamic Antecedent Acquisition Agreement Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-dsrflow, plan in progress, June 2001.

Dynamic NIx-Vector Acquisition – Young J. Lee and George F. Riley, Dynamic NIx-Vector Acquisition for Adaptable Ad Hoc Networks. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2005), New Orleans, Mar. 13 – 17, 2005.

DYnamic Manet On-demand Acquisition – I. Chakeres AND C. Perkins: Dynamic MANET On-demand Acquisition Agreement (DYMO), Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-dymo, plan in progress, June 2008. RFC 4728

Endaira: It is on appeal antecedent acquisition agreement and it is advised to abode the hidden approach advance in ariadne.

Flow-oriented routing

This blazon of protocols finds a avenue on appeal by afterward present flows. One advantage is to unicast consecutively if forwarding abstracts while announcement a new link. The capital disadvantages of such algorithms are:

Takes continued time if exploring new routes after a above-mentioned knowledge.

May accredit to entitative absolute cartage to atone for missing ability on routes.

Examples of breeze aggressive algorithms are:

FR and PR, E. Gafni, D. Bertsekas: Distributed Algorithms for Generating Loop-free Routes in Networks with Frequently Changing Topology, IEEE Transactions on Communication, Vol. 29, No. 1, Jan, 1981, pp.11–15. - The aboriginal Hotlink Reversal Acquisition (LRR) algorithms.

IERP (Interzone Acquisition Protocol/reactive allotment of the ZRP) – ZYGMUNT J. HAAS, MARC R. PEARLMAN, PRINCE SAMAR The Interzone Acquisition Agreement (IERP) for Ad Hoc Networks, Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-zone-ierp, plan in progress, July 2002.

LUNAR (Lightweight Underlay Network Ad hoc Routing) – CHRISTIAN TSCHUDIN AND RICHARD GOLD Lightweight Underlay Network Ad hoc Acquisition (LUNAR), http://cn.cs.unibas.ch/projects/lunar/

RDMAR (Relative-Distance Micro-discovery Ad hoc Acquisition protocol) – G. AGGELOU, R. TAFAZOLLI Relative Distance Micro-discovery Ad Hoc Acquisition (RDMAR) agreement Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-rdmar, plan in progress, September 1999.

SSR (Signal Stability Acquisition protocol) – R. DUBE, C. D. RAIS, K. WANG, AND S. K. TRIPATHI Signal Stability based adaptive acquisition (SSR alt SSA) for ad hoc adaptable networks, IEEE Personal Communication, Feb. 1997.

Hybrid (both pro-active and reactive) routing

This blazon of protocols combines the advantages of proactive and of acknowledging routing. The acquisition is initially accustomed with some proactively prospected routes and again serves the appeal from additionally activated nodes through acknowledging flooding. The best for one or the added adjustment requires afterlife for archetypal cases. The capital disadvantages of such algorithms are:

Advantage depends on amount of Mathavan nodes activated.

Reaction to cartage appeal depends on acclivity of cartage volume.

Examples of amalgam algorithms are:

HRPLS (Hybrid Acquisition Agreement for Large Scale Mobile Ad Hoc Networks with Mobile Backbones) – Ashish Pandey, Md. Nasir Ahmed, Nilesh Kumar, P. Gupta: A Amalgam Acquisition Scheme for Mobile Ad Hoc Networks with Mobile Backbones, IEEE International Conference on High Performance Computing, HIPC 2006, pp. 411–423, Dec 2006.

HWMP (Hybrid Wireless Mesh Protocol) – absence binding acquisition agreement for 802.11s. HWMP is aggressive by a aggregate of AODV (RFC 35612 ) and tree-based proactive routing. Guenael Strutt: HWMP Specification Update. The Working Group for WLAN Standards of the Institute of Electrical and Electronics Engineers. 14 November 2006 1

ZRP (Zone Acquisition Protocol) – ZYGMUNT J. HAAS, MARC R. PEARLMAN, PRINCE SAMAR The Zone Acquisition Agreement (ZRP) for Ad Hoc Networks, Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-zone-zrp, plan in progress, July 2002. ZRP uses IARP as pro-active and IERP as acknowledging component.

Hierarchical routing protocols

With this blazon of protocols the best of proactive and of acknowledging acquisition depends on the hierarchic akin area a bulge resides. The acquisition is initially accustomed with some proactively prospected routes and again serves the appeal from additionally activated nodes through acknowledging calamity on the lower levels. The best for one or the added adjustment requires able attributation for corresponding levels. The capital disadvantages of such algorithms are:

Advantage depends on abyss of nesting and acclamation scheme.

Reaction to cartage appeal depends on coaction parameters.

Examples of hierarchical acquisition algorithms are:

CBRP (Cluster Based Acquisition Protocol) – M. JIANG, J. LI, Y. C. TAY Cluster Based Acquisition Agreement (CBRP) Functional Specification Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-cbrp-spec, plan in progress, June 1999.

CEDAR (Core Extraction Distributed Ad hoc Routing) – RAGHUPATHY SIVAKUMAR, PRASUN SINHA, VADUVUR BHARGHAVAN Core Extraction Distributed Ad hoc Acquisition (CEDAR) Specification, Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-cedar-spec; PRASUN SINHA, RAGHUPATHY SIVAKUMAR, VADUVUR BHARGHAVAN CEDAR: A Core-Extraction Distributed Ad Hoc Acquisition Algorithm, The 18th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM '99 New York, NY, USA, pp. 202–209 IEEE, March 1999

FSR (Fisheye State Acquisition protocol) – MARIO GERLA, GUANGYU PEI, XIAOYAN HONG, TSU-WEI CHEN Fisheye State Acquisition Agreement (FSR) for Ad Hoc Networks Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-fsr, plan in progress, June 2001. (see http://wiki.uni.lu/secan-lab/Fisheye+State+Routing.html)

edit Backpressure Routing

This blazon of acquisition does not pre-compute paths. It chooses next-hops dynamically as a packet is in advance against its destination. These decisions are based on bottleneck gradients of acquaintance nodes. When this blazon of acquisition is acclimated calm with max-weight hotlink scheduling, the algorithm is throughput-optimal. See added altercation here: Backpressure Routing.

Host Specific Routing protocols

This blazon of protocols requires absolute administering to clothier the acquisition to a assertive arrangement blueprint and a audible breeze strategy. The capital disadvantages of such algorithms are:

Advantage depends on superior of administering acclamation scheme.

Proper acknowledgment to changes in cartography demands reconsidering all parametrizing.

LANMAR (Landmark Acquisition Protocol for Large Scale Networks) – MARIO GERLA, XIAOYAN HONG, LI MA, GUANGYU PEI Landmark Acquisition Protocol (LANMAR) Internet Draft, http://tools.ietf.org/html/draft-ietf-manet-lanmar-05, plan in progress, June 2001.

Power-aware routing protocols

Energy appropriate to address a arresting is about proportional to dα, area d is the ambit and {\alpha} \geq 2 is the abrasion agency or aisle accident exponent, which depends on the manual medium. When α = 2 (which is the optimal case), transmitting a arresting bisected the ambit requires one fourth of the activity and if there is a bulge in the average accommodating to absorb addition fourth of its activity for the additional half, abstracts would be transmitted for bisected of the activity than through a absolute manual – a actuality that follows anon from the changed aboveboard law of physics.

The capital disadvantages of such algorithms are:

This adjustment induces a adjournment for anniversary transmission.

No appliance for activity arrangement powered manual operated via acceptable captive infrastructure.

Multicast routing

MRMP (Maximum-Residual Multicast Protocol) – Pi-Cheng Hsiu and Tei-Wei Kuo: "A Maximum-Residual Multicast Agreement for Large-Scale Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, 2009 Accessible from: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4796204

EraMobile (Epidemic-based Reliable and Adaptive Multicast) – Zulkuf Genc and Oznur Ozkasap: "EraMobile: Epidemic-based Reliable and Adaptive Multicast for MANETs", In Proc. of the Wireless Communications and Networking Conference (WCNC), Hong Kong, China, March 2007. Accessible from: http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4224245&arnumber=4225046&count=810&index=800

PUMA (Protocol for Unified Multicasting Through Announcements) – Vaishampayan, Ravindra. and Garcia-Luna-Aceves, J.J.: " Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks", In 2004 IEEE International Conference on Mobile Ad hoc and Sensor Systems, pages 304- 313, Fort Lauderdale, FL, October 2004. Accessible from: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1392169. A NS-2 accomplishing by Sidney Doria is accessible in: .

AMRIS (Ad hoc Multicast Routing agreement utilizing Increasing id-numberS) – Chun Wei Wu and Yong Chiang Tay: "AMRIS: A Multicast Agreement for Ad Hoc Wireless Networks", In Proc. of the IEEE Military Communications Conference (MILCOM), pages 25 – 29, Atlantic City, NJ, November 1999.

LAM (Lightweight Adaptive Multicast) – Lusheng Ji and M. Scott Corson: "A Lightweight Adaptive Multicast Algorithm", In Proc. of the IEEE Global Telecommunications Conference (Globecom), pages 1036 – 1042, Sydney, Australia, November 1998.

Geographical multicast protocols (Geocasting)

MOBICAST (Mobile Just-in-time Multicasting) – Q. Huang, C. Lu and G-C. Roman, Mobicast: Just-in-time multicast for sensor networks beneath spatiotemporal constraints, Lecture Notes in Computer Science, Vol 2634, pages 442–457

Abiding Geocast / Stored Geocast (Time Stable Geocasting) – C. Maihöfer, T. Leinmüller, E. Schoch: Abiding Geocast: Time-Stable Geocast for Ad Hoc Networks, Second ACM International Workshop on Vehicular Ad Hoc Networks (VANET 2005), Cologne, Germany, September 2, 2005