A two-hop neighborhood information-based routing protocol is proposed for real-time wireless sensor networks. The approach of mapping packet deadline to a velocity is adopted as that in SPEED; however, our routing decision is made based on the novel two-hop velocity integrated with energy balancing mechanism. Initiative drop control is embedded to enhance energy utilization efficiency, while reducing packet deadline miss ratio. Simulation and comparison show that the new protocol has led to lower packet deadline miss ratio and higher energy efficiency than two existing popular schemes. The result has also indicated a promising direction in supporting real-time quality-of-service for wireless sensor networks.

International audienceFuture autonomous vehicles and ADAS (Advanced Driver Assistance Systems) need real-time audio and video transmission together with control data traac (CDT). Audio/video stream delay analysis has been largely investigated in AVB (Audio Video Bridging) context, but not yet with the presence of the CDT in the new TSN context. In this paper we present a local delay analysis of AVB frames under hierarchical scheduling of credit-based shaping and time-aware shaping on TSN switches. We present the eeects of time aware shaping on AVB traac, how it changes the relative order of transmission of frames leading to bursts and worst case scenarios for lower priority streams. We also show that these bursts are upper-bounded by the Credit-Bases Shaper, hence the worst-case transmissions delay of a given stream is also upper-bounded. We present the analysis to compute the worst case delay for a frame, as well as the feasibility condition necessary for the analysis to be applied. Our methods (analysis and simulation) are applied to an automotive use case, which is deened within the Eurostars RETINA project, and where both control data traac and AVB traac must be guaranteed. CCS CONCEPTS • Computer systems organization →Embedded systems; • Networks →Network reliability

LoRa is becoming an attractive low cost and low power WAN solution for many real-world IoT applications. LoRa has been designed for static end-devices to individually use the optimal configuration through an adaptive data rate mechanism (ADR), thanks to the possibility to choose a set of LoRa physical layer transmission parameters. However a large class of IoT applications (e.g. connected farm) also includes mobile nodes with specific mobility patterns. For those applications, the current ADR control algorithm may not be efficient when the radio channel attenuation rapidly changes because of the node mobility. This paper contributes to enhance the ADR mechanism by taking into account the position of the mobile devices and their trajectories in order to have a dynamic allocation. The Enhanced-ADR (E-ADR) minimizes the transmission time and energy consumption as well as packet loss for mobile devices. The testbed-based experiments show that E-ADR improves the quality of service (QoS) of the overall networks.

Using low duty-cycle is the most common technique to extend the system lifetime in WSNs. However, it also implies limited throughput and long delay and the penalty is even higher under variable traffic patterns. In this paper, we present iQueue-MAC, a hybrid CSMA/TDMA MAC that adapts to variable/bursty traffic. With light load, iQueue-MAC uses a contention-based CSMA mechanism that provides low delay with scattered transmissions. When traffic increases, detected by a forming backlog in the sender, iQueue-MAC changes to a contention-free TDMA mechanism allocating transmission slots. Thus, iQueue-MAC mitigates packet buffering and reduces packet delay, combining the best of TDMA and CSMA. In this paper we also show how iQueue-MAC can operate in both single and multi channel modes. We implemented it on SIM32W108 chips together with other reference WSN protocols for comparison. iQueue-MAC exhibits similar figures during light traffic. However, with bursty traffic its throughput can be five times that of CoSenS and Ri-MAC-MC and its delay 20 times lower. Finally, iQueue-MAC is able to effectively use multiple channels, duplicating its throughput when compared to single channel operation.

The $(m, k)$ -firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the quality of service (QoS), thus achieving the fault tolerance in case of system overload. In this paper, we focus on the distance-based priority (DBP) algorithm as it presents the interesting feature of dynamically assigning the priorities according to the system's current state (QoS-aware scheduling). However, DBP cannot readily be used for systems requiring a deterministic $(m, k)$ -firm guarantee since the schedulability analysis was not done in the original proposition. In this paper, a sufficient schedulability condition is given to deterministically guarantee a set of periodic or sporadic activities (jobs) sharing a common non-preemptive server. This condition is applied to two case studies showing its practical usefulness for both bandwidth dimensioning of the communication system providing graceful degradation of QoS and the task scheduling in an in-vehicle embedded system allowing fault tolerance.