Research Reports

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/34

Browse

Author: search.filters.author.Derhab, Abdelouahid

Search Results

Now showing 1 - 8 of 8
  • Thumbnail Image
    Item
    SMART: Secure Multi-pAths Routing for wireless sensor neTworks
    (CERIST, 2014-06-22) Lasla, Noureddine; Derhab, Abdelouahid; Ouadjaout, Abdelraouf; Bagaa, Miloud; Challal, Yacine
    Abstract. In this paper, we propose a novel secure routing protocol named Secure two-hop disjoint Multi-pAths Routing for wireless sensor neTworks (SMART) as well as its underlying key management scheme named Extended Two-hop Keys Establishment (ETKE). The proposed framework keeps consistent routing topology by protecting the hop count information from being forged. The two-hop scheme ensures immediate verification and fast detection of inconsistent routing information with- out referring to the sink node. We prove that it is sufficient to keep only two-hop disjoint paths to ensure full-resilience against node capture attacks. We have demonstrated through simulations that our solution outperforms a comparative solution in literature. In addition, ETKE is more resilient to node capture attacks than the probabilistic key man- agement schemes.
  • Thumbnail Image
    Item
    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.
  • Thumbnail Image
    Item
    Semi-Structured and Unstructured Data Aggregation Scheduling in Wireless Sensor Networks
    (CERIST, 2011-09) Bagaa, Miloud; Derhab, Abdelouahid; Badache, Nadjib; Lasla, Noureddine; Ouadjaout, Abdelraouf
    This paper focuses on data aggregation scheduling problem in wireless sensor networks (WSNs), to minimize time latency. Prior works on this problem have adopted a structured approach, in which a tree-based structure is used as an input for the scheduling algorithm. As the scheduling performance mainly depends on the supplied aggregation tree, such an approach cannot guarantee optimal performance. To address this problem, we propose approaches based on Semi-structured Topology (DAS-ST) and Unstructured Topology (DAS-UT). The approaches are based on two key design features, which are : (1) simultaneous execution of aggregation tree construction and scheduling, and (2) parent selection criteria that maximize the choices of parents for each node and maximize time slot reuse. We prove that the latency of DAS-ST is upper-bounded by (b 2 arccos( 1 1+ ) c+4)R+
  • Thumbnail Image
    Item
    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 define 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.
  • Thumbnail Image
    Item
    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.
  • Thumbnail Image
    Item
    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.
  • Thumbnail Image
    Item
    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.
  • Thumbnail Image
    Item
    SQUIRREL : Self-organizing Qos-roUting for IntRa-flow contention in ad-hoc wiRELess networks
    (CERIST, 2008) Derhab, Abdelouahid
    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. In this paper, we use the selforganizing paradigms presented in [1] to design a new Qos-routing intra-flow contention-based protocol for wireless ad hoc networks, called SQUIRREL. The admission control component of SQUIRREL, called : Scalable and Accurate Admission control (SAICAC), has two variants : SAICAC-Power and SAICAC-CS. SAICAC-Power estimates channel bandwidth availability through high power transmissions and SAICAC-CS through passive monitoring of the channel. SQUIRREL can ensure all the properties of a self-organizing system contrary to the existing intra-flow contention-based protocols. Our analytical study demonstrates that SAICAC can achieve the best results in terms of message overhead, delay, and scalability.