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.
KeywordsGroup Membership Group Communication State Transition Graph Singleton State Local Broadcast
Unable to display preview. Download preview PDF.
- 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
- 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.Lamport, L.: Specifying Systems: The TLA+ language and tools for Hardware and Software Engineers. Addison Wesley Professional, Reading (2002)Google Scholar
- 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