'''Associativity-Basedbased Routingrouting'''<ref>{{citation |title="Associativity-based routing for ad hoc mobile networks" |url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:d1gkVwhDpl0C}}</ref><ref>{{citation |title="A novel distributed routing protocol to support ad-hoc mobile computing" |url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:2osOgNQ5qMEC}}</ref><ref name="auto">[[Chai Keong Toh]] Ad Hoc Mobile Wireless Networks, Prentice Hall Publishers, 2002. {{ISBN|978-0-13-007817-9}}</ref><ref>{{citation |title="Long-lived ad-hoc routing based on the concept of Associativity" |url=https://scholar.google.com/citationsview_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:YsMSGLbcyi4C}}</ref> (commonly known as '''ABR''') is a mobile routing protocol invented for [[wireless ad hoc networks]] or also known as [[Mobilemobile Adad Hochoc Networksnetworks]] (MANETs) and [[Wirelesswireless Meshmesh Networknetwork]]. ABR was invented in 1993, filed for a USA patent in 1996, and granted the patent in 1999. ABR was invented by [[Chai Keong Toh]] while doing his Ph.D. at Cambridge University. In the 1990s, our Internet is still largely wired. Toh was working on a different Internet – that of a rapidly deployable, infrastructureless, self-organizing, self-configuring mobile Internet. The challenges in such a network is mobility of nodes and link dynamics. Toh's prime argument is that there is no point in choosing a node to route packets if the route is unstable or going to be broken soon. So, he introduced a new routing metric (known as associativity ticks) and the concept of associativity, i.e., link stability among nodes over TIME and SPACE. Hence, ABR was born.
