Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets

03/21/2022
βˆ™
by   Barton F. Cone, et al.
βˆ™
0
βˆ™

Sensor networks, such as ultra-wideband sensors for the smart warehouse, may need to run distributed algorithms for automatically determining a topological layout. In this paper, we present 5 different self-stabilizing algorithms (their central and distributed counterparts) for determining maximal independent sets. The performance of the algorithms, in terms of time complexity, simulation analysis, and size of maximal independent sets found are then compared.

READ FULL TEXT
research
βˆ™ 03/25/2022

Move Complexity of a Self-Stabilizing Algorithm for Maximal Independent Sets

A_𝖽𝖾𝗀 is a self-stabilizing algorithm that computes a maximal independen...
research
βˆ™ 01/26/2021

Self-stabilizing Algorithm for Maximal Distance-2 Independent Set

In graph theory, an independent set is a subset of nodes where there are...
research
βˆ™ 07/18/2018

On graphs admitting two disjoint maximum independent sets

An independent set A is maximal if it is not a proper subset of an indep...
research
βˆ™ 04/07/2018

Distributed Maximal Independent Set on Scale-Free Networks

The problem of distributed maximal independent set (MIS) is investigated...
research
βˆ™ 02/14/2023

Distributed Symmetry Breaking on Power Graphs via Sparsification

In this paper, we present efficient distributed algorithms for classical...
research
βˆ™ 11/26/2019

3D IC optimal layout design. A parallel and distributed topological approach

The task of 3D ICs layout design involves the assembly of millions of co...
research
βˆ™ 11/14/2012

Gap Processing for Adaptive Maximal Poisson-Disk Sampling

In this paper, we study the generation of maximal Poisson-disk sets with...

Please sign up or login with your details

Forgot password? Click here to reset