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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birman, K.P.: The process group approach to reliable distributed computing. Communications of the ACM 36(12), 36–53 (1993)
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)
Chockler, G.V., Keidar, I., Vitenberg, R.: Group communication specifications: A comprehensive study. ACM Computing Surveys 33(4), 427–469 (2001)
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)
Lamport, L.: Specifying Systems: The TLA+ language and tools for Hardware and Software Engineers. Addison Wesley Professional, Reading (2002)
Mishra, S., Fetzer, C., Cristian, F.: The Timewheel group communication system. IEEE Transactions on Computers 51(8), 883–899 (2002)
Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, pp. 215, 217–218. Addison-Wesley, Reading (1990)
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)
Babaoğlu, Ö., Davoli, R., Montresor, A.: Group communication in partitionable systems: Specification and algorithms. IEEE Transactions on Software Engineering 27(4), 308–336 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filali, M., Issarny, V., Mauran, P., Padiou, G., Quéinnec, P. (2006). Maximal Group Membership in Ad Hoc Networks. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_7
Download citation
DOI: https://doi.org/10.1007/11752578_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)