Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad Hoc - Delay Tolerant Networks

Abstract

Abstract. This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like disappearance of mobile devices, connection disruptions, network partitioning, etc. Techniques based on tree topologies are well known for increasing the efficiency of network protocols and/or applications, such as Dynamicity Aware -Graph Relabeling System (DA-GRS). One of the main features of these tree based topologies is the existence of a token traversing in every tree. The use of tokens enables the creation and maintenance of spanning trees in dynamic environments. Subsequently, managing tree-based backbones relies heavily on the token behavior. An efficient and optimal token traversal can highly impact the design of the tree and its usage. In this article, we present a comparison of three distributed and decentralized techniques available for token management, which are Randomness, TABU and Depth First Search.

Information dissemination in VANETs based upon a tree topology

“…Once the list is finished, it means that the token was already sent to all neighbors, it is then sent back to the upper neighbor. In previous work [26], different strategies for traversing the token were compared in terms of both the number of trees conforming the spanning forest and the speed to build them. The different strategies studied for traversing the token in a tree topology were DFS, Tabu (the token keeps a list of forbidden neighbors), and random (the token is sent to a randomly chosen neighbor).…”