Content deleted Content added
predatory |
m Open access bot: url-access updated in citation with #oabot. |
||
| (18 intermediate revisions by 12 users not shown) | |||
Line 1:
{{Multiple issues|
{{COI|date=September 2018}}
{{more citations needed|date=September 2018}}
}}
'''Associativity-based routing'''<ref>{{cite journal |first=Chai-Keong |last=Toh |title=Associativity-based routing for ad hoc mobile networks |journal=Wireless Personal Communications |date=March 1997 |volume=4 |issue=2 |pages=103–139 |doi=10.1023/A:1008812928561 |s2cid=14335563 |url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:d1gkVwhDpl0C|url-access=subscription }}</ref><ref>{{cite conference |title=A novel distributed routing protocol to support ad-hoc mobile computing |journal=Proceedings of the IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications |first=Chai-Keong |last=Toh |date=March 1996 |url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:2osOgNQ5qMEC}}</ref><ref name="auto">{{cite book |first=Chai-Keong |last=Toh |title=Ad Hoc Mobile Wireless Networks |publisher=[[Prentice Hall]] |date=December 2001 |isbn=978-0-13-007817-9}}</ref><ref>{{citation |title=Long-lived ad-hoc routing based on the concept of Associativity, IETF Draft 1999 |url=https://www.ietf.org/proceedings/46/I-D/draft-ietf-manet-longlived-adhoc-routing-00.txt}}</ref> (commonly known as '''ABR''') is a mobile routing protocol invented for [[wireless ad hoc network]]s, also known as [[mobile ad hoc network]]s (MANETs) and [[wireless mesh network]]s. ABR was invented in 1993, filed for a [[U.S. patent]] in 1996, and granted the patent in 1999. ABR was invented by [[Chai Keong Toh]] while doing his Ph.D. at Cambridge University.
==Route discovery phase==
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
Note that when the packet transits backwards from destination to the source, each intermediate
==Route reconstruction phase==
Line 23 ⟶ 25:
==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
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.
Line 29 ⟶ 31:
==Practicality==
In 1998, ABR was successfully implemented<ref>{{citation |title="Mobile Computing Magazine Interview Article - First practical ad hoc wireless network implementation outdoors, 1999 |url=http://init.unizar.es/images/MobiCompMag1999.pdf}}</ref><ref>{{citation |title=Implementation and evaluation of an adaptive routing protocol for infrastructureless mobile networks, Proceedings of 9th International Conference on Computer Communications and Networks, 2000. |pages=20–27|doi=10.1109/ICCCN.2000.885465|chapter=Implementation and evaluation of an adaptive routing protocol for infrastructureless mobile networks|year=2000|last1=Toh|first1=C.-K.|last2=Lin|first2=G.|last3=Delwar|first3=M.|isbn=978-0-7803-6494-3|s2cid=26834795 }}</ref><ref>{{citation |title=Evaluating the communication performance of an ad hoc wireless network, IEEE Transactions on Wireless Communications, 2000 |url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=YTwSsH4AAAAJ&citation_for_view=YTwSsH4AAAAJ:WF5omc3nYNoC}}</ref><ref>{{citation |title=Experimenting with an Ad Hoc wireless network, ACM SIGMETRICS Performance Evaluation Review, Volume 28 Issue 3, Dec. 2000 |journal=ACM
# 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
Line 51 ⟶ 53:
# Impact of beaconing interval on throughput and remaining battery life
An enhanced version of the protocol
==Patent and work extensions==
ABR was granted a US patent 5987011<ref>{{citation |title=A Routing Method for Ad Hoc Mobile Networks, US Patent 5987011, granted 1996, filed 1994. |url=https://
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''')<ref>{{citation |title=Signal stability based adaptive routing (SSA) for ad-hoc mobile networks|url=http://dl.acm.org/citation.cfm?id=241244|year = 1996|last1 = Dube|first1 = Rohit|last2 = Rais|first2 = Cynthia D.|last3 = Wang|first3 = Kuang-Yeh|last4 = Tripathi|first4 = Satish K.}}</ref>
* Enhanced Associativity Based Routing Protocol ('''EABR''')
* Alternative Enhancement of Associativity-Based Routing ('''AEABR''')<ref>{{citation |title=Alternative Enhancement of Associativity-Based Routing|doi=10.1007/978-3-642-11817-3_7
|year=2009
|s2cid=8920485
}}</ref>
* Optimized Associativity Threshold Routing ('''OABTR''')<ref>{{citation |title=Optimized Associativity Threshold Routing|citeseerx=10.1.1.79.8653}}</ref>
Line 67 ⟶ 71:
* Fuzzy Based Trust Associativity-Based Routing ('''Fuzzy-ABR''')
* Associativity Tick Averaged Associativity-Based Routing ('''ATA-AR'''),<ref>{{citation |title=Associativity Tick Averaged Associativity-Based Routing for Realtime Mobile Networks |url=http://www.emo.org.tr/ekler/8a07694d909694a_ek.pdf}}</ref>
* Self-adaptive Q-learning based trust ABR ('''QTABR''')<ref>{{citation |title=Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning |journal= The Scientific World Journal|volume=2014 |pages=452362 |pmc=4164804 |year=2014 |last1=Vijaya Kumar |first1=A. |last2=Jeyapal |first2=A. |pmid=25254243 |doi=10.1155/2014/452362 |doi-access= free}}</ref>
* Quality of Service Extensions to ABR ('''QoSE-ABR''')<ref>{{citation
* Associativity-based Multicast Routing ('''ABAM''')<ref>{{citation |title=ABAM: On-Demand Associativity-Based Multicast |url=https://www.researchgate.net/publication/3874369}}</ref>
* Multipath Associativity Based Routing ('''MABR''')<ref>{{citation |chapter=Multipath Associativity Based Routing|chapter-url=http://dl.acm.org/citation.cfm?id=1044034|doi = 10.1109/WONS.2005.24|title = Second Annual Conference on Wireless On-demand Network Systems and Services|pages = 60–69|year = 2005|last1 = Carthy|first1 = P.M.|last2 = Grigoras|first2 = D.|isbn = 0769522904 <!--0-7695-2290-0 is listed on some pages, but it is invalid-->| s2cid=12523282 }}</ref>
* Associativity routing for Wireless Sensor Networks <ref>{{citation |title=Associative routing for wireless sensor networks |journal=Computer Communications|volume=34|issue=18|pages=2162–2173|doi=10.1016/j.comcom.2011.01.010|year=2011|last1=Eltarras|first1=Ramy|last2=Eltoweissy|first2=Mohamed}}</ref>
* Associative Vehicular Ad Hoc Networks (VANETs) <ref>{{citation |title=A Stable Routing Protocol for Vehicles in Urban Environments |journal=International Journal of Distributed Sensor Networks|volume=9|issue=11|pages=759261|doi=10.1155/2013/759261|year=2013|last1=Yu|first1=Hyun|last2=Ahn|first2=Sanghyun|last3=Yoo|first3=Joon|doi-access=free}}</ref>
==References==
Line 79 ⟶ 83:
[[Category:Mobile computers]]
[[Category:Wireless sensor network]]
[[Category:Ad hoc routing protocols]]
[[Category:Routing protocols]]
| |||