Battery state-of-health prediction-based clustering for lifetime optimization in IoT networks

MS Batta, H Mabed, Z Aliouat… - IEEE Internet of Things …, 2022 - ieeexplore.ieee.org
The Internet of Things (IoT) represents a pervasive system that continuously demonstrates
an expanded application in various domains. The energy-efficiency problem has always …

A distributed multi-hop intra-clustering approach based on neighbors two-hop connectivity for iot networks

MS Batta, H Mabed, Z Aliouat, S Harous - Sensors, 2021 - mdpi.com
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 …

A distributed tdma scheduling algorithm for latency minimization in internet of things

MS Batta, S Harous, L Louail… - 2019 IEEE International …, 2019 - ieeexplore.ieee.org
The emergence of Wireless Sensor Networks (WSNs) attracts attention of the research
communities since they cover several domains of Internet of things (IoT). The …

Self-stabilizing domination algorithms

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 …

Minimum status, matching and domination of graphs

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 …

Self-stabilizing algorithm for maximal distance-2 independent set

B Benreguia, H Moumen, S Bouam, C Arar - arXiv preprint arXiv …, 2021 - arxiv.org
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 …

一种新的无线传感网络的时隙分配策略

刘小强 - Journal of terahertz science and electronic information …, 2021 - opticsjournal.net
摘要时隙分配是时分多址(TDMA) 接入的核心. TMDA 将时间划分为若干个固定时隙, 使2
个干扰的节点在不同时隙内传输数据, 进而降低接入碰撞率. 为此, 提出基于分布式TDMA …

[PDF][PDF] Self-Stabilizing Algorithms for Computing Maximal Distance-2 Independent Sets and Minimal Dominating Sets in Networks

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 …

Self-stabilization in dynamic distributed systems

L Saadi - 2022 - eprints.univ-batna2.dz
Dynamic distributed systems are used widely in everyday life by dealing with exploitation
and treatment on information, documents, services, medias, and all entertainment means …

A Survey on Distributed Self-Stabilizing Algorithms for Finding Independent Sets

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 …