  In graph theory, an independent set is a subset of nodes where there are no
two adjacent nodes. The independent set is maximal if no node outside the
independent set can join it. In network applications, maximal independent sets
can be used as cluster heads in ad hoc and wireless sensor networks. In order
to deal with any failure in networks, self-stabilizing algorithms have been
proposed in the literature to calculate the maximal independent set under
different hypotheses. In this paper, we propose a self-stabilizing algorithm to
compute a maximal independent set where nodes of the independent set are far
from each other at least with distance 3. We prove the correctness and the
convergence of the proposed algorithm. Simulation tests show the ability of our
algorithm to find a reduced number of nodes in large scale networks which
allows strong control of networks
