Research Reports

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

Browse

Search Results

Now showing 1 - 10 of 26
  • Thumbnail Image
    Item
    A Novel Approach to Preserving Privacy in Social Network Data Publishing
    (CERIST, 2016-10-24) Bensimessaoud, Sihem; Benmeziane, Souad; Badache, Nadjib; Djellalbia, Amina
    Today, more and more social network data are published for data analysis. Although this analysis is important, these publications may be targeted by re-identification attacks i.e., where an attacker tries to recover the identities of some nodes that were removed during the anonymization process. Among these attacks, we distinguish "the neighborhood attacks" where an attacker can have background knowledge about the neighborhoods of target victims. Researchers have developed anonymization models similar to k-anonymity, based on edge adding, but can significantly alter the properties of the original graph. In this work, a new anonymization algorithm based on the addition of fake nodes is proposed, which ensures that the published graph preserves another important utility that is the average path length “APL”.
  • Thumbnail Image
    Item
    Anonymous Authentication Scheme in e-Health Cloud environment
    (CERIST, 2016-10-20) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, Sihem
    The adoption of an e-Health Cloud has different advantages especially allowing sharing and exchanging information between medical institutions, availability of information, reducing costs, etc. However, preserving identity privacy is a significant challenge of security in all environments, and constitutes particularly a very serious concern in Cloud environments. Indeed, an important barrier to the adoption of Cloud is user fear of privacy loss in the Cloud, particularly in an e-Health Cloud where users are Patients. Users may not want to disclose their identities to the Cloud Service Provider, a way to protect them is making them anonymous. In this paper, we will propose an adaptive and flexible approach to protect the identity privacy of Patients in an e-Health Cloud through an anonymous authentication scheme.
  • Thumbnail Image
    Item
    Design Framework for Mobility Support in Wearable Health Monitoring Systems
    (CERIST, 2015-09-29) Boulemtafes, Amine; Rachedi, Abderrezak; Badache, Nadjib
    The aim of this work is to investigate main techniques and technologies enabling user’s mobility in wearable health monitoring systems. For this, design requirements for key enabling mechanisms are pointed out, and a number of conceptual recommendations are presented. The whole is schematized and presented into the form of a design framework taking in consideration patient context constraints. This work aspires to bring a further contribution for the conception and possibly the evaluation of health monitoring systems with full support of mobility offering freedom to users while enhancing their life quality
  • Thumbnail Image
    Item
    An Adaptive Anonymous Authentication for Cloud Environment
    (CERIST, 2015-04-28) 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
    On optimal anchor placement for effecient area-based localization in wireless networks
    (CERIST, 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
    MSR : Minimum-Stop Recharging Scheme for Wireless Rechargeable Sensor Networks
    (CERIST, 2014-07-02) Khelladi, Lyes; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid; Lasla, Noureddine
    This paper deals with simultaneous energy transfer to multiple nodes for scalable wireless recharging in wireless sensor networks. All existing recharging schemes rely on the use of a mobile charger that roves the network and drops by some locations for nodes recharging. However, they focus on the efficiency of energy transfer and neglect the energy engendered by the charger movement. This is tackled in this paper, where the wireless charging is modeled as a path optimization problem for the mobile charger, with objective function to minimizing the number of stop locations in the path. Due to the NP-harness of the problem, we propose a simple but efficient heuristic. It is based on clique partitioning to find the minimum number of locations allowing the mobile charger to replenish all the node’s batteries in the network. Evaluation results demonstrate that the proposed approach significantly reduces the total energy consumption of the mobile charger, while using a low-complexity techniques that permit scalability to a higher number of nodes.
  • Thumbnail Image
    Item
    A clustering technique to analyse anonymous systems
    (CERIST, 2014-07-20) 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 report 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
    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
    Interference-Aware Congestion Control Protocol for Wireless Sensor Networks
    (CERIST, 2014-07-07) 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 di erent capacities and tra c 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 e ectiveness 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 allows to achieve as high packet delivery ratio as 80% for large networks.
  • Thumbnail Image
    Item
    Congestion Detection Strategies in Wireless sensor Networks: A Comparative Study with Testbed Experiments
    (CERIST, 2014-07-07) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Badache, Nadjib
    Event based applications of Wireless Sensor Networks (WSNs) are prone to tra c congestion, where unpredicted event detection yields simultaneous generation of tra c 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. Di erent detection metrics are used in the congestion control literature. However, a comparative study that investigates the di erent 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 e ectiveness of each method in di erent scenarios and concludes that the combination of bu er length and channel load constitute the better candidate for early and fictive detection.