Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling

Koubâa, Anis; Song, Ye-Qiong

doi:10.1080/00207540410001705211

Cited by 29 publications

(26 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that this relationship between the delay and the guaranteed bandwidth is different from that of other guaranteed rate servers such as weighted fair queuing (WFQ) [12]. This is because in WFQ and similar servers the guaranteed bandwidth R and the latency T are completely independent.…”

Section: General Case Of N Time Slot Gtsmentioning

confidence: 95%

“…In this paper, we consider the Network Calculus approach [4] since it is independent from the traffic representation and is more adapted to the computation of network delays [12]. Hence, to analyse the trade-off between the energy-efficiency and the delay bound, we derive the service curves and delay bounds guaranteed by the allocation of a GTS as functions of the protocol parameters, namely the duty cycle.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we will only consider the features of the 2.4 GHz frequency range, which is supported by the MICAz motes z from Crossbow Tech. [12], for example. By default, the nodes compete for medium access using slotted CSMA/CA within the contention access period (CAP) during SD.…”

Section: Related Workmentioning

confidence: 99%

“…In addition to its simplicity, the (b, r) model has the advantage to represent a higher bound for any kind of traffic, rather than dealing with unrealistic assumptions on the traffic type (e.g., assuming a Poisson arrival pattern). For instance, it has been shown in [12] that a periodic traffic with or without jitter can be represented with a (b,r) curve. In general, it is possible to translate any traffic type to the (b, r) model, provided that the cumulative arrival function is upper bounded.…”

Section: Problem Formulationmentioning

confidence: 99%

See 3 more Smart Citations

Energy and delay trade‐off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks

Koubâa

Alves

Tovar

2006

Int J Communication

View full text Add to dashboard Cite

SUMMARYThe IEEE 802.15.4 protocol proposes a flexible communication solution for low-rate wireless personal area networks (LR-WPAN) including wireless sensor networks (WSNs). It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When in beacon-enabled mode, the protocol can provide timeliness guarantees by using its Guaranteed Time Slot (GTS) mechanism. However, power-efficiency and timeliness guarantees are often two antagonistic requirements in wireless sensor networks. The purpose of this paper is to analyze and propose a methodology for setting the relevant parameters of IEEE 802.15.4-compliant WSNs that takes into account a proper trade-off between power-efficiency and delay bound guarantees. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters, using Network Calculus formalism. We then evaluate the delay bound guaranteed by a GTS allocation and express it as a function of the duty cycle. Based on the relation between the delay requirement and the duty cycle, we propose a power-efficient superframe selection method that simultaneously reduces power consumption and enables meeting the delay requirements of real-time flows allocating GTSs. The results of this work may pave the way for a power-efficient management of the GTS mechanism in an IEEE 802.15.4 cluster.

show abstract

Section: General Case Of N Time Slot Gtsmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Problem Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Energy and delay trade‐off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks

Koubâa

Alves

Tovar

2006

Int J Communication

View full text Add to dashboard Cite

show abstract

“…15.4e in terms of throughput and delay. The remaining of the paper is organized as follows: In the next section we present an overview of the related work.…”

mentioning

confidence: 99%

Worst-case bound analysis for the time-critical MAC behaviors of IEEE 802.15.4e

Kurunathan

Severino

Koubâa

et al. 2017

2017 IEEE 13th International Workshop on Factory Communication Systems (WFCS)

View full text Add to dashboard Cite

With an advancement towards the paradigm ofInternet of Things (IoT), in which every device will be interconnected and communicating with each other, the field of wirelesssensor networks has helped to resolve an ever-growing demandin meeting deadlines and reducing power consumption. Amongseveral standards that provide support for IoT, the recentlypublished IEEE 802.15.4e protocol is specifically designed to meetthe QoS requirements of industrial applications. IEEE 802.15.4eprovides five Medium-Access Control (MAC) behaviors, includingthree that target time-critical applications: Deterministic andSynchronous Multichannel Extension (DSME); Time SlottedChannel Hopping (TSCH) and Low Latency Deterministic Network (LLDN). However, the standard and the literature do notprovide any worst-case bound analysis of these behaviors, thusit is not possible to effectively predict their timing performancein an application and accurately devise a network in accordanceto such constraints. This paper fills this gap by contributingnetwork models for the three time-critical MAC behaviors usingNetwork Calculus. These models allow deriving the worst-caseperformance of the MAC behaviors in terms of delay andbuffering requirements. We then complement these results bycarrying out a thorough performance analysis of these MACbehaviors by observing the impact of different parameters. Abstract-With an advancement towards the paradigm of Internet of Things (IoT), in which every device will be interconnected and communicating with each other, the field of wireless sensor networks has helped to resolve an ever-growing demand in meeting deadlines and reducing power consumption. Among several standards that provide support for IoT, the recently published IEEE 802.15.4e protocol is specifically designed to meet the QoS requirements of industrial applications. IEEE 802.15.4e provides five Medium-Access Control (MAC) behaviors, including three that target time-critical applications: Deterministic and Synchronous Multichannel Extension (DSME); Time Slotted Channel Hopping (TSCH) and Low Latency Deterministic Network (LLDN). However, the standard and the literature do not provide any worst-case bound analysis of these behaviors, thus it is not possible to effectively predict their timing performance in an application and accurately devise a network in accordance to such constraints. This paper fills this gap by contributing network models for the three time-critical MAC behaviors using Network Calculus. These models allow deriving the worst-case performance of the MAC behaviors in terms of delay and buffering requirements. We then complement these results by carrying out a thorough performance analysis of these MAC behaviors by observing the impact of different parameters. Worst-Case BoundAnalysis for the Time-

show abstract

Scheduling in Networks

Song

2014

Real‐Time Systems Scheduling 2

View full text Add to dashboard Cite

Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling

Cited by 29 publications

References 11 publications

Energy and delay trade‐off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks

Energy and delay trade‐off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks

Worst-case bound analysis for the time-critical MAC behaviors of IEEE 802.15.4e

Scheduling in Networks

Contact Info

Product

Resources

About