We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.
We investigate the existence of deterministic uniform self-stabilizing algorithms (DUSSAs) for a number or problems on connected undirected graphs. This investigation is carried out under three models of parallelism, namely central daemon, restricted parallelism, and maximal para
The graph search problem asks for a strategy that enables a minimum sized team of searchers to capture a “fugitive” while it evades and potentially multiplies through a network. It is motivated by the need to eliminate fast spreading viruses and other malicious software agents in
In large-scale, heavy loaded sensor networks the hidden node problem significantly restricts the attainable throughput. This paper examines this issue and depicts why most TDMA as well as dedicated hybrid MAC protocols are still negatively affected by this phenomenon. The concept
We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault tolerant (reliable) in the sen
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilzze any computation zn time polynomial in the (unknown) network dzameter Thzs version sacrzfic
In the population protocol model, many problems cannot be solved in a self-stabilizing manner. However, global knowledge, such as number of nodes network, sometimes enables design for problems. For example, it is known that we can solve leader election complete graphs if and only