Dhia Mahjoub

Learn More
is a rising technology that promises to bridge the gap between the physical and digital worlds. Being limited in processing power, memory space, communication range and energy resources as well as unlikely prone to human intervention, WSN communications put extra challenges on the routing task. In addition, the wide variety of sensor applications often(More)
For a random geometric graph G(n, r) of minimum degree δ, we introduce an efficient algorithm for selecting (δ + 1) backbones with disjoint node sets that are each independent (1 − ε) dominating sets of G. The backbone node sets are determined by a graph coloring algorithm employing only the topology (not the geometry) of G(n, r), and the backbone links are(More)
The domatic partition problem seeks to maximize the partitioning of the nodes of the network into disjoint dominating sets. These sets represent a series of virtual backbones for wireless sensor networks to be activated successively , resulting in more balanced energy consumption and increased network robustness. In this study, we address the domatic(More)
We recently proposed in [19, 20] to use sequential graph coloring as a systematic algorithmic method to build (1 − ϵ) dominating sets partition in Wireless Sensor Networks (WSN) modeled as Random Geometric Graphs (RGG). The resulting partition of the network into dominating and almost dominating sets can be used as a series of rotating backbones in a WSN to(More)
When predicting and containing malware or botnet infections, we can use some ideas from studies of disease epidemics. The malware research community has long dedicated its expertise to dissecting malware binaries and examining footprints on victim systems – studying the disease and the patient in an isolated environment, if using the disease study as an(More)
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RGGs). In particular, we model these problems as Integer Linear Programs (ILPs), solve them optimally, and show on a large set of samples that RGGs are independent domatically full(More)
  • 1