Associativity-based routing: Difference between revisions

Revision as of 05:25, 26 November 2016

Revision as of 05:30, 26 November 2016

Line 1:

==Introduction==

Associativity-Based Routing<ref>{{cite |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>{{cite |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>{{cite |title="Long-lived ad-hoc routing based on the concept of Associativity" |url=https://scholar.google.com/citations?view_opcitationsview_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:YsMSGLbcyi4C}}</ref><ref> (commonly known as ABR) is a mobile routing protocol invented for [[wireless ad hoc networks]].

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

Line 34:

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).