We present an anonymous self-stabilizing algorithm for finding a 1-maximal matching in trees, and rings of length not divisible by 3. We show that the algorithm converges in O(n 4) moves under an arbitrary central daemon.
We present an anonymous, constant-space, self-stabilizing algorithm for finding a 1-maximal independent set in tree graphs (and some rings). We show that the algorithm converges in O(n 2) moves under an unfair central daemon.
In this paper, we propose an adaptive self-stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with communication requests between the nodes in the network. The set changes as the network topology changes. It contains redundancy nodes and can be used as a backbone of an ad hoc mobile… (More)
— In this paper, we first propose an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal 2-packing in an arbitrary graph. Using a graph G = (V, E) to represent the network, a subset S ⊆ V is a 2-packing if ∀i ∈ V : |N [i] ∩ S| ≤ 1. Self-stabilization is a paradigm such that each node has a local view of the system, in a finite… (More)
In this paper, we propose an efficient distributed protocol for online gossiping problem in any types of networks, especially for mobile networks and fault-tolerant networks. The nodes in the networks have limited information of the entire network. Each node knows its neighboring nodes. The proposed gossiping protocol is fully distributed and tolerates node… (More)
—In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an ID-based, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching—an optimum solution, if one exist. We show that the algorithm stabilizes in moves under… (More)