Under a dense and large IoT network, a star topology where each device is directly connected to the Internet gateway may cause serious waste of energy and congestion …
The emergence of Wireless Sensor Networks (WSNs) attracts attention of the research communities since they cover several domains of Internet of things (IoT). The …
ST Hedetniemi - Structures of Domination in Graphs, 2021 - Springer
In this chapter, we introduce the self-stabilizing algorithm model and present several definitive examples that illustrate the simplicity and elegance of this algorithmic paradigm …
C Liang, B Zhou, H Guo - The Computer Journal, 2021 - academic.oup.com
Given a graph, the status of a vertex is the sum of the distances between the vertex and all other vertices. The minimum status of a graph is the minimum of statuses of all vertices of …
In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In …
D Bouhata, S Bouam, H Moumen… - … homepage: http://iieta …, 2024 - researchgate.net
This study devises self-stabilizing algorithms that leverage the expression distance-2 paradigm to compute (i) a maximal distance-2 independent set, wherein selected nodes …
Dynamic distributed systems are used widely in everyday life by dealing with exploitation and treatment on information, documents, services, medias, and all entertainment means …
Y Touahra, NH Khaloua, I Derradj… - Algerian Journal of …, 2024 - asjp.cerist.dz
Self-stabilization is a technic for handling transient faults in distributed systems introduced by Dijkstra in 1973. A distributed system is considered to be self-stabilizing if it can recover a …