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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
John, E.C.R., McQuillan, M., Richer, I.: The new routing algorithm for the arpanet. IEEE Transactions on Communications COM-28(5), 711–719 (1980)
IEEE standard 802.1d-2004: IEEE standard for local and metropolitan area networks: Media access control (mac) brideges (June 2004)
Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant manets. In: MobiHoc 2007: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pp. 32–40. ACM, New York (2007)
Su, J., Goel, A., de Lara, E.: An empirical evaluation of the student-net delay tolerant network. Annual International Conference on Mobile and Ubiquitous Systems, 1–10 (2006)
Ruiz, P., Dorronsoro, B., Khadraoui, D., Bouvry, P.: BODYF–A Parameterless Broadcasting Protocol Over Dynamic Forest. In: Workshop on Optimization Issues in Grid and Parallel Computing Environments, part of the High Performance Computing and Simulation Conference (HPCS), pp. 297–303 (2008)
Malpani, N., Chen, Y., Welch, J.L.: Distributed token circulation in mobile ad hoc networks. IEEE Transactions on Mobile Computing 4(2), 154–165 (2005)
Pigné, Y.: Modélisation et traitement décentralisé des graphes dynamiques - application aux réseaux mobiles ad hoc. Ph.D. dissertation, L’Université du Harve (December 2008)
Casteigts, A.: Model driven capabilities of the DA-GRS model. ICAS 2006: Proceedings of the International Conference on Autonomic and Autonomous Systems, 24 (2006)
Gandhi, R., Mishra, A., Parthasarathy, S.: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Transactions on Networking 16, 840–851 (2008)
Sopena, E., Metivier, Y.: Graph relabeling systems: a general overview. Computers and Artificial Intelligence 16(2), 167–185 (1997)
Gast, M.: 802.11 Wireless Networks: The Definitive Guide, 2nd edn. O’Reilly, Sebastopol (2005)
IEEE standard 802.11: Wireless lan medium access control and physical layer specifications, August 1999. IEEE Computer Society, Los Alamitos (1999)
Cardelli, L.: An implementation model of rendezvous communication. LNCS, vol. 197. Springer, Heidelberg (1985)
Goodaire, E.G., Parmenter, M.M.: Discrete mathematics with graph theory, 2nd edn. Prientice Hall Inc., Upper Saddle River (2002)
Bauer, N., Colagrosso, M., Camp, T.: An agile approach to distributed information dissemination in mobile ad hoc networks. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), Washington, DC, USA, pp. 131–141 (2005)
Stojmenovic, I., Russell, M., Vukojevic, B.: Depth first search and location based localized routing and qos routing in wireless networks. In: Intl. Conf. on Parallel Processing (ICPP 2000) (2000)
Hogie, L., Bouvry, P., Guinand, F., Danoy, G., Alba, E.: Simulating Realistic Mobility Models for Large Heterogeneous MANETS. In: Demo proceeding of the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2006), pp. 129–141. IEEE, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piyatumrong, A., Ruiz, P., Bouvry, P., Guinand, F., Lavangnananda, K. (2009). Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad Hoc - Delay Tolerant Networks. In: Papasratorn, B., Chutimaskul, W., Porkaew, K., Vanijja, V. (eds) Advances in Information Technology. IAIT 2009. Communications in Computer and Information Science, vol 55. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10392-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-10392-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10391-9
Online ISBN: 978-3-642-10392-6
eBook Packages: Computer ScienceComputer Science (R0)