{'fraction_non_alphanumeric': 0.022494887525562373, 'fraction_numerical': 0.0, 'mean_word_length': 5.11875, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the Implementation and Performance of the (α, t) Protocol on Linux

This article details the design and implementation of the (α, t) protocol, a clustering and routing protocol for ad hoc networks on Linux. Clustering and routing protocols that are developed are normally tested using simulations. Without actual implementation, it is very difficult to perceive how efficient and effective the protocol would prove to be in the real world. The (α, t)-cluster framework deals with a unified approach to adapt dynamically to changing network topology. Nodes are organized into clusters depending on the ability to bound the probability of path failure due to node movement. This clustering scheme forms the basis for an adaptive routing strategy wherein routes within a cluster are maintained proactively and routes between clusters are managed reactively. The authors conclude the article by discussing an experimental study to evaluate the performance of the (α, t) protocol.