A Self-Stabilizing Minimal k-Grouping Algorithm

ABSTRACT

We consider the minimal k-grouping problem: given a graph G = (V, E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent self-stabilizing asynchronous distributed algorithm for this problem in the composite atomicity model of computation, assuming the network has unique process identifiers. Our algorithm works under the weakly-fair daemon. The time complexity (i.e. the number of rounds to reach a legitimate configuration) of our algorithm is O (nD/k) where n is the number of processes in the network and D is the diameter of the network. The space complexity of each process is O((n + nfalse) log n) where nfalse is the number of false identifiers, i.e., identifiers that do not match the identifier of any process, but which are stored in the local memory of at least one process at the initial configuration. Our algorithm guarantees that the number of groups is at most 2n/k + 1 after convergence. We also give a novel composition technique to concatenate a silent algorithm repeatedly, which we call loop composition.

References

1. A. D Amis, R. Prakash, T. HP. Vuong, and D. T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proc. of INFOCOM 2000, volume 1, pages 32--41, 2000.
2. A. K. Datta, S. Gurumurthy, F. Petit, and V. Villain. Self-stabilizing network orientation algorithms in arbitrary rooted networks. In Proc. of ICDCS 2000, pages 576--583, 2000.
3. A. K. Datta, L. L. Larmore, S. Devismes, K. Heurtefeux, and Y. Rivierre. Competitive self-stabilizing k-clustering. In Proc. of ICDCS 2012, pages 476--485, 2012.
4. A. K. Datta, L. L. Larmore, S. Devismes, K. Heurtefeux, and Y. Rivierre. Self-stabilizing small k-dominating sets. International Journal of Networking and Computing, 3(1):116--136, 2013.
5. A. K Datta, L. L Larmore, and P.l Vemula. An O(n)-time self-stabilizing leader election algorithm. Journal of Parallel and Distributed Computing, 71(11):1532--1544, 2011.
6. J. S. Deogun, D. Kratsch, and G. Steiner. An approximation algorithm for clustering graphs with dominating diametral path. IPL, 61(3):121--127, 1997.
7. EW Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the ACM, 17:643--644, 1974.
8. S. Dolev. Self-stabilization. MIT press, 2000.
9. S. Dolev and T. Herman. Parallel composition of stabilizing algorithms. In Proc. of WSS 1999, pages 25--32, 1999.
10. B. Ducourthial, S. Khalfallah, and F. Petit. Best-effort group service in dynamic networks. In Proc. of SPAA 2010, pages 233--242, 2010.
11. Y. Fernandess and D. Malkhi. K-clustering in wireless ad hoc networks. In Proceedings of the second ACM international workshop on Principles of mobile computing, pages 31--37, 2002.
12. T. R. Herman. Adaptivity through distributed convergence. PhD thesis, University of Texas at Austin, 1992.
13. Y. Yamauchi, S. Kamei, F. Ooshita, Y. Katayama, H. Kakugawa, and T. Masuzawa. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property. IEICE transactions on information and systems, 92(3):451--459, 2009.
14. Y. Yamauchi, S. Kamei, F. Ooshita, Y. Katayama, H. Kakugawa, and T. Masuzawa. Timer-based composition of fault-containing self-stabilizing protocols. Information Sciences, 180(10):1802--1816, 2010.