A Study of Token Traversal Strategies on Tree-Based Backbones for Mobile Ad Hoc - Delay Tolerant Networks

International audienceTree-based backbone establishment and maintenance in Mobile ad hoc Delay Tolerant Networks is often operated throught the use of traversing tokens. A study and framework are proposed here for various token traversal strategies on tree-based backbones. The proposed strategies execute in a distributed and purely decentralized manner, and require only 1-hop knowledge. Aiming at providing the highest robustness and quality of services, these token-traversal strategies are studied in particular with an algorithm for merging and maintaining the different trees based on the quality of the nodes. For the robustness aspect, the use of a trust-based evaluation framework is assumed and the weights of the different nodes are based on their quality of cooperation. Three cost functions are implemented in order to evaluate the trust based framework proposed, including another function for evaluating tree-convergence time. Results and comparison charts are provided to illustrate the trade-off between the various strategies in terms of performances, cost (memory and communication) and robustness