Academic & Scientific Articles
Permanent URI for this communityhttp://dl.cerist.dz/handle/CERIST/3
Browse
95 results
Search Results
Item Efficient On-Demand Multi-Node Charging Techniques for Wireless Sensor Networks(Elsevier, 2016-10-01) Khelladi, Lyes; Djenouri, Djamel; Rossi, Michele; Badache, NadjibThis paper deals with wireless charging in sensor networks and explores efficient policies to perform simultaneous multi-node power transfer through a mobile charger (MC).The proposed solution, called On-demand Multi-node Charging (OMC), features an original threshold-based tour launching (TTL) strategy, using request grouping, and a path planning algorithm based on minimizing the number of stopping points in the charging tour. Contrary to existing solutions, which focus on shortening the charging delays, OMC groups incoming charging requests and optimizes the charging tour and the mobile charger energy consumption. Although slightly increasing the waiting time before nodes are charged, this allows taking advantage of multiple simultaneous charges and also reduces node failures. At the tour planning level, a new modeling approach is used. It leverages simultaneous energy transfer to multiple nodes by maximizing the number of sensors that are charged at each stop. Given its NP-hardness, tour planning is approximated through a clique partitioning problem, which is solved using a lightweight heuristic approach. The proposed schemes are evaluated in offline and on-demand scenarios and compared against relevant state-of-the-art protocols. The results in the offline scenario show that the path planning strategy reduces the number of stops and the energy consumed by the mobile charger, compared to existing offline solutions. This is with further reduction in time complexity, due to the simple heuristics that are used. The results in the on-demand scenario confirm the effectiveness of the path planning strategy. More importantly, they show the impact of path planning, TTL and multi-node charging on the efficiency of handling the requests, in a way that reduces node failures and the mobile charger energy expenditure.Item Performance analysis and evaluation of REFIACC using queuing networks(Elsevier, 2017-02) Kafi, Mohamed Amine; Ben Othman, Jalel; Mokdad, Lynda; Badache, NadjibWireless Sensor Networks (WSN) utilisation is characterised by its dense deployment in order to fulfil the monitoring tasks. This density of communication leads to interference and congestion. In a previous work, a schedule scheme dubbed REFIACC (Reliable, Efficient, Fair and Interference Aware Congestion Control), that takes into account interferences and different links capacities in order to avoid packet loss due congestion, was proposed. REFIACC idea was validated using comparative simulations. In this study, REFIACC scheduling scheme was modelled using Markov chains. The modelling concerns queue length evolution and global system throughput. Different hypothesis details for queue length monitoring, according to application motivation, have led to many variants of models. The evaluation of the model using MATLAB has shown its effectiveness concerning packet reception ratio and reception overhead.Item A Novel Approach to Preserving Privacy in Social Network Data Publishing(CERIST, 2016-10-24) Bensimessaoud, Sihem; Benmeziane, Souad; Badache, Nadjib; Djellalbia, AminaToday, 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”.Item Anonymous Authentication Scheme in e-Health Cloud environment(CERIST, 2016-10-20) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, SihemThe 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.Item A review on Privacy and Anonymity in electronic communications(Conference Procedings, 2006-10-25) Benmeziane, Souad; Badache, NadjibCurrent Internet networking protocols provide no support to ensure the privacy of communication endpoints. An adversary can determine which addresses have asked for which services. Anonymity is now increasingly important for networked applications. This paper overviews the concept of anonymity in electronic communications, vectors for a privacy invasion, and proposed solutions. Solutions are examined from the perspective of attacks which can be reasonably expected against these systems. Particular attention is paid to mobile agents systems and how to hide the itinerary of the agent.Item An Adaptive Anonymous Authentication for Cloud Environment(IEEE Xplore Digital labrary, 2015-06-02) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, SihemPreserving 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.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, NadjibEvent 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.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, NadjibThis 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.Item Poster Abstract: Static Analysis of Device Drivers in TinyOS(ACM/IEEE, 2014-04-15) Ouadjaout, Abdelraouf; Lasla, Noureddine; Bagaa, Miloud; Badache, NadjibIn 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.Item Delay-efficient MAC protocol with traffic differentiation and run-time parameter adaptation for energy-constrained wireless sensor networks(Springer, 2016-02) Doudou, Messaoud; Djenouri, Djamel; M. Barcelo-Ordinas, Jose; Badache, NadjibThis paper presents an asynchronous cascading wake-up MAC protocol for heterogeneous traffic gathering in low-power wireless sensor networks. It jointly considers energy/delay optimization and switches between two modes, according to the traffic type and delay requirements. The first mode is high duty cycle, where energy is traded-off for a reduced latency in presence of realtime traffic (RT). The second mode is low duty cycle, which is used for non-realtime traffic and gives more priority to energy saving. The proposed protocol, DuoMAC, has many features. First, it quietly adjusts the wake-up of a node according to (1) its parent’s wake-up time and, (2) its estimated load. Second, it incorporates a service differentiation through an improved contention window adaptation to meet delay requirements. A comprehensive analysis is provided in the paper to investigate the effectiveness of the proposed protocol in comparison with some state-of-the-art energy-delay efficient duty-cycled MAC protocols, namely DMAC, LL-MAC, and Diff-MAC. The network lifetime and the maximum end-to-end packet latency are adequately modeled, and numerically analyzed. The results show that LL-MAC has the best performance in terms of energy saving, while DuoMAC outperforms all the protocols in terms of delay reduction. To balance the delay/energy objectives, a runtime parameter adaptation mechanism has been integrated to DuoMAC. The mechanism relies on a constrained optimization problem with energy minimization in the objective function, constrained by the delay required for RT. The proposed protocol has been implemented on real motes using MicaZ and TinyOS. Experimental results show that the protocol clearly outperforms LL-MAC in terms of latency reduction, and more importantly, that the runtime parameter adaptation provides additional reduction of the latency while further decreasing the energy cost.