Jump to content

Augmented tree-based routing

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bibcode Bot (talk | contribs) at 03:20, 19 June 2018 (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). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Augmented tree-based routing (ATR) 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 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 gain scalability and good resilience against node failure/mobility and link congestion/instability.

See also

References

  • Caleffi, M.; G. Ferraiuolo; L. Paura (8–11 October 2007). "Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks". Proc. of IEEE MASS '07: IEEE International Conference on Mobile Adhoc and Sensor Systems. Pisa, Italy: 1. arXiv:0711.3099. doi:10.1109/MOBHOC.2007.4428727. ISBN 978-1-4244-1454-3.
  • Caleffi, M.; G. Ferraiuolo; L. Paura (October 2007). "On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks". Proc. of WRECOM '07: Wireless Rural and Emergency Communications Conference. Rome, Italy. arXiv:0801.4082. Bibcode:2008arXiv0801.4082C.


Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Augmented_tree-based_routing&oldid=846494230"