Self-stabilizing Algorithm for Minimal α-Dominating Set

06/01/2020
by   Badreddine Benreguia, et al.
0

A self-stabilizing algorithm for the minimal α-dominating set is proposed in this paper. The α-domination parameter has not used before in self-stabilization paradigm. Using an arbitrary graph with n nodes and m edges, the proposed algorithm converges in O(nm) moves under distributed daemon. Simulation tests and mathematical proofs show the efficiency of the algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2021

Extending Lattice linearity for Self-Stabilizing Algorithms

In this article, we focus on extending the notion of lattice linearity t...
research
01/11/2019

Self-Stabilizing Distributed Cooperative Reset

Self-stabilization is a versatile fault-tolerance approach that characte...
research
05/07/2018

Neighborhood preferences for minimal dominating sets enumeration

We investigate two different approaches to enumerate minimal dominating ...
research
12/09/2020

On Distributed Algorithms for Minimum Dominating Set problem, from theory to application

In this paper, we propose a distributed algorithm for the minimum domina...
research
03/04/2014

An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

In this paper a new algorithm has been proposed which can fix the proble...
research
09/08/2020

Self-Stabilizing Construction of a Minimal Weakly 𝒮𝒯-Reachable Directed Acyclic Graph

We propose a self-stabilizing algorithm to construct a minimal weakly 𝒮𝒯...
research
10/09/2020

LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm

The LP WAN networks use gateways or base stations to communicate with de...

Please sign up or login with your details

Forgot password? Click here to reset