Abstract
Many research projects are being done in the domain of wireless mobile and/or ad-hoc networks to provide tools, algorithms and applications that make it possible to handle or use their dynamic characteristics. The purpose of most of these projects is to solve a specific problem, in a specific context. Most often, the models and formalisms that are used are also specific and the results are therefore difficult both to understand and to use in another context. We believe that what is needed is a general model offering a very high level of abstraction, in order to define and characterize what is feasable or not feasable in a dynamic network, depending upon some of its characteristics. In this paper we define such a model and its associated formalism. They are adapted to the study of dynamic networks and to the modeling of algorithms in a dynamic context at a high level of abstraction. The proposed model (Dynamicity Aware Graph Relabeling Systems) derives from what has been achieved in the area of local computations, and that produced useful results in the context of static networks. Our contribution comprises a model and the associated formalism, plus an original synchronization mode between nodes that allows to seemlessly adapt an algorithm to different mobility contexts. All the concepts are illustrated and discussed through the example of a document propagation algorithm, with a resume feature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
SimuDAGRS, a Dynamic Network simulator for algorithms modeled by DA-GRS (2005), Available at: http://www.labri.fr/~casteigt/simulator.html
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on theory of computing, pp. 82–93 (1980)
Casteigts, A.: Model driven capabilities of the da-grs model. In: Proceedings of the 1st IEEE workshop on self-adaptability and self-management of context-aware systems (SELF 2006) (2006)
Casteigts, A., Chaumette, S.: Dynamicity Aware Graph Relabeling Systems - a model to describe MANet algorithms. In: Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (2005)
Chalopin, J., Metivier, Y., Zielonka, W.: Election, naming and cellular edge local computations. In: CICLing 2001. Lectures Notes in Computer Science, pp. 242–256. Springer, Heidelberg (2004)
Kameda, T., Yamashita, M.: Characterizing the solvable cases. In: Computing on anonymous networks. IEEE Transactions on parallel and distributed systems, vol. 7, pp. 69–89 (1996)
Litovsky, I., Metivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1–56. World Scientific Publishing, Singapore (1999)
Metivier, Y., Saheb, N., Zemmari, A.: Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1), 109–128 (2003)
Royer, E.M., Toh, C.K.: A review of current routing protocols for ad-hoc mobile wireless networks. In: Personnal Communications, pp. 46–55. IEEE, Los Alamitos (1999)
Kameda, T., Yamashita, M.: Decision and membership problems. In: Computing on anonymous networks. IEEE Transactions on parallel and distributed systems, vol. 7, pp. 90–96 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casteigts, A., Chaumette, S. (2006). Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_64
Download citation
DOI: https://doi.org/10.1007/11814856_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37189-2
Online ISBN: 978-3-540-37190-8
eBook Packages: Computer ScienceComputer Science (R0)