Augmented tree-based routing: Difference between revisions

Revision as of 09:21, 3 December 2007

Revision as of 12:51, 3 December 2007

Line 1:

{{Notability|date=December 2007}}

'''Augmented Tree-based Routing (ATR)''' protocol, first proposed in ''Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks'', httpProc. of IEEE MHWMN'07://arxiv.org/abs/0711.3099 The Third IEEE International Workshop on Heterogeneous Multi-Hop Wireless and Mobile Networks 2007, Pisa (Italy), October 2007, is a multi-path DHT-based routing protocol for scalable networks.

ATR resorts to an augmented tree-based address space structure and a hierarchical multi-path routing protocol in order to solve thegain scalability problem and to gain good resilience against node failure/mobility and link congestion/instability.

==See also==

*[[Ad hoc routing protocol list]]

==External links==

ATR resorts to an augmented tree-based address space structure and a hierarchical multi-path routing protocol in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability.

''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 and Mobile Networks 2007, Pisa (Italy), October 2007. http://arxiv.org/abs/0711.3099

''On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks'', Proc. of WRECOM '07: Wireless Rural and Emergency Communications Conference, Roma (Italy), October 2007.

{{compu-network-stub}}

[[Category:Algorithms]]

[[Category:Wireless networking]]

[[Category:Ad hoc routing protocols]]