Advertisement

Maximal Group Membership in Ad Hoc Networks

  • Mamoun Filali
  • Valérie Issarny
  • Philippe Mauran
  • Gérard Padiou
  • Philippe Quéinnec
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)

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.

Keywords

Group Membership Group Communication State Transition Graph Singleton State Local Broadcast 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Birman, K.P.: The process group approach to reliable distributed computing. Communications of the ACM 36(12), 36–53 (1993)CrossRefGoogle Scholar
  2. 2.
    Boulkenafed, M., Issarny, V., Liu, J.: Group management for in-home ad hoc networks. In: ECRTS International Workshop on Real-Time for Multimedia - Special Focus on Real-time Middleware for Consumer Electronics (RTMM) (June 2004)Google Scholar
  3. 3.
    Chockler, G.V., Keidar, I., Vitenberg, R.: Group communication specifications: A comprehensive study. ACM Computing Surveys 33(4), 427–469 (2001)CrossRefGoogle Scholar
  4. 4.
    De Prisco, R., Fekete, A., Lynch, N., Shvartsman, A.: A dynamic view-oriented group communication service. In: Proceedings of the 17th annual ACM Symposium on Principles of Distributed Computing (PODC), June 1998, pp. 227–236 (1998)Google Scholar
  5. 5.
    Lamport, L.: Specifying Systems: The TLA+ language and tools for Hardware and Software Engineers. Addison Wesley Professional, Reading (2002)Google Scholar
  6. 6.
    Mishra, S., Fetzer, C., Cristian, F.: The Timewheel group communication system. IEEE Transactions on Computers 51(8), 883–899 (2002)CrossRefGoogle Scholar
  7. 7.
    Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, pp. 215, 217–218. Addison-Wesley, Reading (1990)MATHGoogle Scholar
  8. 8.
    Tosic, P., Agha, G.: Maximal clique based distributed group formation for task allocation in large-scale multi-agent systems. In: Proceedings of the International Workshop on Massively Multi-Agent Systems, Kyoto, Japan, December 10-11 (2004)Google Scholar
  9. 9.
    Babaoğlu, Ö., Davoli, R., Montresor, A.: Group communication in partitionable systems: Specification and algorithms. IEEE Transactions on Software Engineering 27(4), 308–336 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mamoun Filali
    • 1
  • Valérie Issarny
    • 2
  • Philippe Mauran
    • 3
  • Gérard Padiou
    • 3
  • Philippe Quéinnec
    • 3
  1. 1.IRIT-CNRS-Université Paul SabatierFrance
  2. 2.INRIA-RoquencourtFrance
  3. 3.IRIT-ENSEEIHTFrance

Personalised recommendations