International Conference Papers

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

Browse

Author: search.filters.author.Badache, NadjibStart date: 2010

Search Results

Now showing 1 - 10 of 25
  • Thumbnail Image
    Item
    An Adaptive Anonymous Authentication for Cloud Environment
    (IEEE Xplore Digital labrary, 2015-06-02) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, Sihem
    Preserving identity privacy is a significant challenge for the security in cloud services. Indeed, an important barrier to the adoption of cloud services is user fear of privacy loss in the cloud. One interesting issue from a privacy perspective is to hide user’s usage behavior or meta-information which includes access patterns and frequencies when accessing services. Users may not want the cloud provider to learn which resources they access and how often they use a service by making them anonymous. In this paper, we will propose an adaptive and flexible approach to protect the identity privacy through an anonymous authentication scheme.
  • Thumbnail Image
    Item
    Congestion Detection Strategies in Wireless Sensor Networks: A Comparative Study with Testbed Experiments
    (Elsevier, 2014-09) Kafi, Mohamed Amine; Djenouri, Djamel; Ouadjaout, Abdelraouf; Badache, Nadjib
    Event based applications of Wireless Sensor Networks (WSNs) are prone to traffic congestion, where unpredicted event detection yields simultaneous generation of traffic at spatially co-related nodes, and its propagation towards the sink. This results in loss of information and waste energy. Early congestion detection is thus of high importance in such WSN applications to avoid the propagation of such a problem and to reduce its consequences. Different detection metrics are used in the congestion control literature. However, a comparative study that investigates the different metrics in real sensor motes environment is missing. This paper focuses on this issue and compares some detection metrics in a testbed network with MICAz motes. Results show the effectiveness of each method in different scenarios and concludes that the combination of buffer length and channel load constitute the better candidate for early and fictive detection.
  • Thumbnail Image
    Item
    Interference-aware Congestion Control Protocol for Wireless Sensor Networks
    (Elsevier, 2014-09) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Bagaa, Miloud; Lasla, Noureddine; Badache, Nadjib
    This paper deals with congestion and interference control in wireless sensor networks (WSN), which is essential for improving the throughput and saving the scarce energy in networks where nodes have different capacities and traffic patterns. A scheme called IACC (Interference-Aware Congestion Control) is proposed. It allows maximizing link capacity utilization for each node by controlling congestion and interference. This is achieved through fair maximum rate control of interfering nodes in inter and intra paths of hot spots. The proposed protocol has been evaluated by simulation, where the results rival the effectiveness of our scheme in terms of energy saving and throughput. In particular, the results demonstrate the protocol scalability and considerable reduction of packet loss that allow to achieve as high packet delivery ratio as 80% for large networks.
  • Thumbnail Image
    Item
    Poster Abstract: Static Analysis of Device Drivers in TinyOS
    (ACM/IEEE, 2014-04-15) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Badache, Nadjib
    In this paper, we present SADA, a static analysis tool to verify device drivers for TinyOS applications. Its broad goal is to certify that the execution paths of the application complies with a given hardware specification. SADA can handle a broad spectrum of hardware specifications, ranging from simple assertions about the values of configuration registers, to complex behaviors of possibly several connected hardware components. The hardware specification is expressed in BIP, a language for describing easily complex interacting discrete components. The analysis of the joint behavior of the application and the hardware specification is then performed using the theory of Abstract Interpretation. We have done a set of experiments on some TinyOS applications. Encouraging results are obtained that confirm the effectiveness of our approach.
  • Thumbnail Image
    Item
    BA: Game Theoretical Approach for Energy-Delay Balancing in Distributed Duty-Cycled MAC Protocols of Wireless Networks
    (ACM, 2014-07-14) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy constrained distributed wireless networks is a conflicting multi-objective optimization problem. This paper investigates this trade-off from a game-theoretic perspective, where the two optimization objectives are considered as virtual game players that attempt to optimize their utility values. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. A cooperative game is then defined, in which the Nash Bargaining solution assures the balance between energy consumption and e2e packet delay. For illustration, this formulation is applied to three state-of-the-art wireless sensor network MAC protocols; X-MAC, DMAC, and LMAC as representatives of preamble sampling, slotted contention-based, and frame-based MAC categories, respectively. The paper shows the effectiveness of such framework in optimizing protocol parameters for achieving a fair energy-delay performance trade-off, under the application requirements in terms of initial energy budget and maximum e2e packet delay. The proposed framework is scalable with the increase in the number of nodes, as the players represent the optimization metrics instead of nodes.
  • Thumbnail Image
    Item
    A clustering technique to analyse anonymous users.
    (CPS, 2014-08-09) Benmeziane, Souad; Badache, Nadjib
    Concerns about privacy and anonymity have gained more and more attention in conjunction with the rapid growth of the Internet as a means of communication and information dissemination. A number of anonymous communication systems have been developed to protect the identity of communication participants. Nevertheless, it is important to provide ways to evaluate and measure the level of anonymity provided. We introduce in this paper the use of hierarchical clustering technique to analyse anonymous systems. We propose a new measure to evaluate anonymous systems by introducing the concept of dominant cluster. We further show that using this measure will overcome the limitations of other existing measures.
  • Thumbnail Image
    Item
    On optimal anchor placement for effecient area-based localization in wireless networks
    (IEEE, 2015-06-08) Lasla, Noureddine; Younis, Mohamed; Ouadjaout, Abdelraouf; Badache, Nadjib
    Area-based localization is a simple and efficient approach, where each node estimates its position based on proxim- ity information to some special nodes with known location, called anchors. Based on the anchors’ coordinates, each node first determines its residence area and then approximates its position as the centroid of that area. Therefore, the accu- racy of the estimated position depends on the size of the residence area; the smaller the residence area is, the bet- ter the accuracy is likely to be. Because the size of the residence area mainly depends on the number and the posi- tions of anchor nodes, their deployment should be carefully considered in order to achieve a better accuracy while mini- mizing the cost. For this purpose, in this paper we conduct a theoretical study on anchor placement for a very popular area based localization approach. We determine the optimal anchor placement pattern for increased accuracy and how to achieve a particular accuracy goal with the least anchor count. Our analytical results are further validated through simulation.
  • Thumbnail Image
    Item
    Improved coverage through area-based localization in wireless sensor networks
    (IEEE, 2013-10) Lasla, Noureddine; Younis, Mohamed; Badache, Nadjib
    Ensuring area coverage is one of the key requirements of wireless sensor networks (WSNs). When nodes are randomly placed in the area of interest, redundancy is often provisioned in order to lower the probability of having voids, where part of the area is not within the detection range of any sensor. To extend the lifetime of the network, a duty cycle mechanism is often applied in which only a subset of the nodes are activated at a certain time while the other nodes switch to low-power mode. The set of active nodes are changed over time in order to balance the load on the individual sensors. The selection of active nodes is subject to meeting the coverage requirement. Assessing the coverage of a sensor is based on knowing its position. However, localization schemes usually yield a margin of errors which diminishes the coverage fidelity. Conservative approaches for mitigating the position inaccuracy assume the worst-case error across the network and end up activating excessive number of nodes and reduces the network lifetime. In this paper, we present an approach for estimating a bound on the maximum error for the position of each sensor and propose a distributed algorithm for achieving high fidelity coverage while engaging only a subset of the sensors. The simulation results confirm the performance advantages of our approach.
  • Thumbnail Image
    Item
    The Effects of Interference on Video Quality Over Wireless Sensor Networks
    (Elsevier, 2013) Zeghilet, Houda; Baziz, Yacine; Badache, Nadjib
    Multi-path routing appears to be an essential feature for supporting the characteristics of wireless multimedia sensor networks. In fact, using multiple paths between the source and the destination can provide adequate network resources required by such networks. However, the effect of wireless interferences between paths severely affects the performance of this approach. In this paper, we propose a simple interference-aware multipath routing protocol and study the effects of inter-path interferences on the received video quality in the context of wireless multimedia sensor networks. We show, through simulations, that minimizing interferences between the transmission paths can provide necessary bandwidth to support multimedia applications when small frame rates are used.
  • Thumbnail Image
    Item
    Congestion Detection Strategies in Wireless Sensor Networks: A Comparative Study with Testbed Experiments
    (Elsevier, 2014) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Badache, Nadjib
    Event based applications of Wireless Sensor Networks (WSNs) are prone to traffic congestion, where unpredicted event detection yields simultaneous generation of traffic at spatially co-related nodes, and its propagation towards the sink. This results in loss of information and waste energy. Early congestion detection is thus of high importance in such WSN applications to avoid the propagation of such a problem and to reduce its consequences. Different detection metrics are used in the congestion control literature. However, a comparative study that investigates the different metrics in real sensor motes environment is missing. This paper focuses on this issue and compares some detection metrics in a testbed network with MICAz motes. Results show the effectiveness of each method in different scenarios and concludes that the combination of buffer length and channel load constitute the better candidate for early and fictive detection.