This work deals with the termination of global computations performed in a distributed network of computing entities deened as follows. Each computing entity computes with a given operator a single value using those it receives from its direct ancestors in the network. This value is then sent to its direct descendants. The network is supplied at the… (More)
Self-stabilizing protocols can resist transient failures and guarantee system recovery in a nite time. We highlight the connexion between the formalism of self-stabilizing distributed systems and the formalism of generalised path algebra and asynchronous iterations with delay. We use the later to prove that a local condition on locally executed algorithm… (More)
We propose a group membership service for dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that each group diameter is always smaller than a constant, fixed according to the application using the groups. The proposed protocol is self-stabilizing and works in dynamic distributed systems. Moreover, it ensures a kind of… (More)
MOTS-CLÉS : réseaux de véhicules, VANET, réseaux ad hoc dynamiques, ITS, IEEE 802.11, plates-formes expé-rimentales, évaluation de performances.
— Since few years, Vehicular Ad hoc Networks deserve much attention. The development of wireless communication in VANET implies to take into account the need of security. In VANET, many attacks rely on having the attacker generate multiple identities to simulate multiple nodes: this is called the Sybil attack. In this paper, we propose a precise… (More)
A preliminary version of this work appears in . The final version of this work can be found in . Abstract This paper describes a parametrized distributed algorithm applicable to any directed graph topology. The function parameter of our algorithm is instantiated to produce distributed algorithms for both fundamental and high level applications, such… (More)