Best-effort Group Service in Dynamic Networks
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2008
Abstract
We propose a group membership service for dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that each group diameter is always smaller than a constant, ?xed according to the application using the groups. The proposed protocol is self-stabilizing and works in dynamic distributed systems. Moreover, it ensures a kind of continuity in the service o?er to the application while the system is converging, except if too strong topology changes happen. Such a best e?ort behavior allows applications to rely on the groups while the stabilization has not been reached, which is very useful in dynamic ad hoc networks.
View on arXivComments on this paper
