Academic & Scientific Articles

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

Browse

Author: search.filters.author.Bouabdallah, AbdelmadjidSubject: search.filters.subject.Wireless Sensor Networks

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Efficient QoS-aware Heterogeneous Architecture for Energy-Delay Constrained Connected Objects
    (IFIP, 2016-07-11) Doudou, Messaoud; Rault, Tifenn; Bouabdallah, Abdelmadjid
    Connected objects such as smart phones and wireless sensors becomes very attractive for our assisted daily life applications, because it offers continuous monitoring capability of both personal and environmental parameters. However, these systems still face a major energy issue that prevent their wide adoption. Indeed, continuous sampling and communication tasks quickly deplete sensors and gateways battery reserves, and frequent battery replacement are not convenient. One solution to address such a challenge consists in minimizing the activation of radio interfaces and switching between them in order to achieve very low duty-cycle. In this paper, we propose a new efficient communication architecture for patient supervision in the context of healthcare application making use of dual radio. At runtime, our solution determines the optimal interval parameters of switching on/off each radio interfaces in order to minimize the energy consumption of both sensors and mobile phones while satisfying the QoS requirements. The proposed solution is adequately analyzed and numerically compared against a solution without QoS. The results show that our proposed architecture exhibits better duty-cycle reduction while satisfying the delay constraints.
  • 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
    Synchronous Contention-Based MAC Protocols for Delay-Sensitive Wireless Sensor Networks: A Review and Taxonomy
    (2013-04-06) Doudou, Messaoud; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid
    Duty cycling allows obtaining significant energy saving compared to full duty cycle (sleepless) random access MAC protocols. However, it may result in significant latency. In slotted duty-cycled medium access control (MAC) protocols, sensor nodes periodically and synchronously alternate their operations between active and sleep modes. The sleep mode allows a sensor node to completely turn off its radio and save energy. In order to transmit data from one node to another, both nodes must be in active mode. The synchronous feature makes the protocols more appropriate for delay-sensitive applications compared to asynchronous protocols. The latter involve additional delay for the sender to meet the receiver's active period, which is eliminated with synchronous approach where nodes sleep and wake up all together. Despite the possible increase of contention by grouping active periods, the delay due to packets retransmissions after collisions is less significant compared to the waiting time of asynchronous protocols. Furthermore, contention-based feature makes the protocol conceptually distributed and more dynamic compared to TDMA-based. This manuscript deals with timeliness issues of slotted contention-based WSN MAC protocols. It provides a comprehensive review and taxonomy of state-of-the-art synchronous MAC protocols. The performance objective considered in the proposed taxonomy is the latency, in the context of energy-limited WSN, where energy is considered as a constraint for the MAC protocol that yields the need of duty-cycling the radio. The main contribution is to study and classify these protocols from the delay efficiency perspective. The protocols are divided into two main categories: static schedule and adaptive schedule. Adaptive schedule are split up into four subclasses: adaptive grouped schedule, adaptive repeated schedule, staggered schedule, and reservation schedule. Several state-of-the-art protocols are described following the proposed classification, with comprehensive discussions and comparisons with respect to their latency.
  • Thumbnail Image
    Item
    Slotted Contention-Based Energy-Efficient MAC Protocols in Delay-Sensitive Wireless Sensor Networks
    (2012-07-01) Doudou, Messaoud; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid
    This paper considers slotted duty-cycled medium access control (MAC) protocols, where sensor nodes periodically and synchronously alternate their operations between active and sleep modes to save energy. Communications can occur only when nodes are in active mode. The synchronous feature makes these protocols more appropriate for delay-sensitive applications than asynchronous protocols. With asynchronous protocols, additional delay is needed for the sender to meet the receiver's active period. This is eliminated with synchronous approaches, where nodes sleep and wake up all together. Moreover, the contention-based feature makes the protocols --considered in this paper-- conceptually distributed and more dynamic compared to TDMA protocols. Duty cycling allows obtaining significant energy saving vs. full duty cycle (sleepless) protocols. However, it may result in significant latency. Forwarding a packet over multiple hops often requires multiple operational cycles (sleep latency), i.e. nodes have to wait for the next cycle to forward data at each hop. Timeliness issues of slotted contention-based MAC protocols are dealt with in this paper, where a comprehensive review and taxonomy is provided. The main contribution is to study and classify the protocols from the delay-efficiency perspective.