CERIST DL :: Browsing by Author "Derhab, Abdelouahid"

Browsing by Author "Derhab, Abdelouahid"

Now showing 1 - 20 of 32

A Comparison on MANETs’ Service Replication Schemes: Interest versus Topology Prediction
(Springer, 2010) Derhab, Abdelouahid; Hamdy, Mohamed; König-Ries, Birgitta
Mobile ad hoc networks (MANETs) are characterized by high dynamics in particular with respect to the formation of network partitions. The presence of unconnected partitions makes the deployed services inaccessible to some network participants. Service replication is employed as an approach to overcome this problem and to ensure higher service availability. Several protocols and algorithms for service replication in MANETs have been proposed. Most of these approaches apply topological analysis (like partitioning prediction) schemes to produce the required replication decisions. One approach, SDP, the Service Distribution Protocol, bases its decisions on analyzing interest in the service, an application layer concept. In this paper, we compare the performance of approaches based on these two criteria. First, we analyze protocols based on topology prediction and choose two typical representatives of this category, namely PSRP and SSRP. We then compare SDP as the only candidate using service interest to these two approaches. This comparison is based on an extensive set of simulation runs which are discussed in detail in the paper.
A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks
(Taylor et Francis, 2008-04-15) Derhab, Abdelouahid; Badache, Nadjib
In this paper, we propose a new architecture to solve the problem of mutual exclusion in mobile ad hoc networks (MANET). The architecture is composed of two layers: (i) a middleware layer that contains a token-based distributed mutual exclusion algorithm (DMEA) and (ii) a network layer that includes two routing forwarding strategies: one to route request messages and the other to route the token message. We also propose a request ordering policy that ensures the usual mutual exclusion properties and reduces the number of hops traversed per critical section (CS) access. The paper also addresses the problem of network partitioning and unreachable nodes. The proposed mutual exclusion algorithm is further enhanced to provide fault tolerance by preventing the loss of the token and generating a new token if the token loss event occurs. The performance complexity as well as the experimental results show that the proposed algorithm experiences low number of hops per CS access.
A Resource-based Mutual Exclusion Algorithm supporting Dynamic Acting Range and Mobility for Wireless Sensor and Actor Networks
(CERIST, 2010-05) Derhab, Abdelouahid; Zair, Mustapha
Achieving optimal actor resources usage is one of the fundamental issues in Wireless sensor and Actor Networks (WSANs). One solution is to maximize the mutually exclusive regions (i.e., regions covered by one actor). In this paper, we take a novel approach to define and resolve the mutual exclusion problem. We propose CRMEA, (Centralized Resource-based Mutual Exclusion Algorithm), that constructs an actor cover set whose cost is less than the sole mutual exclusion algorithm existing in the literature. In addition, extensions supporting dynamic acting range and mobility are added to CRMEA. Simulation results show that the proposed extensions can save up to 50%¡90% of actor resources when compared with CRMEA. In addition, the mobility extension can overcome the large event-to-action delay problem and meet the requirements of the delay-sensitive applications.
Ad hoc networks routing protocols and mobility
(2006-04) Djenouri, Djamel; Derhab, Abdelouahid; Badache, Nadjib
An ad hoc network is a temporary infrastructureless network, formed dynamically by mobile devices without turning to any existing centralized administration. To send packets to remote nodes, a node uses other intermediate nodes as relays, and ask them to forward its packets. For this purpose, a distributed routing protocol is required. Because the devices used are mobile, the network topology is unpredictable, and it may change at any time. These topology changes along with other intrinsic features related to mobile devices, such as the energy resource limitation, make ad hoc networks challenging to implement efficient routing protocols. In this paper, we drive a GloMoSim based simulation study, to investigate the mobility effects on the performance of several mobile ad hoc routing protocols.
Balancing the tradeoffs between scalability and availability in mobile ad hoc networks with a flat hashing-based location service
(2008-06) Derhab, Abdelouahid; Badache, Nadjib
In this paper, we propose FSLS (Flat-based Some-for-some Location Service), a new location service for ad hoc mobile networks. The location service is based on the hash-based sets system that can offer a high location information availability. The network area is divided into non-overlapping zones. A node identifier is mapped to a set of home zones, each of which contains a unique location server, which makes FSLS works as a some-for-some approach. Using cross-layer design, the service can tolerate server mobility and server failures, and last for a long time period. We analyze FSLS and six other existing location services. The theoretical analysis as well as simulation results show that FSLS offers a good trade-off between location availability and scalability. It comes second after a quorum-based location service in terms of location availability and it is the closest competitor to a hierarchical location service in terms of scalability.
Collaborative detection and response framework against SQL injection attacks in IoT-based smart
(Springer Publisher whith IEEE, 2017-12-11) Boukhari, Chahira; Derhab, Abdelouahid; Guerroumi, Mohamed
In this paper, we propose a collaborative detection and re- sponse framework against SQL injection attacks in IoT-based smart grids. The framework is composed of a set of host-based detection sys- tems; each of which is deployed at a smart meter, in addition, at the data management server. When an attack at one host is detected, the network administrator is noti ed and remotely patches the other hosts. The detection engine is lightweight as each smart meters analyzes the log le associated with its network traffic. Hence, the framework is sacalable to large IoT-based smart grids as the detection task is performed by each smart meter and does not rely on a single component. Prelimary results are promising in terms of true positive and false positive rates.o
Distributed Algorithm for the Actor Coverage Problem in WSN-based Precision Irrigation Applications
(CERIST, 2011-05) Derhab, Abdelouahid; Lasla, Noureddine
In this paper, we study the actor coverage problem with the goal of meeting the requirements of precision irrigation applications in Wireless sensor and Actor Networks (WSANs), which are : (1) the volume of water applied by actors should match plant water demand and (2) minimizing over-irrigation to the least extent. We take a novel approach to deﬁne and resolve the actor coverage problem. Based on this approach, we propose two algorithms : Centralized Actor-Coverage-IRRIG (CACI) and Distributed Actor-Coverage-IRRIG (DACI). The existing centralized and distributed approaches for the minimum cost actor coverage problem in WSANs are not optimal for all metrics. The communication scheme of DACI is designed in the way that it can keep the advantages of the centralized and the distributed approaches without inheriting their weaknesses. DACI constructs an actor cover set with the same optimality cost as CACI while incurring low signaling overhead. Complexity analysis and simulations results show that CACI and DACI are both better than the existing centralized algorithm in terms of cover set optimality. Also, DACI is better than the existing distributed algorithm in terms of message overhead.
Distributed Algorithm for the Actor Coverage Problem in WSN-based Precision Irrigation Applications
(IEEE, 2011-05) Derhab, Abdelouahid; Lasla, Noureddine
In this paper, we study the actor coverage problem with the goal of meeting the requirements of precision irrigation applications in Wireless sensor and Actor Networks (WSANs), which are : (1) the volume of water applied by actors should match plant water demand and (2) minimizing over-irrigation to the least extent. We take a novel approach to deﬁne and resolve the actor coverage problem. Based on this approach, we propose two algorithms : Centralized Actor-Coverage-IRRIG (CACI) and Distributed Actor-Coverage-IRRIG (DACI). The existing centralized and distributed approaches for the minimum cost actor coverage problem in WSANs are not optimal for all metrics. The communication scheme of DACI is designed in the way that it can keep the advantages of the centralized and the distributed approaches without inheriting their weaknesses. DACI constructs an actor cover set with the same optimality cost as CACI while incurring low signaling overhead. Complexity analysis and simulations results show that CACI and DACI are both better than the existing centralized algorithm in terms of cover set optimality. Also, DACI is better than the existing distributed algorithm in terms of message overhead.
Distributed Low-Latency Data Aggregation Scheduling in Wireless Sensor Networks
(ACM, 2015-04) Bagaa, Miloud; Younis, Mohamed; Djenouri, Djamel; Derhab, Abdelouahid; Badache, Nadjib
This article considers the data aggregation scheduling problem, where a collision-free schedule is determined in a distributed way to route the aggregated data from all the sensor nodes to the base station within the least time duration. The algorithm proposed in this article (Distributed algorithm for Integrated tree Construction and data Aggregation (DICA)) intertwines the tree formation and node scheduling to reduce the time latency. Furthermore, while forming the aggregation tree, DICA maximizes the available choices for parent selection at every node, where a parent may have the same, lower, or higher hop count to the base station. The correctness of the DICA is formally proven, and upper bounds for time and communication overhead are derived. Its performance is evaluated through simulation and compared with six delay-aware aggregation algorithms. The results show that DICA outperforms competing schemes. The article also presents a general hardware-in-the-loop framework (DAF) for validating data aggregation schemes on Wireless Sensor Networks (WSNs). The framework factors in practical issues such as clock synchronization and the sensor node hardware. DICA is implemented and validated using this framework on a test bed of sensor motes that runs TinyOS 2.x, and it is compared with a distributed protocol (DAS) that is also implemented using the proposed framework.
DZ50: Energy-Efficient Wireless Sensor Mote Platform for Low Data Rate Applications
(CERIST, 2014-07-07) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Doudou, Messaoud; Zizoua, Cherif; Kafi, Mohamed Amine; Derhab, Abdelouahid; Djenouri, Djamel; Badache, Nadjib
A low cost and energy efficient wireless sensor mote platform for low data rate monitoring applications is presented. The new platform, named DZ50, is based on the ATmega328P micro-controller and the RFM12b transceiver, which consume very low energy in low-power mode. Considerable energy saving can be achieved by reducing the power consumption during inactive (sleep) mode, notably in low data rate applications featured by long inactive periods. Without loss of generality, spot monitoring in a Smart Parking System (SPS) and soil moisture in a Precision Irrigation System (PIS) are selected as typical representative of low data rate applications. The performance of the new platform is investigated for typical scenarios of the selected applications and compared with that of MicaZ and TelosB. Energy measurement has been carried out for different network operation states and settings, where the results reveal that the proposed platform allows to multiply the battery lifetime up to 7 times compared to MicaZ and TelosB motes in 10s sampling period scenarios.
DZ50: Energy-efficient Wireless Sensor Mote Platform for Low Data Rate Applications
(Elsevier, 2014) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Doudou, Messaoud; Zizoua, Cherif; Kafi, Mohamed Amine; Derhab, Abdelouahid; Djenouri, Djamel; Badache, Nadjib
A low cost and energy e_cient wireless sensor mote platform for low data rate monitoring applications is presented. The new platform, named DZ50, is based on the ATmega328P micro-controller and the RFM12b transceiver, which consume very low energy in low-power mode. Considerable energy saving can be achieved by reducing the power consumption during inactive (sleep) mode, notably in low data rate applications featured by long inactive periods. Without loss of generality, spot monitoring in a Smart Parking System (SPS) and soil moisture in a Precision Irrigation System (PIS) are selected as typical representative of low data rate applications. The performance of the new platform is investigated for typical scenarios of the selected applications and compared with that of MicaZ and TelosB. Energy measurements have been carried out for di_erent network operation states and settings, where the results reveal that the proposed platform allows to multiply the battery lifetime up to 7 times compared to MicaZ and TelosB motes in 10s sampling period scenarios.
Efficient Monitoring Mechanisms for Cooperative Storage in Mobile Ad-Hoc Networks : Detection Time and Accuracy Tradeoffs
(CERIST, 2009-02) Derhab, Abdelouahid; Senouci, Mustapha Reda; Badache, Nadjib
Distributed cooperative storage systems are designed to share the storage resources of network nodes for the common good of everyone, especially in dynamic ad hoc networks (MANETs) where the risk of data loss is high. In ad hoc networks, as mobile nodes operate on low-power battery and use limited storage capacity, data holders might behave selfishly by discarding some data they promised to store for other nodes in order to optimize their storage space for their own usage. To detect such a behavior, a monitoring mechanism, which checks whether a data is still held by the data holder, must be used. In this paper, we propose novel monitoring mechanisms that consider MANETs constraints and overcome the limitations of the existing monitors. Simulation results show that the proposed mechanism can o er a good trade-off between the rate of false positives and the time to detect misbehaved nodes.
ELS: Energy-Aware Some-for-Some Location Service for Ad Hoc Mobile Networks
(Springer Berlin Heidelberg, 2006) Derhab, Abdelouahid; Badache, Nadjib; Tari, Karim; Sami, Sihem
In this paper, we propose a new location service for Ad hoc mobile networks. The network area is divided into non-overlapping zones. Using a hash function, a node identifier is mapped to a set of zones, in which the location information of the node are stored. We also propose a location information distribution scheme that achieves low rate of outdated location information. Using cross-layer design, the service can tolerate servers mobility and failure, and last for a long time period. Simulation Results show that the proposed location service experiences low overhead and high location information availability and accuracy.
Enabling ad-hoc collaboration between mobile users in the MESSENGER project
(Kluwer Academic Publishers-Plenum, 2007-03) Maamar, Zakaria; Mahmoud, Qusay H.; Derhab, Abdelouahid
This paper discusses how ad-hoc collaboration boosts the operation of a set of messengers. This discussion continues the research we earlier initiated in the MESSENGER project, which develops data management mechanisms for UDDI registries of Web services using mobile users and software agents. In the current operation mode of messengers, descriptions of Web services are first, collected from UDDI registries and later, submitted to other UDDI registries. This submission mode of Web services descriptions does not foster the tremendous opportunities that both wireless technologies and mobile devices offer. When mobile devices are “close” to each other, they can form a mobile ad-hoc network that permits the exchange of data between these devices without any pre-existing communication infrastructure. By authorizing messengers to engage in ad-hoc collaboration, collecting additional descriptions of Web services from other messengers can happen, too. This has several advantages, but at the same time poses several challenges, which in fact highlight the complexity of ad-hoc networks.
Half-Symmetric Lens based localization algorithm for wireless sensor networks
(IEEE, 2012-10-25) Lasla, Noureddine; Derhab, Abdelouahid; Ouadjaout, Abdelraouf; Bagaa, Miloud; Ksentini, Adlen; Badache, Nadjib
The area-based localization algorithms use only the location information of some reference nodes, called anchors, to give the residence area of the remaining nodes. The current algorithms use triangle, ring or circle as a geometric shape to determine the sensors' residence area. Existing works suffer from two major problems: (1) in some cases, they might issue wrong decisions about nodes' presence inside a given area, or (2) they require high anchor density to achieve a low location estimation error. In this paper, we deal with the localization problem by introducing a new way to determine the sensors' residence area which shows a better accuracy than the existing algorithms. Our new localization algorithm, called HSL (Half Symmetric Lens based localization algorithm for WSN), is based on the geometric shape of half-symmetric lens. We also uses the Voronoi diagram in HSL to mitigate the problem of unlocalizable sensor nodes. Finally, we conduct extensive simulations to evaluate the performance of HSL. Simulation results show that HSL has better locatable ratio and location accuracy compared to representative state-of-the-art area-based algorithms.
Intertwined path formation and MAC scheduling for fast delivery of aggregated data in WSN
(Elsevier, 2014-12-24) Bagaa, Miloud; Younis, Mohamed; Derhab, Abdelouahid; Badache, Nadjib
This paper studies the problem of data aggregation scheduling in wireless sensor networks (WSNs) to minimize time latency. In prior work on this problem, a node is assigned a parent from the set of unscheduled nodes in order to prevent the creation of cycles. However, using such a strategy reduces the time-slot reuse and consequently has a negative impact on the time latency. To address these shortcomings, we propose IPS (Interwined Path formation and MAC Scheduling) , a novel cross-layer scheme for data aggregation scheduling that allows selecting a parent from all the node’s neighbors including the scheduled ones. IPS achieves reduced data delivery latency through three key design features, namely, (1) intertwining aggregation tree formation and scheduling, (2) for each node, a parent can be selected from already scheduled nodes so that the time latency is reduced and the cycles are prevented and (3) applying parent selection criteria that maximize the time slot reuse. We prove that the data delivery latency for IPS is upper-bounded by , where R is the network radius, Δ is the maximum node degree, and 0.05<∊⩽1. The simulation results show that IPS outperforms seven competing state-of-the-art aggregation scheduling algorithms in terms of latency and network lifetime
Low-Cost and Accurate Intra-flow Contention-Based Admission Control for IEEE 802.11 Ad Hoc Networks
(Springer Berlin Heidelberg, 2008) Derhab, Abdelouahid
In this paper, we propose a new admission control method for IEEE 802.11 ad hoc networks, called Low-cost and Accurate Admission control (LAAC). The proposed method has two variants: LAAC-Power and LAAC-CS. LAAC-Power estimates channel bandwidth availability through high power transmissions and LAAC-CS through passive monitoring of the channel. Due to the shared nature of the wireless medium, contention occurs among the nodes along a multi-hop path, which leads to intra-flow contention. LAAC accurately estimates the intra-flow contention. In addition, an analytical study demonstrates that LAAC achieves optimal results in terms of overhead and delay compared to the existing intra-flow contention-based admission control methods. LAAC also utilizes two criteria for accepting flows: one during the route request phase and the other during the route reply phase, which helps to reduce message overhead and avoid flooding route requests in hot spots. Simulation results show that LAAC-CS outperforms LAAC-Power in terms of packet delivery ratio, throughput, message overhead, and energy consumption.
Mobility Impact on Mobile Ad hoc Routing Protocols
(IEEE Computer Society, 2003) Djenouri, Djamel; Derhab, Abdelouahid; Badache, Nadjib
An ad hoc network is a set of mobile units connected by wireless technologies, making an infrastructureless temporary network. without turning to a central administration. The network topology is unpredictable, dynamic, it may change any time. These topology changes make ad hoc networks challenging to implement routing protocols. In this paper, we study mobility effects on the performance of several mobile ad hoc routing protocols.
Point In half symmetric LEns : A new range-free localization protocol for wireless sensor networks
(CERIST, 2011-02) Lasla, Noureddine; Derhab, Abdelouahid; Ouadjaout, Abdelraouf; Bagaa, Miloud; Badache, Nadjib
As location information is used by many sensor network applications, localization is considered a keystone in their design. Existing localization protocols can be classi ed as range-based or range-free approaches. Range- based approaches are costly as they require embedding each sensor node with an additional hardware to estimate inter-node distances. In contrast, the range-free approaches are cheaper, and they estimate node position by collecting information from some special nodes with known location called anchors. Thus, compared with range- based approaches, the range-free ones are more suitable for WSNs. In this paper, we propose PIV (Point In half Vesica-piscis), a new distributed range-free localization protocol for wireless sensor networks. PIV is designed based on the geometric concept of Vesica-piscis, which helps to relax some unrealistic assumptions and incur the lower cost. Complexity analysis and simulations results show that PIV has the lowest message cost among the existing localization schemes and o ers the best trade-o between location accuracy and ratio of localized nodes.
PReDIHERO – Privacy-Preserving Remote Deep Learning Inference based on Homomorphic Encryption and Reversible Obfuscation for Enhanced Client-side Overhead in Pervasive Health Monitoring
(IEEE, 2021) Boulemtafes, Amine; Derhab, Abdelouahid; Ait Ali Braham, Nassim; Challal, Yacine
Homomorphic Encryption is one of the most promising techniques to deal with privacy concerns, which is raised by remote deep learning paradigm, and maintain high classification accuracy. However, homomorphic encryption-based solutions are characterized by high overhead in terms of both computation and communication, which limits their adoption in pervasive health monitoring applications with constrained client-side devices. In this paper, we propose PReDIHERO, an improved privacy-preserving solution for remote deep learning inferences based on homomorphic encryption. The proposed solution applies a reversible obfuscation technique that successfully protects sensitive information, and enhances the client-side overhead compared to the conventional homomorphic encryption approach. The solution tackles three main heavyweight client-side tasks, namely, encryption and transmission of private data, refreshing encrypted data, and outsourcing computation of activation functions. The efficiency of the client-side is evaluated on a healthcare dataset and compared to a conventional homomorphic encryption approach. The evaluation results show that PReDIHERO requires increasingly less time and storage in comparison to conventional solutions when inferences are requested. At two hundreds inferences, the improvement ratio could reach more than 30 times in terms of computation overhead, and more than 8 times in terms of communication overhead. The same behavior is observed in sequential data and batch inferences, as we record an improvement ratio of more than 100 times in terms of computation overhead, and more than 20 times in terms of communication overhead.

Browsing by Author "Derhab, Abdelouahid"

Results Per Page

Sort Options