Augmented tree-based routing: Difference between revisions

Content deleted Content added
Bibcode Bot (talk | contribs)
m Adding 0 arxiv eprint(s), 1 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot
Alter: template type. Add: year, pages, title, chapter, author pars. 1-3. Formatted dashes. | You can use this tool yourself. Report bugs here.
Line 1:
{{Orphan|date=March 2011}}
 
'''Augmented tree-based routing (ATR)''' [[Communications protocol| protocol]], first proposed in ''Augmented2007, Tree-basedis Routinga Protocolmulti-path for[[Distributed Scalablehash Adtable HocDHT]]-based Networks'',routing Proc.protocol offor IEEEscalable MHWMN'07:[[Computer Thenetwork Thirdnetwork]]s. IEEEATR Internationalresorts Workshopto onan [[Heterogeneous]]augmented [[Multitree-hop routing|Multi-Hop]]based [[Wirelessaddress network|Wirelessspace]] structure and [[mobilea network]]shierarchical 2007,multi-path Pisarouting (Italy),protocol Octoberin 2007,order isto a multi-pathgain [[Distributed hash table|DHTscalability]]-based routingand protocolgood forresilience scalableagainst [[Computernode network|network(networking) node]]s failure/mobility and link congestion/instability.
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 Internatonal Conference on Mobile Adhoc and Sensor Systems |pages=1–6 |year=2007 |last1=Caleffi |first1=Marcello |last2=Ferraiuolo |first2=Giancarlo |last3=Paura |first3=Luigi }}
* {{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]]