Associativity-based routing

ABR has three phases. The first phase is the route discovery phase. When a user initiates to transmit data, the protocol will intercept the request and broadcast a search packet over the wireless interfaces. As the search packet propagates node to node, node identity and stability information are appended to the packet. When the packet eventually reaches the destination node, it would have received all the information describing the path from source to destination. When that happens, the destination then chooses the best route (because there may be more than one path from the source to the destination) and sends a REPLY back to the source node, over the chosen path. Note that when the packet transits backwards from destination to the source, each intermediate node will update their routing table, signifying that it will now know how to route when it receives data from the upstream node. When the source node receives the REPLY, the route is successfully discovered and established. This process is done in real-time and only takes a few milli-seconds. ==Route reconstruction phase==

ABR establishes routes that are long-lived or associativity-stable, thus most routes established will seldom experience link breaks; however, if one or more links are broken, their ABR will immediately invoke the RRC – route reconstruction phase. The RRC basically repairs the broken link by having the upstream node (which senses the link break) perform a localized route repair. The localized route repair is performed by carrying out a localized broadcast query that searches for an alternative long-lived partial route to the destination. ABR route maintenance consists of: • (a) partial route discovery, • (b) invalid route erasure, • (c) valid route update, and • (d) new route discovery (worse case). ==Route deletion phase==

When a discovered route is no longer needed, a RD (Route Delete) packet will be initiated by the source node so that all intermediate nodes in the route will update their routing table entries and stop relay data packets associated with this deleted route. In addition to using RD to delete a route, ABR can also implement a soft state approach where route entries are expired or invalidated after timed out, when there is no traffic activity related to the route over a period of time. ==Practicality==

In 1998, ABR was successfully implemented into the Linux kernel, in various different branded laptops (IBM Thinkpad, COMPAQ, Toshiba, etc.) that are equipped with WaveLAN 802.11a PCMCIA wireless adapters. A working 6-node wide wireless ad hoc network spanning a distance of over 600 meters was achieved and the successful event was published in Mobile Computing Magazine in 1999. Various tests were performed with the network: • Transmission of up to 500MBytes of data from source to destination over a 3-hop route. • Link breaks and automatic link repairs proven to be working • Automatic Route Discovery • Route Delete • Web Server in Ad Hoc mode – with source being client and destination being the web server • Transmission of multimedia information (audio and video) • TELNET over Ad Hoc • FTP over Ad Hoc • HTTP over Ad Hoc Also, network performance measurements on the following were made: • End-to-end delay • TCP throughput • Packet loss ratio • Route discovery delay • Route repair delay • Impact of packet size on throughput • Impact of beaconing interval on throughput and remaining battery life An enhanced version of the protocol was implemented in the field by defense contractor TRW Inc. in 2002. The enhancement made to the protocol include: (a) network-layer QoS additions and (b) route precedence capabilities. ==Patent and work extensions==

ABR was granted a US patent 5987011 and the assignee being King's College, Cambridge, UK. A few other mobile ad hoc routing protocols have incorporated ABR's stability concept or have done extensions of the ABR protocol, including: • Signal Stability-based Adaptive Routing Protocol (SSA) • Enhanced Associativity Based Routing Protocol (EABR) • Alternative Enhancement of Associativity-Based Routing (AEABR) • Optimized Associativity Threshold Routing (OABTR) • Associativity-Based Clustering Protocol (ABCP), • Fuzzy Based Trust Associativity-Based Routing (Fuzzy-ABR) • Associativity Tick Averaged Associativity-Based Routing (ATA-AR), • Self-adaptive Q-learning based trust ABR (QTABR) • Quality of Service Extensions to ABR (QoSE-ABR) • Associativity-based Multicast Routing (ABAM) • Multipath Associativity Based Routing (MABR) • Associativity routing for Wireless Sensor Networks • Associative Vehicular Ad Hoc Networks (VANETs) ==References==