Augmented tree-based routing: Difference between revisions

Revision as of 03:20, 19 June 2018

Latest revision as of 14:34, 23 July 2023

(5 intermediate revisions by 4 users not shown)

Line 1:

'''Augmented tree-based routing (ATR)''' [[Communications protocol|protocol]], first proposed in 2007, is a multi-path [[Distributed hash table|DHT]]-based routing protocol for scalable [[Computer network|network]]s. ATR resorts to an augmented tree-based [[address space]] structure and a hierarchical multi-path routing protocol in order to gain [[scalability]] and good resilience against [[node (networking)|node]] failure/mobility and link congestion/instability.

{{Orphan|date=March 2011}}

== See also ==

'''Augmented tree-based routing (ATR)''' [[Communications protocol|protocol]], first proposed in ''Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks'', Proc. of IEEE MHWMN'07: The Third IEEE International Workshop on [[Heterogeneous]] [[Multi-hop routing|Multi-Hop]] [[Wireless network|Wireless]] and [[mobile network]]s 2007, Pisa (Italy), October 2007, is a multi-path [[Distributed hash table|DHT]]-based routing protocol for scalable [[Computer network|network]]s.

* [[AdList of ad hoc routing protocol listprotocols]]

ATR resorts to an augmented tree-based [[address space]] structure and a hierarchical multi-path routing protocol in order to gain [[scalability]] and good resilience against [[node (networking)|node]] failure/mobility and link congestion/instability.

== See also ==

* [[Mobile ad hoc network]]

* [[Ad hoc routing protocol list]]

== References ==

* {{cite book |doi=10.1109/MOBHOC.2007.4428727 |isbn=978-1-4244-1454-3 |arxiv=0711.3099 |chapter=Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks |title=2007 IEEE International Conference on Mobile Adhoc and Sensor Systems |pages=1–6 |year=2007 |last1=Caleffi |first1=Marcello |last2=Ferraiuolo |first2=Giancarlo |last3=Paura |first3=Luigi |s2cid=11151206 }}

* {{cite journal

* {{cite book |arxiv=0801.4082 |bibcode=2008arXiv0801.4082C |chapter=On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks |last1=Caleffi |first1=Marcello |last2=Ferraiuolo |first2=Giancarlo |last3=Paura |first3=Luigi |year=2008 |title=Proceedings of WRECOM '07: Wireless Rural and Emergency Communications Conference, Roma (Italy), October 2007}}

| doi = 10.1109/MOBHOC.2007.4428727

| first = M. | last = Caleffi |author2= G. Ferraiuolo|author3= L. Paura

| title = Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks

| journal = Proc. of IEEE MASS '07: IEEE International Conference on Mobile Adhoc and Sensor Systems

| page = 1

| ___location = Pisa, Italy | date = 8–11 October 2007

| url = http://www.ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4428592&arnumber=4428727&count=176&index=134

| isbn = 978-1-4244-1454-3

| arxiv = 0711.3099}}

* {{cite journal

| first = M. | last = Caleffi |author2= G. Ferraiuolo|author3= L. Paura

| title = On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks

| journal = Proc. of WRECOM '07: Wireless Rural and Emergency Communications Conference

| ___location = Rome, Italy |date=October 2007 | arxiv = 0801.4082

|bibcode=2008arXiv0801.4082C}}

[[Category:Routing algorithms]]