Badreddine BenreguiaUniversity of Batna-2 · Computer Sciences
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
Citations since 2017
6 Research Items
Badreddine Benreguia currently works at the Department of Informatics, Batna-2 University. Badreddine does research in Distributed Computing and Computer Communications (Networks). Their most recent publication is 'Self-stabilization on Scale-free Networks'.
Skills and Expertise
This paper tackles the problem of locating the diffusion source in networks. Designating all nodes of the network as observers for locating the diffusion source is very complex and impracticable. To make this problem solvable in a simple manner, only a subset of nodes is used as observers. Choosing these observers can be a challenging task, as the...
In this paper, we study how users can act as witnesses to limit the spread of fake news. We present a new technique based on consulting a set of users, called witnesses. Before resharing a content M by a user A , a set of k users (witnesses) are selected randomly, by the system, from the friends set of A . Witnesses are asked to validate the conten...
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...
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) to ensure a permanent service availability. Since failures occur frequently inside WSN due to limited battery energy, self-st...
Graph matching is a comparison process of two objects represented as graphs through finding a correspondence between vertices and edges. This process allows defining a similarity degree (or dissimilarity) between the graphs. Generally, graph matching is used for extracting, finding and retrieving any information or sub-information that can be repre...
Many of self-stabilizing algorithms have been proposed in literature to deal with fault-tolerance in distributed systems. Most existing works have utilized random graphs (Erdos-Renyi networks) to simulate self-stabilizing algorithms. In the present paper, we propose the use of self-stabilizing algorithms on scale-free graphs (Barabasi-Albert networ...
This paper describes an algorithm for graph isomorphism problem. A consistency rule is proposed to detect as soon as possible the isomorphism permutation. The algorithm, called CRGI, tries to find an isomorphism between two input graphs through a backtracking exploration that uses a proposed consistency rule to prune the tree-search. This rule is b...