Abstract
In this paper, we propose two new self-stabilizing algorithms, MWCDS-C and MWCDS-D, for minimal weakly connected dominating sets in an arbitrary connected graph. Algorithm MWCDS-C stabilizes in O(n4) steps using an unfair central daemon and space requirement at each node is O(log n) bits at each node for an arbitrary connected graph with n nodes; it uses a designated node while other nodes are identical and anonymous. Algorithm MWCDS-D stabilizes using an unfair distributed daemon with identical time and space complexities, but it assumes unique node IDs. In the literature, the best reported stabilization time for a minimal weakly connected dominating set algorithm is O(nmA) under a distributed daemon [1], where m is the number of edges and A is the number of moves to construct a breadth-first tree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
