Reference : Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad ho...

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/9456

Title :	Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad hoc - Delay Tolerant Networks
Language :	English
Author, co-author :	Piyatumrong, Apivadee [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Ruiz, Patricia [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Bouvry, Pascal [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Guinand, Frederic [Le Havre University, France]
	Lavangnananda, Kittichai [King Mongkut's University of Technology Thonburi, Thailand]
Publication date :	2009
Main document title :	IAIT
Publisher :	Springer Berlin Heidelberg
Pages :	96-109
Peer reviewed :	Yes
Audience :	International
ISBN :	978-3-642-10391-9
Event name :	Third International Conference on Advances in Information Technology (IAIT 2009)
Event date :	December 1-5, 2009
Event place (city) :	Bangkok
Event country :	Thailand
Keywords :	[en] Token traversal ; spanning tree ; distributed system ; delay tolerant networks ; Depth First Search
Abstract :	[en] 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.
Permalink :	http://hdl.handle.net/10993/9456
DOI :	10.1007/978-3-642-10392-6
Other URL :	http://www.springerlink.com/content/j08546l37m772545/
Commentary :	Communications in Computer and Information Science 55 Book SeriesCommunications in Computer and Information Science ISSN1865-0929 (Print) 1865-0937 (Online) VolumeVolume 55 BookAdvances in Information Technology PublisherSpringer Berlin Heidelberg DOI10.1007/978-3-642-10392-6 Copyright2009 ISBN978-3-642-10391-9 (Print) 978-3-642-10392-6 (Online) DOI10.1007/978-3-642-10392-6_10 Pages96-109 Subject CollectionComputer Science SpringerLink DateMonday, November 16, 2009 Advances in Information Technology

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access IAIT.pdf No commentary Author postprint 214.36 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map