Self-stabilizing Algorithm for Maximal Distance-2 Independent Set

TL;DR

This paper introduces a self-stabilizing algorithm for computing a maximal independent set with nodes at least distance 3 apart, enhancing network control and fault tolerance.

Contribution

It presents a novel self-stabilizing algorithm for a distance-3 independent set, with proven correctness and convergence, suitable for large-scale network applications.

Findings

Algorithm effectively finds fewer nodes in large networks.

Ensures strong control and fault tolerance in network management.

Proven convergence and correctness of the algorithm.

Abstract

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