Maximal Group Membership in Ad Hoc Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Maximal Group Membership in Ad Hoc Networks


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.
Fichier principal
Vignette du fichier
FilaliIMPQ05.pdf (388.25 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00415110 , version 1 (10-09-2009)



M 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), Sep 2005, Poznan, Poland. pp.51-58, ⟨10.1007/11752578_7⟩. ⟨inria-00415110⟩
135 View
153 Download



Gmail Mastodon Facebook X LinkedIn More