On the Implementation and Performance of the (a, t) Protocol on Linux

Abstract

This paper details the design and implementation of the ( ; t) protocol for ad-hoc networks on Linux. The ( ; t) protocol utilizes adaptive clustering to organize nodes into clusters in which the probability of path failure due to node movement can be bounded over time. Based on the ( ; t) cluster scheme, routes within clusters are maintained on a proactive basis while routing between clusters is maintained on a reactive basis.

9 Figures and Tables

Cite this paper

@inproceedings{Gopalan2004OnTI, title={On the Implementation and Performance of the (a, t) Protocol on Linux}, author={Anandha Gopalan and Sanjeev Dwivedi and A. Bruce McDonald and Taieb Znati}, booktitle={Annual Simulation Symposium}, year={2004} }