Maximal Group Membership in Ad Hoc Networks

Abstract : The notion of Group communication has long been introduced as a core service of distributed systems. More recently, this notion appeared with a somewhat different meaning in the field of mobile ad hoc systems. In this context, we study the group membership problem. After specifying the basic safety properties of such groups and a maximality criterion based on cliques, we propose a group membership algorithm. Lastly, with respect to this criterion, we compare our algorithm with two group membership algorithms for ad hoc environments. Moreover, a formal description in TLA+ has been programmed and verified by model-checking for small networks.
Type de document :
Communication dans un congrès
6th International Conference on Parallel Processing and Applied Mathematics : PPAM 2005, 2005, Poznan, Poland. pp.51-58, 2006
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00415110
Contributeur : Valerie Issarny <>
Soumis le : jeudi 10 septembre 2009 - 11:34:27
Dernière modification le : jeudi 11 janvier 2018 - 06:22:37
Document(s) archivé(s) le : mardi 15 juin 2010 - 23:27:03

Fichier

FilaliIMPQ05.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00415110, version 1

Collections

Citation

Mamoun Filali, Valérie Issarny, Philippe Mauran, Gérard Padiou, Philippe Quéinnec. Maximal Group Membership in Ad Hoc Networks. 6th International Conference on Parallel Processing and Applied Mathematics : PPAM 2005, 2005, Poznan, Poland. pp.51-58, 2006. 〈inria-00415110〉

Partager

Métriques

Consultations de la notice

292

Téléchargements de fichiers

132