An active detection of compromised nodes based on en-route trap in wireless sensor network

JT Wang, ZX Liu - International Journal of Distributed Sensor …, 2021 - journals.sagepub.com
With the development and wide use of wireless sensor network, security arises as an
essential issue since sensors with restrict resources are deployed in wild areas in an …

Towards a cds-based intrusion detection deployment scheme for securing industrial wireless sensor networks

L Bayou, N Cuppens-Boulahia… - … and Security (ARES), 2016 - ieeexplore.ieee.org
The use of wireless communication is a major trend in the so called Supervisory Control and
Data Acquisition systems (SCADA). Consequently, Wireless Industrial Sensor Networks …

On the parameterized complexity of the edge monitoring problem

J Baste, F Beggas, H Kheddouci, I Sau - Information Processing Letters, 2017 - Elsevier
In a graph G=(V, E), a vertex v∈ V monitors an edge {u, u′}∈ E if {v, u}∈ E and {v, u′}∈
E. Given an n-vertex graph G=(V, E), in which each edge is contained in at least one …

Assessment and enforcement of wireless sensor network-based SCADA systems security

L Bayou - 2018 - theses.hal.science
The security in Industrial Control Systems is a major concern. Indeed, these systems
manage installations that play an important economical role. Furthermore, targeting these …

Complexity of edge monitoring on some graph classes

G Bagan, F Beggas, M Haddad, H Kheddouci - Discrete Applied …, 2022 - Elsevier
In this paper, we study the complexity of the edge monitoring problem. A vertex v monitors
an edge e if both endpoints together with v form a triangle in the graph. Given a graph G=(V …

Edge monitoring problem on interval graphs

G Bagan, F Beggas, M Haddad, H Hheddouci - Electronic Notes in Discrete …, 2016 - Elsevier
Edge monitoring is a simple and effective mechanism for the security of wireless sensor
networks. The idea is to award specific roles (monitors) to some sensor nodes of the …

Decomposition and Domination of Some Graphs

F Beggas - 2017 - hal.science
Graph theory is considered as a field exploring a large variety of proof techniques in discrete
mathematics. Thus, the various problems treated in this theory have applications in a lot of …

Self-stabilizing algorithms for graph parameters

B Neggazi - 2015 - theses.hal.science
The concept of self-stabilization was first introduced by Dijkstra in 1973. A distributed system
is self-stabilizing if it can start from any possible configuration and converges to a desired …

Complexity of Edge Monitoring on Some Graph Classes

G Bagan, F Beggas, M Haddad… - arXiv preprint arXiv …, 2017 - arxiv.org
In this paper, we study the complexity of the edge monitoring problem. A vertex $ v $
monitors an edge $ e $ if both extremities together with $ v $ form a triangle in the graph …