Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks
Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paura

TL;DR
This paper introduces ATR, a hierarchical tree-based routing protocol designed to improve scalability and resilience in large ad hoc networks, outperforming existing protocols through simulation.
Contribution
It presents a novel augmented tree-based address structure and multi-path routing protocol that address scalability and robustness issues in large ad hoc networks.
Findings
ATR outperforms existing protocols in scalability.
ATR demonstrates high resilience to node failure and mobility.
Simulation results confirm improved network performance.
Abstract
In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
