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.
Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks / Caleffi, Marcello; Ferraiuolo, Giancarlo; Paura, Luigi. - (2007), pp. 1-6. (Intervento presentato al convegno MASS 2007: IEEE International Conference on Mobile Adhoc and Sensor Systems tenutosi a Pisa (Italy) nel October, 1-6, 2007) [10.1109/MOBHOC.2007.4428727].
Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks
CALEFFI, MARCELLO;FERRAIUOLO, GIANCARLO;PAURA, LUIGI
2007
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
