Abstract
The IEEE 802.15.4 standard provides a flexible communication support for low-rate wireless personal area networks) applications. When active, the beacon-enabled mode provides a real-time communication to the supported application by adopting a guaranteed time slot (GTS) mechanism. However, this mechanism permits only up to seven real-time communicating devices. One way to deal with this limitation is to share the communication opportunities among the periodic tasks, by skipping some of the task activations in a controlled way. One of the widely accepted periodic task models that allows skips in periodic activations is the (m,k)-firm model. Motivated by this problem, this paper proposes the use of a dynamic GTS scheduling approach based on the (m,k)-firm task model, to deal with the GTS starvation problem. The proposed scheduling approach is based on pre-defined spins of the originally defined (m,k)-firm pattern. The use of an exact schedulability analysis test ensures that for each admitted message stream, at least m messages will be transmitted within each window of k consecutive deadlines. The schedulability analysis may be executed in polynomial time and therefore can be used as an online admission test for GTS requests. The effectiveness of the approach has been assessed both by a set of simulations and an experimental evaluation.
Highlights
In the last few years, there has been a growth in the use of wireless technologies in application domains that require a trustworthy quality of service (QoS) [1,2,3,4,5,6,7,8,9]
We propose a novel approach to deal with this limitation of IEEE 802.15.4 for real-time applications, where the guaranteed time slot (GTS) slots are allocated to nodes according to a (m,k)firm scheduling strategy, guaranteeing that each node is able to transfer m messages within each window of k consecutive deadlines
This paper proposes an improvement for the GTS allocation scheme, adopting a (m,k)-firm model enhanced with spins in the (m,k)firm pattern
Summary
In the last few years, there has been a growth in the use of wireless technologies in application domains that require a trustworthy quality of service (QoS) [1,2,3,4,5,6,7,8,9]. In order to support QoS guarantees in IEEE 802.15.4 networks, there is the need to investigate the real-time characteristics of its physical (PHY) and media access control (MAC) layers [2,6,16] Within this context, one of the most interesting features is the guaranteed time slot (GTS) mechanism. We propose a novel approach to deal with this limitation of IEEE 802.15.4 for real-time applications, where the GTS slots are allocated to nodes according to a (m,k)firm scheduling strategy, guaranteeing that each node is able to transfer m messages within each window of k consecutive deadlines.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call