We consider graph coloring and related problems in the distributed message-passing
model.\em Locally-iterative algorithms are especially important in this setting. These are …

Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the
system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the …

Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed
computing. The local nature of an MIS allows for fast solutions in a static distributed setting …

Maximal independent set (MIS) is a very important structure that provides data aggregation,
topology control and routing for wireless sensor networks (WSNs). Energy-efficient and fault …

We study a simple random process that computes a maximal independent set (MIS) on a
general n-vertex graph. Each vertex has a binary state, black or white, where black indicates …

Self-stabilizing algorithms for optimization problems can often be solved more easily using
the distance-two model in which each vertex can instantly see the state information of all …

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental
communication layer technologies in the Internet of Things. Battery-powered sensor nodes …

In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs.
Lattice linearity allows a node to execute its actions with old information about the state of …

A distributed system is self-stabilizing if, regardless of its initial state, the system is
guaranteed to reach a legitimate (ie, correct) state in finite time. In 2007, Turau proposed the …

Given a graph G=(V, E), a 2-minimal dominating set (2-MDS) of G is a minimal dominating
set D⊆ V such that D∖{pi, pj}∪{pz} is not a dominating set for any nodes pi, pj∈ D (pi≠ pj) …