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

Tree-based backbone establishment and maintenance in Mobile Ad hoc - Delay Tolerant Networks is often operated through 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 distributed and purely decentralized manner, and require only 1-hop knowledge. Aiming at providing the highest robust 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.