Browsing by Author "Khiati, Mustapha"

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    ADABCAST: ADAptive BroadCAST Approach for Solar Energy Harvesting Wireless Sensor Networks
    (IEEE, 2017-04) Khiati, Mustapha; Djenouri, Djamel
    The problem of message broadcasting from the base station (BS) to sensor nodes (SNs) in solar energy harvesting wireless sensor networks (EHWSN) is considered in this paper. The aim is to ensure fast and reliable broadcasting without interfering with upstream communications (from SNs to BS), whilst taking into account energy harvesting constraints. An adaptive approach is proposed where the BS first selects the broadcast time slots, given a wake-up schedule for the SNs (the time slots where the SN are active and in receiving mode). Hence, the SNs adapt their schedules. This is then iterated seeking optimal selection of the broadcast time slots, so as to minimize broadcast overhead (transmitted messages) and latency. Our approach enables fast broadcast and eliminates the need for adding protocol overhead (redundancy), compared to the existing solutions. Hidden Markov Model (HMM) and Baum-Welch learning algorithm are used for this purpose. Numerical results confirm that our scheme performs the broadcast operation in less time, and by reducing the broadcast overhead, as compared to state-of-the-art approaches.
  • Thumbnail Image
    Item
    BOD-LEACH: broadcasting over duty-cycled radio using LEACH clustering for delay/power efficient dissimilation in wireless sensor networks
    (John Wiley & Sons, Ltd, 2015-02) Khiati, Mustapha; Djenouri, Djamel
    Broadcasting delay-sensitive information over a duty-cycled wireless sensor network is considered, and a cluster-based protocol is proposed. The proposed protocol, namely Broadcast over Duty-Cycle and LEACH (BOD-LEACH), takes advantage of the LEACH’s energy-efficient clustering. This approach shifts the total burden of energy consumption of a single cluster head by rotating the cluster-head role among all nodes in the network. It also permits the ordinary (member) nodes in a cluster to turn off their radios whenever they enter inactive TDMA slots. However, LEACH does not consider broadcast messages, and the member nodes scheduling is established as a sequence of Time Division Multiple Access (TDMA) without any common active period. A broadcast message should then be postponed to the next TDMA schedule and transmitted in a sequence of unicast messages, which is inefficient in terms of latency, bandwidth occupation, and power consumption. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages and using a Markov chain model. To our knowledge, this work is the first that proposes the use of clustering to perform simultaneous local broadcasts at several clusters. This reduces broadcast latency and ensures scalability. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to broadcast latency, at a low energy cost.
  • Thumbnail Image
    Item
    Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks
    (CERIST, 2012) Djenouri, Djamel; Khiati, Mustapha
    This paper proposes a cluster-based broadcast protocol to disseminate delay-sensitive information throughout a wireless sensor network. The protocol considers the use of duty-cycling at the MAC layer, which is essential to reduce energy dissipation. LEACH’s energy-efficiency approach is used for cluster construction. This approach shifts the total burden of energy consumption of a single cluster-head by rotating the cluster-head function among all nodes in the network. It also permits to switch the ordinary (member) nodes in a cluster into the sleep mode whenever they enter inactive TDMA slots. However, LEACH does not consider broadcast messages, and the member nodes scheduling is established as a sequence of TDMA without any common active period. A broadcast message should then be postponed to next TDMA schedule and transmitted a sequence of unicasts, which is inefficient in terms of latency, bandwidth occupation, and power consumption. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages, and using a Markov-chain model. To our knowledge, this work is the first that proposes the use of clustering to reduce broadcast latency. Taking advantage of LEACH’s clustering mechanism allow for simultaneous local broadcasts at several clusters in the WSN, and it also ensures scalability with the increase of the network size. This parallelism minimizes the end to-end broadcast latency compared to the current flat-topology solutions, where the end-to-end broadcast latency and the number of messages required to make a broadcast (message-count) are proportional to the network size. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to the latency, at a low energy cost.
  • Thumbnail Image
    Item
    Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks
    (IEEE, 2012-08) Khiati, Mustapha; Djenouri, Djamel
    This paper proposes a cluster-based broadcast protocol to disseminate delay-sensitive information throughout a wireless sensor network (WSN). The protocol considers the use of duty-cycling at the MAC layer, which is essential to reduce energy dissipation. LEACH's energy-efficiency approach is used for cluster construction. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages, and using a Markov-chain model. To our knowledge, this work is the first that proposes the use of clustering to reduce broadcast latency. The clustering mechanism allows for simultaneous local broadcasts at several clusters in the WSN, and it also ensures scalability with the increase of the network size. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to the latency.