EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem

Sayaka Kamei, Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa

Concurrency and Computation: Practice and Experience · 2026-08 · 38 (15)

DOI: 10.1002/cpe.70872 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Concurrency and Computation: Practice and Experience, online erschienen am 22.07.2026. Verfasst von Sayaka Kamei und 3 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Japan Society for the Promotion of Science.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In a network , a set of processes is a total dominating set if and only if every process is neighboring to some member of . We introduce the dynamic total domination problem , a novel synchronization challenge that requires sustaining a total dominating set in a network over time. Unlike static approaches, this problem ensures that every process always has at least one neighbor in , while processes alternate between entering and exiting . This problem has practical applications, notably in environmental monitoring IoT systems powered by rechargeable batteries, where continuous sensing coverage is essential. In this paper, we propose two self‐stabilizing distributed algorithms for the dynamic total domination problem under a weakly fair distributed scheduler. The first algorithm utilizes unbounded timestamps, while the second employs bounded timestamps. Both algorithms guarantee convergence in rounds and ensure safety and liveness without centralized control. In the synchronized model (a special case of distributed scheduler), the waiting times of both algorithms are rounds.

Förderung

  • Japan Society for the Promotion of Science

Zitieren

APA

Kamei, S., Shibata, M., Ooshita, F., & Kakugawa, H. (2026). Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem. Concurrency and Computation: Practice and Experience, 38(15). https://doi.org/10.1002/cpe.70872

Vancouver

Kamei S, Shibata M, Ooshita F, Kakugawa H. Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem. Concurrency and Computation: Practice and Experience. 2026;38(15). doi:10.1002/cpe.70872

BibTeX
@article{Kamei2026,
  author = {Kamei, Sayaka and Shibata, Masahiro and Ooshita, Fukuhito and Kakugawa, Hirotsugu},
  title = {Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem},
  journal = {Concurrency and Computation: Practice and Experience},
  year = {2026},
  volume = {38},
  number = {15},
  doi = {10.1002/cpe.70872}
}
Kostenlos starten →