Abstract
The maximum leaf spanning tree (MLST) is a good candidate for constructing a virtual backbone in self-organized multihop wireless networks, but is practically intractable (NP-complete). Self-stabilization is a general technique that permits to recover from catastrophic transient failures in self-organized networks without human intervention. We propose a fully distributed self-stabilizing approximation algorithm for the MLST problem in arbitrary topology networks. Our algorithm is the first self-stabilizing protocol that is specifically designed to approximate an MLST. It builds a solution whose number of leaves is at least 1/3 of the maximum possible in arbitrary graphs. The time complexity of our algorithm is O(n 2) rounds.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Anagnostou E, Hadzilacos V (1993) Tolerating transient and permanent failures (extended abstract). In: Proceedings of the 7th international workshop on distributed algorithms. LNCS, vol 725. Springer, Berlin, pp 174–188
Ben-Or M, Dolev D, Hoch EN (2008) Fast self-stabilizing byzantine tolerant digital clock synchronization. In: Proceedings of the twenty-seventh ACM symposium on principles of distributed computing, pp 385–394
Blin L, Potop-Butucaru M, Rovedakis S (2009) Self-stabilizing minimum-degree spanning tree within one from the optimal degree. In: Proceedings of the 23th IEEE international parallel and distributed processing symposium.
Blin L, Potop-Butucaru MG, Rovedakis S, Tixeuil S (2009) A new self-stabilizing minimum spanning tree construction with loop-free property. In: Proceedings of the 23rd international symposium on distributed computing. LNCS, vol 5805. Springer, Berlin, pp 407–422
Butelle F, Lavault C, Bui M (1995) A uniform self-stabilizing minimum diameter tree algorithm. In: Proceedings of the 9th international workshop on distributed algorithms. LNCS, vol 972. Springer, Berlin, pp 257–272
Cobb JA, Gouda MG (2002) Stabilization of general loop-free routing. J Parallel Distrib Comput 62:922–944
Datta AK, Larmore LL, Vemula P (2008) Self-stabilizing leader election in optimal space. In: Proceedings of the 10th international symposium on stabilization, safety, and security of distributed systems. LNCS, vol 5340. Springer, Berlin, pp 109–123
Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11):643–644
Dolev S (2000) Self-stabilization. MIT Press, Cambridge
Dolev S, Herman T (1997) Superstabilizing protocols for dynamic distributed systems. Chic J Theor Comput Sci 3(4):1–40
Dolev S, Welch JL (1997) Wait-free clock synchronization. Algorithmica 18(4):486–511
Dolev S, Welch JL (2004) Self-stabilizing clock synchronization in the presence of byzantine faults. J ACM 51:780–799
Galbiati G, Maffioli F, Morzenti A (1994) A short note on the approximability of the maximum leaves spanning tree problem. Inf Process Lett 52(1):45–49
Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York
Gartner FC (2003) A survey of self-stabilizing spanning-tree construction algorithms. Technical report, EPFL
Gopal AS, Perry KJ (1993) Unifying self-stabilization and fault-tolerance (preliminary version). In: Proceedings of the 12th annual ACM symposium on principles of distributed computing, pp 195–206
Johnen C, Tixeuil S (2003) Route preserving stabilization. In: Proceedings of the 6th international symposium on self-stabilizing systems. LNCS, vol 2704. Springer, Berlin, pp 184–198
Kamei S, Kakugawa H (2007) A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS workshop on advances in parallel and distributed computational models. IEEE Comput Soc, Los Alamitos, p 224
Lu HI, Ravi R (1998) Approximating maximum leaf spanning trees in almost linear time. J Algorithms 29:132–141
Papatriantafilou M, Tsigas P (1997) On self-stabilizing wait-free clock synchronization. Parallel Process Lett 7(3):321–328
Raei H, Tabibzadeh M, Ahmadipoor B, Saei S (2009) A self-stabilizing distributed algorithm for minimum connected dominating sets in wireless sensor networks with different transmission ranges. In: Proceedings of the 11th international conference on advanced communication technology. IEEE Comput Soc, Los Alamitos, pp 526–530
Solis-Oba R (1998) 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Proceedings of the 6th annual European symposium on algorithms. LNCS, vol 1461. Springer, Berlin, pp 441–452
Tixeuil S (2009) Self-stabilizing algorithms. In: Algorithms and theory of computation handbook, 2nd edn. Chapman & Hall/CRC applied algorithms and data structures. Taylor & Francis, London.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Kamei, S., Kakugawa, H., Devismes, S. et al. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. J Comb Optim 25, 430–459 (2013). https://doi.org/10.1007/s10878-011-9383-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9383-5