Model Driven capabilities of the DA-GRS model

Casteigts, Arnaud

doi:10.1109/icas.2006.35

Cited by 10 publications

(19 citation statements)

References 5 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One classical way to enable service on mobile ad hoc networks consists in establishing a topology management structure such as a dominant sequence [24] or a tree [25]. This structure is maintained during the whole lifecycle of the ad hoc network using the exchange of beacon messages and minimal information stored at the level of the nodes.…”

Section: Broadcasting Over Dynamic Forest Bodyfmentioning

confidence: 99%

See 1 more Smart Citation

Information dissemination in VANETs based upon a tree topology

et al. 2012

View full text Add to dashboard Cite

In this work, we focus on vehicular ad hoc networks, also called VANETs, which are communication networks that devices (in this case vehicles) use to exchange messages in a distributed fashion, i.e., using no preexisting infrastructure. We first assess the feasibility of relying on a tree-based topology management structure for mobile ad hoc networks and in particular for VANETs. Next, we enhance DAGRS, an existing decentralized model for enabling distributed tree management and build BODYF on it, an efficient broadcast algorithm. Several broadcasting algorithms of the state of the art are implemented in order to compare the performance of BODYF. The approach is validated by simulation through three realistic scenarios located in Luxembourg city: the city center for both pedestrian and vehicles, and a highway environment. The comparison is made in terms of the coverage achieved by the broadcasting process as well as the complexity of the messages. DAGRS/BODYF approach outperforms other existing protocols in terms of both the number of devices reached and the network use.

show abstract

Section: Broadcasting Over Dynamic Forest Bodyfmentioning

confidence: 99%

“…Dynamicity Aware Graph Relabelling Systems, DAGRS DAGRS (or Dynamicity Aware Graph Relabelling Systems) [25] is a completely decentralized model for building tree-based topologies in dynamic graphs. The model only uses information about direct neighbors for building the topology.…”

Section: Broadcasting Over Dynamic Forest Bodyfmentioning

confidence: 99%

Information dissemination in VANETs based upon a tree topology

et al. 2012

View full text Add to dashboard Cite

show abstract

“…Dynamicity Aware -Graph Relabeling System (DA-GRS) [8] is a model for creating and analyzing decentralized topologies and algorithms targeting dynamically distributed environments like mobile ad hoc DTNs. Up to now, the token traversal strategies used in DA-GRS are based on the assumption that no memory is used in the mobile nodes.…”

Section: Introductionmentioning

confidence: 99%

“…2 The Spanning Forest Algorithm using DA-GRS model Dynamicity Aware -Graph Relabeling System (DA-GRS) [8] is an extension of Graph Relabeling System, GRS [10]. It is a high level abstraction model that can improve the development of self-organized systems.…”

Section: Introductionmentioning

confidence: 99%

Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad Hoc - Delay Tolerant Networks

Piyatumrong

Ruiz

Bouvry

et al. 2009

Advances in Information Technology

View full text Add to dashboard Cite

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.

show abstract

“…The problems we plan to study in a first step are classical theoretical problems, such as election, naming or enumeration. From a more practical point of view, we are also studying the model driven capabilities of the DA-GRS [3] in terms of code and interface generations from rules. This will be used along with an embedded rule engine.…”

mentioning

confidence: 99%

Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks

Casteigts

Chaumette

2006

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

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.

show abstract

Model Driven capabilities of the DA-GRS model

Cited by 10 publications

References 5 publications

Information dissemination in VANETs based upon a tree topology

Information dissemination in VANETs based upon a tree topology

Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad Hoc - Delay Tolerant Networks

Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks

Contact Info

Product

Resources

About