Badreddine Benreguia

Badreddine Benreguia

Auto-generated profile, based on publicly available information

Badreddine Benreguia

Computer science department, University of Batna 2, Batna, Algeria

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2020 in IEEE Access
Verified
Journal Article
Open access
BBBadreddine Benreguia
Badreddine Benreguia
HMHamouma MOUMEN
Hamouma MOUMEN
MMMohammed Amine Merzoug
Mohammed Amine Merzoug
Nowadays, the coronavirus pandemic has and is still causing large numbers of deaths and infected people. Although governments all over the world have taken severe measurements to slow down the virus spreading (e.g., travel restrictions, suspending all sportive, social, and economic activities, quarantines, social distancing, etc.), a lot of persons have died and a lot more are still in danger. Indeed, a recently conducted study [1] has reported that 79% of the confirmed infections in China were caused by undocumented patients who had no symptoms. In the same context, in numerous other countries, since coronavirus takes several days before the emergence of symptoms, it has also been reported that the known number of infections is not representative of the real number of infected people (the actual number is expected to be much higher). That is to say, asymptomatic patients are the main factor behind the large quick spreading of coronavirus and are also the major reason that caused governments to lose control over this critical situation. To contribute to remedying this global pandemic, in this paper, we propose an IoTa investigation system that was specifically designed to spot both undocumented patients and infectious places. The goal is to help the authorities to disinfect high-contamination sites and confine persons even if they have no apparent symptoms. The proposed system also allows determining all persons who had close contact with infected or suspected patients. Consequently, rapid isolation of suspicious cases and more efficient control over any pandemic propagation can be achieved. aIoT: Internet of Things.

3 April 2022 in International Journal of Computer Mathematics: Computer Systems Theory
Verified
Journal Article
Closed access
LSLeila Saadi
Leila Saadi
BBBadreddine Benreguia
Badreddine Benreguia
CAChafik Arar
Chafik Arar
HMHamouma MOUMEN
Hamouma MOUMEN
This paper deals with the problem of finding dominating set using self-stabilization paradigm in distributed systems. Usually, members of a dominating set are selected to be as cluster heads in Wireless Sensor Networks (WSN) in order to ensure a permanent service availability. Since failures occurs frequently inside WSN due to limited battery energy, self-stabilizing algorithm allows recomputing the dominating set, and hence the network returns to its ordinary running. Existing works have introduced many variants of self-stabilizing algorithms that compute minimal dominating set S where each node out of S has neighbors in S more than it has out S. In this paper, we introduce a generalized self-stabilizing algorithm called minimal (α,β)-dominating set. An α-dominating set is a subset of nodes S such that for any node v out of S, the rate of neihgbors of v inside S must be greater than α, where 0<α≤1. In the same way, an (α,β)-dominating set is a subset of nodes S such that: S is α-dominating set and for each node v in S, the rate of neihgbors of v inside S is greater than β, where 0≤β≤1. Mathematical proofs and simulation tests show the correctness and the efficiency of the proposed algorithm. Through our proposed variant (α,β)-domination, we prove rigorously the conjecture of Carrier et. al. [ 23 F. Carrier, A. K. Datta, S. Devismes, L. L. Larmore, Y. Rivierre, Self-stabilizing (f,g)-alliances with safe convergence, Journal of Parallel and Distributed Computing, Volumes 81–82, 2015, Pages 11-23, https://doi.org/10.1016/j.jpdc.2015.02.001. [Crossref] , [Google Scholar] ] who have proposed a self-stabilizing algorithm for a domination variant called (f,g)-alliance set only when f≥g. We prove the correctness of the case f<g.

19 June 2023 in IEEE Access
Verified
Journal Article
Open access
BBBadreddine Benreguia
Badreddine Benreguia
CAChafik Arar
Chafik Arar
HMHamouma MOUMEN
Hamouma MOUMEN
MMMohammed Amine Merzoug
Mohammed Amine Merzoug
This paper focuses on limiting misinformation propagation in networks. Its first contribution is introducing the notion of vaccinated observers, which is a node enriched with additional power. Vaccination is adding, locally, a plugin or asking for the help of a trusted third party, called a trusted authority. The plugin or the authority is able to detect if the received information is misinformation or not. Vaccinated Observers must stop forwarding detected misinformation. Based on this notion, two algorithms for limiting misinformation are proposed. The second contribution of the paper is an algorithm based on Moving Observers for locating a strong adversary diffusion source. This algorithm selects a random subset of nodes as observers for a random period Δ. This means that the observer subset may change over time in a randomized manner. Consequently, the strong adversary diffusion source can’t have global knowledge about observers positions. Having these positions by the diffusion source will make its localization by the observers more complicated, even impossible. The third contribution is proposing an algorithm for stopping misinformation propagation based on a punishment strategy. This algorithm has a very simple principle design and it assumes that an authority or a mechanism A is available. The authority A has the ability to detect if the received information is misinformation or not. If a node ni receives information m from its neighbor nj and m is detected, by ni via the authority A , as misinformation then nj is punished for a period pp ( pp stands for punishment period). If the node nj repeats this action for n time then the punishment period increases to n * pp . The punishment in this algorithm is stopping the forwarding of the information received from a punished node nj . The simulation results show that the proposed techniques are both efficient and accurate while locating the diffusion source. Consequently, misinformation propagation is limited.