Zhengnan Shi

Learn More
In the self-stabilizing algorithmic paradigm, each node has a local view of the system, in a finite amount of time the system converges to a global state with desired property. In a graph , a subset is a -packing if . In this paper, an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal -packing in an arbitrary graph is(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 adaptive selfstabilizing 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)