International Journal Papers

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

Browse

Author: search.filters.author.Badache, Nadjib

Search Results

Now showing 1 - 10 of 29
  • Thumbnail Image
    Item
    Efficient On-Demand Multi-Node Charging Techniques for Wireless Sensor Networks
    (Elsevier, 2016-10-01) Khelladi, Lyes; Djenouri, Djamel; Rossi, Michele; Badache, Nadjib
    This 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.
  • Thumbnail Image
    Item
    Performance analysis and evaluation of REFIACC using queuing networks
    (Elsevier, 2017-02) Kafi, Mohamed Amine; Ben Othman, Jalel; Mokdad, Lynda; Badache, Nadjib
    Wireless 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.
  • Thumbnail Image
    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, Nadjib
    This 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.
  • Thumbnail Image
    Item
    Performance Optimization of Duty-Cycled MAC in Delay-Energy Constrained Sensor Network Under Uniform and Non-Uniform Traffic Generation
    (interscience.wiley, 2016) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Badache, Nadjib; Garcia-Vidal, Jorge
    Duty-Cycle at the MAC layer plays a key role in energy savings and network lifetime extension. It consists in putting a node’s radio in the sleep state as soon as it has no communication activity. Traditional WSN MAC protocols are designed with short duty cycles at the cost of long delays. Careful design is required for joint energy-delay constrained applications, where the optimal parameters should be thoroughly derived. The present paper deals with this issue and mathematically derives optimal values of key MAC parameters under low data rate applications for three well known duty-cycled MAC protocols, WiseMAC, SCP-MAC, and LMAC as representatives of three MAC protocol categories, respectively preamble-sampling, slotted contention-based and frame-based. The analysis provides also the optimum traffic sampling rate that guarantees the minimum energy consumption. It shows the role of these parameters in achieving the targeted e2e (end-to-end) delay constraints under network models with uniform traffic generation, for ring and grid topologies. As a second contribution, the model is extended to non-uniform traffic scenarios, where a certain percentage of deployed nodes are relays whose role is to balance traffic forwarding and save the overall network energy. The results reveal that different optimal internal MAC parameters and traffic generation rates can be found for different configurations of relay nodes deployment, which achieve minimal network energy consumption while satisfying the application required e2e delay threshold
  • Thumbnail Image
    Item
    Game Theory Framework for MAC Parameter Optimization in Energy-Delay Constrained Sensor Networks
    (ACM, 2016-05-15) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Bouabdallah, Abdelmadjid; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy-constrained, delay-sensitive wireless sensor networks is a conflicting multi-objective optimization problem. We investigate the problem from a game theory perspective, where the two optimization objectives are considered as game players. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. From the optimization framework, a game is first defined by the Nash Bargaining Solution (NBS) to assure energy-consumption and e2e delay balancing. Secondly, the Kalai-Smorodinsky Bargaining Solution (KSBS) is used to find equal proportion of gain between players. Both methods offer a bargaining solution to the duty-cycle MAC protocol under different axioms. As a result, given the two performance requirements, i.e., the maximum latency tolerated by the application and the initial energy budget of nodes, the proposed framework allows to set tunable system parameters to reach a fair equilibrium point which dually minimizes the system latency and energy consumption. For illustration, this formulation is applied to six state-of-the-art Wireless Sensor Network (WSN) MAC protocols; B-MAC, X-MAC, RI-MAC, SMAC, DMAC, and LMAC. The paper shows the effectiveness and scalability of such framework in optimizing protocol parameters that achieve a fair energy-delay performance trade-off under the application requirements.
  • Thumbnail Image
    Item
    REFIACC: Reliable, Efficient, Fair and Interference-Aware Congestion Control Protocol for Wireless Sensor Networks
    (Elsevier, 2016-05-28) Kafi, Mohamed Amine; Ben Othman, Jalel; Ouadjaout, Abdelraouf; Bagaa, Miloud; Badache, Nadjib
    The recent wireless sensor network applications are resource greedy in terms of throughput and network reliability. However, the wireless shared medium leads to links interferences in addition to wireless losses due to the harsh environment. The effect of these two points translates on differences in links bandwidth capacities, lack of reliability and throughput degradation. In this study, we tackle the problem of throughput maximization by proposing an efficient congestion control-based schedule algorithm, dubbed REFIACC (Reliable, Efficient, Fair and Interference-Aware Congestion Control) protocol. REFIACC prevents the interferences and ensures a high fairness of bandwidth utilization among sensor nodes by scheduling the communications. The congestion and the interference in inter and intra paths hot spots are mitigated through tacking into account the dissimilarity between links' capacities at the scheduling process. Linear programming is used to reach optimum utilization efficiency of the maximum available bandwidth. REFIACC has been evaluated by simulation and compared with two pertinent works. The results show that the proposed solution outperforms the others in terms of throughput and reception ratio (more than 80%) and can scale for large networks.
  • 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
    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
    Delay-efficient MAC protocol with traffic differentiation and run-time parameter adaptation for energy-constrained wireless sensor networks
    (Springer US, 2015-06) Doudou, Messaoud; Djenouri, Djamel; Barcelo-Ordinas, Jose M.; Badache, Nadjib
    This 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.