On the implementation and performance of the (α, t) protocol on Linux

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.