Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Delay Tolerant MANETs

Apivadee Piyatumrong (1) , Patricia Ruiz (1) , Pascal Bouvry (1) , Frédéric Guinand (2) , Kittichai Lavagnananda (3)

1 CSC - Computer Science and Communications Research Unit [Luxembourg]
2 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
3 King Mongkut’s University of Technology Thonburi [Bangkok]

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.

Mots clés: Token traversal; spanning tree; distributed system; delay tolerant networks; Depth First Search

Domaines: Informatique mobile; Informatique ubiquitaire

Apivadee Piyatumrong, Patricia Ruiz, Pascal Bouvry, Frédéric Guinand, Kittichai Lavagnananda. Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Delay Tolerant MANETs. Third International Conference, IAIT 2009., Dec 2009, Bangkok, Thailand. pp.96-109, ⟨10.1007/978-3-642-10392-6_10⟩. ⟨hal-00455459⟩