Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Analysis of a randomized rendezvous algorithm
Information and Computation
Model Driven capabilities of the DA-GRS model
ICAS '06 Proceedings of the International Conference on Autonomic and Autonomous Systems
| Hi-index | 0.00 |
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.