Content deleted Content added
No edit summary |
Disambiguated: protocol → Communications protocol, DHT → Distributed hash table using Dab solver |
||
Line 1:
{{Orphan|date=March 2011}}
'''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 [[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 [[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]] failure/mobility and link congestion/instability.
Line 14:
| 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
|
| ___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
|