Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Valerie Issarny <>
Submitted on : Thursday, September 10, 2009 - 11:34:27 AM
Last modification on : Thursday, March 18, 2021 - 2:34:41 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 11:27:03 PM


Files produced by the author(s)


  • HAL Id : inria-00415110, version 1


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, 2005, Poznan, Poland. pp.51-58. ⟨inria-00415110⟩



Record views


Files downloads