Academic & Scientific Articles

Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3

Browse

Start date: 2015End date: 2015

Search Results

Now showing 1 - 10 of 58
  • Thumbnail Image
    Item
    Networked Wireless Sensors, Active RFID, and Handheld Devices for Modern Car Park Management: WSN, RFID, and Mob Devs for Car Park Management
    (IGI Global, 2015-07-01) Djenouri, Djamel; Karbab, Elmouatezbillah; Boulkaboul, Sahar; Bagula, Antoine
    Networked wireless sensors, actuators, RFID, and mobile computing technologies are explored in this paper on the quest for modern car park management systems with sophisticated services over the emerging internet of things (IoT), where things such as ubiquitous handheld computers, smart ubiquitous sensors, RFID readers and tags are expected to be interconnected to virtually form networks that enable a variety of services. After an overview of the literature, the authors propose a scalable and lowcost car parking framework (CPF) based on the integration of aforementioned technologies. A preliminary prototype implementation has been performed, as well as experimentation of some modules of the proposed CPF. The results demonstrate proof of concept, and particularly reveal that the proposed approach for WSN deployment considerably reduces the cost and energy consumption compared to existing solutions.
  • Thumbnail Image
    Item
    A Graph Approach for Enhancing Process Models Matchmaking
    (IEEE, 2015-06-27) Belhoul, Yacine; Yahiaoui, Saïd; Haddad, Mohammed; Gater, Ahmed; Kheddouci, Hamamache; Bouzeghoub, Mokrane
    Recent attempts have been done to measure similarity of process models based on graph matching. This problem is known to be difficult and its computational complexity is exponential. Thus, heuristics should be proposed to obtain approximations. Spectral graph matching methods, in particular eigenvalue-based projections, are know to be fast but they lost some quality in the obtained matchmaking. In this paper, we propose a graph approach for the problem of inexact matching of process models. Our approach combines a spectral graph matching method and a string comparator based algorithm in order to improve the quality of process models matchmaking. The proposed method performs the matchmaking at both structural and semantic levels. Experimentation is provided to show the performance of our method to rank a collection of process models according to a particular user query, compared to previous work.
  • Thumbnail Image
    Item
    Big Data : Concepts et Cas d’utilisation
    (CERIST, 2015-06-15) Amrane, Abdesalam
    Dans ce rapport nous décrivons l'écosystème Big Data, le contexte et les cas d'utilisation sont présentés. par la suite nous détaillons les technologies matérielles et logicielles nécessaires (stockage, traitement parallèle, virtualisation, …).
  • 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
    CCS_WHMS: A Congestion Control Scheme for Wearable Health Management System
    (Springer Link, 2015-10-21) Kafi, Mohamed Amine; Ben Othman, Jalel; Bagaa, Miloud; Badache, Nadjib
    Wearable computing is becoming a more and more attracting field in the last years thanks to the miniaturisation of electronic devices. Wearable healthcare monitoring systems (WHMS) as an important client of wearable computing technology has gained a lot. Indeed, the wearable sensors and their surrounding healthcare applications bring a lot of benefits to patients, elderly people and medical staff, so facilitating their daily life quality. But from a research point of view, there is still work to accomplish in order to overcome the gap between hardware and software parts. In this paper, we target the problem of congestion control when all these healthcare sensed data have to reach the destination in a reliable manner that avoids repetitive transmission which wastes precious energy or leads to loss of important information in emergency cases, too. We propose a congestion control scheme CCS_WHMS that ensures efficient and fair data delivery while used in the body wearable system part or in the multi-hop inter bodies wearable ones to get the destination. As the congestion detection paradigm is very important in the control process, we do experimental tests to compare between state of the art congestion detection methods, using MICAz motes, in order to choose the appropriate one for our scheme.
  • Thumbnail Image
    Item
    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.
  • Thumbnail Image
    Item
    Networked Wireless Sensors, Active RFID, and Handheld Devices for Modern Car Park Management: WSN, RFID, and Mob Devs for Car Park Management
    (IGI, 2015-12) Djenouri, Djamel; Karbab, Elmouatezbillah; Sahar, Boulkaboul; Antoine, Bagula
    Networked wireless sensors, actuators, RFID, and mobile computing technologies are explored in this paper on the quest for modern car park management systems with sophisticated services over the emerging internet of things (IoT), where things such as ubiquitous handheld computers, smart ubiquitous sensors, RFID readers and tags are expected to be interconnected to virtually form networks that enable a variety of services. After an overview of the literature, the authors propose a scalable and lowcost car parking framework (CPF) based on the integration of aforementioned technologies. A preliminary prototype implementation has been performed, as well as experimentation of some modules of the proposed CPF. The results demonstrate proof of concept, and particularly reveal that the proposed approach for WSN deployment considerably reduces the cost and energy consumption compared to existing solutions.
  • Thumbnail Image
    Item
    Parallel BSO Algorithm for Association Rules Mining Using Master/Worker Paradigm
    (2015-09-06) Djenouri, Youcef; Bendjoudi, Ahcène; Djenouri, Djamel; Habbas, Zineb
    The extraction of association rules from large transactional databases is considered in the paper using cluster architecture parallel computing. Motivated by both the successful sequential BSO-ARM algorithm, and the strong matching between this algorithm and the structure of the cluster architectures, we present in this paper a new parallel ARM algorithm that we call MW-BSO-ARM for Master/Workers version of BSO-ARM. The goal is to deal with large databases by minimizing the communication and synchronization costs, which represent the main challenges that faces any cluster architecture. The experimental results are very promising and show clear improvement that reaches 300% for large instances. For examples, in big transactional database such as WebDocs, the proposed approach generates 107 satisfied rules in only 22 minutes, while a previous GPU-based approach cannot generate more than 103 satisfied rules into 10 hours. The results also reveal that MWBSO-ARM outperforms the PGARM cluster-based approach in terms of computation time.
  • Thumbnail Image
    Item
    Adaptive Fault Tolerant Checkpointing Algorithm for Cluster Based Mobile Ad Hoc Networks
    (Elsevier, 2015) Mansouri, Houssem; Badache, Nadjib; Aliouat, Makhlouf; Pathan, Al-Sakib Khan
    Mobile Ad hoc NETwork (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made possible to create a distributed mobile computing application and has also brought several new challenges in distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET due to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster based MANET, where only minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme performs well compared to works related.
  • Thumbnail Image
    Item
    An end-to-end secure key management protocol for e-health applications
    (Elsevier, 2015) Abdmeziem, Mohammed Riyadh; Tandjaoui, Djamel
    Key distribution is required to secure e-health applications in the context of Internet of Things (IoT). However, resources constraints in IoT make these applications unable to run existing key management protocols. In this paper, we propose a new lightweight key management protocol. This protocol is based on collaboration to establish a secure end-to-end communication channel between a highly resource constrained node and a remote entity. The secure channel allows the constrained node to transmit captured data while ensuring confidentiality and authentication. To achieve this goal, we propose offloading highly consuming cryptographic primitives to third parties. As a result, the constrained node obtains assistance from powerful entities. To assess our protocol, we conduct a formal validation regarding security properties. In addition, we evaluate both communication and computational costs to highlight energy savings. The results show that our protocol provides a considerable gain in energy while its security properties are ensured.