Fast, silent self-stabilizing distance-k independent dominating set construction

• The protocol FIDFID builds in self-stabilizing manner distance-k independent dominating sets.
• The protocol FIDFID is silent, fast and simple.
• The protocol FIDFID works properly under any schedule.
• The correctness and the termination of the protocol FIDFID is proven.
• The convergence time to reach a legitimate configuration is established: 4n+k4n+k where n is the network size.

We propose a fast, silent self-stabilizing protocol building a distance-k   independent dominating set, named FIDFID. The convergence of the protocol FIDFID is established for any computation under the unfair distributed scheduler. The protocol FIDFID reaches a terminal (also legitimate) configuration in at most 4n+k4n+k rounds, where n   is the network size; it requires (k+1)log(n+1)(k+1)log(n+1) bits per node.