Best-effort group service in dynamic networks

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, fixed 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 offer to the application while the system is converging, except if too strong topology changes happen. Such a best effort behavior allows applications to rely on the groups while the stabilization has not been reached, which is very useful in dynamic ad hoc networks.

[1]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[2]  Idit Keidar,et al.  Group communication specifications: a comprehensive study , 2001, CSUR.

[3]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[4]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[5]  Jennifer L. Welch,et al.  Random walk for self-stabilizing group communication in ad hoc networks , 2002, IEEE Transactions on Mobile Computing.

[6]  P BirmanKenneth.  The process group approach to reliable distributed computing , 1993 .

[7]  Ajoy Kumar Datta,et al.  Snap-stabilization and PIF in tree networks , 2007, Distributed Computing.

[8]  Hongwei Zhang,et al.  Guaranteed fault containment and local stabilization in routing , 2006, Comput. Networks.

[9]  Bernadette Charron-Bost,et al.  On the impossibility of group membership , 1996, PODC '96.

[10]  Hirotsugu Kakugawa,et al.  A self-stabilizing minimal dominating set algorithm with safe convergence , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[11]  Pierre Sens,et al.  Implementation and performance evaluation of an adaptable failure detector , 2002, Proceedings International Conference on Dependable Systems and Networks.

[12]  Ajoy Kumar Datta,et al.  A Self-Stabilizing O(k)-Time k-Clustering Algorithm , 2010, Comput. J..

[13]  Sébastien Tixeuil,et al.  Self-stabilization with r-operators , 2001, Distributed Computing.

[14]  Sébastien Tixeuil,et al.  Self-Stabilization with r-Operators revisited , 2005, J. Aerosp. Comput. Inf. Commun..

[15]  George Varghese,et al.  The fault span of crash failures , 2000, JACM.

[16]  Boaz Patt-Shamir,et al.  Stabilizing Time-Adaptive Protocols , 1999, Theor. Comput. Sci..

[17]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[18]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[19]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  André Schiper.  Dynamic group communication , 2005, Distributed Computing.

[21]  Günter Hommel,et al.  Localized group membership service for ad hoc networks , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[22]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[23]  Arobinda Gupta,et al.  Fault-containing network protocols , 1997, SAC '97.

[24]  Sébastien Tixeuil,et al.  Self-stabilization with path algebra , 2003, Theor. Comput. Sci..

[25]  Azim Eskandarian,et al.  Challenges of intervehicle ad hoc networks , 2004, IEEE Transactions on Intelligent Transportation Systems.

[26]  Valmir Carneiro Barbosa,et al.  A distributed algorithm to find k-dominating sets , 2004, Discret. Appl. Math..

[27]  Bertrand Ducourthial,et al.  r-Semi-Groups: A Generic Approach for Designing Stabilizing Silent Tasks , 2007, SSS.

[28]  Colette Johnen,et al.  Robust self-stabilizing weight-based clustering algorithm , 2009, Theor. Comput. Sci..

[29]  Rachid Guerraoui,et al.  Software-Based Replication for Fault Tolerance , 1997, Computer.

[30]  Arshad Jhumka,et al.  On the Design of Mobility-Tolerant TDMA-Based Media Access Control (MAC) Protocol for Mobile Sensor Networks , 2007, ICDCIT.

[31]  Shlomi Dolev,et al.  Self-Stabilization as a Foundation for Autonomic Computing , 2007, The Second International Conference on Availability, Reliability and Security (ARES'07).

[32]  Murat Demirbas,et al.  A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[33]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[34]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[35]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.