Scheduling approaches in beacon‐enabled mode for wireless sensor networks

Abstract

Summary Efficient energy consumption is the most important challenge in wireless sensors networks. Many solutions have been proposed since many years as efficient medium access control protocols, smart sensing applications, appropriate task scheduling, and so on. Task scheduling allows could participate to optimise energy consumption, it aims to propose planning over repetitive time periods where sensors need to sleep, to collect data and to communicate. In this paper, we propose two scheduling procedures (semi‐dynamic and dynamic) which are executed over the ZigBee network in beacon‐enabled mode. Each of these algorithms has its own features and advantages. The Zigbee super‐frame is used as a means to inform each node on its duties (when to sleep or when to communicate). In order to evaluate our proposals, we have implemented them over TelosB motes running on operating system TinyOS. These algorithms have been implemented on the Z‐Monitor tool . We have compared our scheduling approaches to the usual static scheduling method provided by Zigbee. These evaluations show that our proposals enhance network lifetime and ensure better packet data rate and lower latency. Copyright © 2017 John Wiley & Sons, Ltd.

LBS: A Beacon Synchronization Scheme With Higher Schedulability for IEEE 802.15.4 Cluster-Tree-Based IoT Applications

“…In this section, the performance of LBS 1 is evaluated and compared with different schemes like SDS [22], Mesh- 1 The code are released at https://github.com/Nikumani/synchronization. MAC [27], LABS [29], TBoPs [30] and a dynamic scheme presented in [32]. The performance metrics considered are a) transmission overhead: that is in terms of number of transmissions required for synchronization among the coordinators, b) energy consumption, c) MAC goodput, d) schedulability, and e) re-synchronization overhead.…”

“…More recent works like [23], [32]- [34] describe approaches for scheduling in IEEE 802.15.4 networks. In [32], the authors propose a semi-dynamic and a dynamic scheduling approach.…”

“…More recent works like [23], [32]- [34] describe approaches for scheduling in IEEE 802.15.4 networks. In [32], the authors propose a semi-dynamic and a dynamic scheduling approach. In semi-dynamic algorithm, coordinators are assigned beacon time slots only if their ID (address) is pre-stored by the PANC.…”

“…In [29], the maximum number of devices that can be scheduled is exactly equal to that of MeshMAC. In [32], in the first semi-dynamic approach, only pre-chosen coordinators can schedule their beacons, i.e., a fixed number of coordinators can be scheduled. Thus, the schedulability will be lower than MeshMAC.…”

Foreword to the special issue of the International Conference on Innovative Network Systems and Applications held under the Federated Conference on Computer Science and Information Systems

“…The problematic of Machine‐to‐Machine communication is handled in where the algorithm and protocol devised for task allocation to nodes of Machine‐to‐Machine architecture which consists of battery powered devices are presented. Two novel scheduling procedures for energy consumption optimization for wireless sensor networks are presented in . An aim is to propose planning over repetitive time periods where sensors need to sleep, to collect data and to communicate.…”