End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks

The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-to-end communication delay analysis for WirelessHART networks is required for acceptance test of real-time data flows from sensors to actuators and for workload adjustment in response to network dynamics. In this paper, we map the scheduling of real-time periodic data flows in a WirelessHART network to real-time multiprocessor scheduling. We, then, exploit the response time analysis for multiprocessor scheduling and propose a novel method for the end-to-end delay analysis of the real-time flows that are scheduled using a fixed priority scheduling policy in a WirelessHART network. Simulations based on both random topologies and real network topologies of a physical testbed demonstrate the efficacy of our end-to-end delay analysis in terms of acceptance ratio under various fixed priority scheduling policies

Delay Mitigation Using Link State Dynamic Routing Protocol Techniques

Wireless network is a new standard specifically designed for real-time and reliable communication between sensors and sink devices for industrial process monitoring and control applications. End-to-end communication delay analysis for Wireless networks is required to determine the schedulability of real-time data flows from sensors to sink for the purpose of acceptance test or workload adjustment in response to network dynamics. In this paper, a network model is considered that is based on Wireless, and maps the scheduling of real-time periodic data flows in the network to real-time multiprocessor scheduling. We then exploit the response time analysis for multiprocessor scheduling and propose a novel method for the delay analysis that establishes an upper bound of the end-to-end communication delay of each real-time flow in the network. Simulation studies based on both random topologies and real network topologies of a node physical wireless sensor network test demonstrate that our analysis provides safe and reasonably tight upper bounds of the end-to-end delays of real-time flows, and hence enables effective schedulability tests for Wireless networks

End-to-End Communication Delay Analysis in WirelessHART Networks

WirelessHART is a new standard specifically designed for real-time and reliable communication between sensor and actuator devices for industrial process monitoring and control applications. End-to-end communication delay analysis for WirelessHART networks is required to determine the schedulability of real-time data flows from sensors to actuators for the purpose of acceptance test or workload adjustment in response to network dynamics. In this paper, we map the scheduling of real-time periodic data flows in a WirelessHART network to real-time multiprocessor scheduling. We then exploit the response time analysis for multiprocessor scheduling and propose a novel method for the delay analysis that establishes an upper bound of the end-to-end communication delay of each real-time flow in a WirelessHART network. Simulation studies based on both random topologies and real network topologies of a 74-node physical wireless sensor network testbed demonstrate that our analysis provides safe and reasonably tight upper bounds of the end-to-end delays of real-time flows, and hence enables effective schedulability tests for WirelessHART networks

Accounting for Failures in Delay Analysis for WirelessHART Networks

WirelessHART networks are gaining ground as a real-time communication infrastructure in industrial wireless control systems. Because wireless communication is often susceptible to transmission failures in industrial environments, it is essential to account for failures in the delay analysis for realtime flows between sensors and actuators in process control. WirelessHART networks handle transmission failures through retransmissions using dedicated and shared time slots through different paths in the routing graphs. While these mechanisms for handling transmission failures are critical for process control requiring reliable communication, they introduce substantial challenges to worst-case end-to-end delay analysis for real-time flows. This paper presents the first worst-case end-to-end delay analysis for periodic real-time flows in a WirelessHART network that takes into account transmission failures. The delay bounds can be used to quickly assess the schedulability of real-time flows for industrial wireless control applications with stringent requirements on both high reliability and network latency. Simulations based on the topologies of a wireless sensor network testbed consisting of 69 TelosB motes indicate that our analysis provides safe upper bounds of the end-to-end delays of real-time flows at an acceptable level of pessimism

Real-Time and Energy-Efficient Routing for Industrial Wireless Sensor-Actuator Networks

With the emergence of industrial standards such as WirelessHART, process industries are adopting Wireless Sensor-Actuator Networks (WSANs) that enable sensors and actuators to communicate through low-power wireless mesh networks. Industrial monitoring and control applications require real-time communication among sensors, controllers and actuators within end-to-end deadlines. Deadline misses may lead to production inefficiency, equipment destruction to irreparable financial and environmental impacts. Moreover, due to the large geographic area and harsh conditions of many industrial plants, it is labor-intensive or dan- gerous to change batteries of field devices. It is therefore important to achieve long network lifetime with battery-powered devices. This dissertation tackles these challenges and make a series of contributions. (1) We present a new end-to-end delay analysis for feedback control loops whose transmissions are scheduled based on the Earliest Deadline First policy. (2) We propose a new real-time routing algorithm that increases the real-time capacity of WSANs by exploiting the insights of the delay analysis. (3) We develop an energy-efficient routing algorithm to improve the network lifetime while maintaining path diversity for reliable communication. (4) Finally, we design a distributed game-theoretic algorithm to allocate sensing applications with near-optimal quality of sensing

A Performance Analysis of the IRIDIUM Low Earth Orbit Satellite System

This thesis provides a performance evaluation of the IRIDIUM Low Earth Orbit Satellite system. It examines the system\u27s ability to meet real time communications constraints with a degraded satellite constellation. The analysis is conducted via computer simulation. The simulation is run at low, medium, and high loading levels with both uniform and non-uniform traffic distributions. An algorithmic approach is used to select critical satellites to remove from the constellation. Each combination of loading level and traffic distribution is analyzed with zero, three, five and seven non-operational satellites. The measured outputs are end-to-end packet delay and packet rejection rate. In addition to the delay analysis, a user\u27s ability to access the network with a degraded satellite constellation is evaluated. The average number of visible satellites, cumulative outage time, and maximum continuous outage time are analyzed for both an Equatorial city and a North American city. The results demonstrate that the IRIDIUM network is capable of meeting real-time communication requirements with several non-operational satellites. Both the high loading level and the non-uniform traffic distribution have a significant effect on the network\u27s performance. The analysis of both network delay performance and network access provides a good measure of the overall network performance with a degraded satellite constellation

Fluid flow queue models for fixed-mobile network evaluation

A methodology for fast and accurate end-to-end KPI, like throughput and delay, estimation is proposed based on the service-centric traffic flow analysis and the fluid flow queuing model named CURSA-SQ. Mobile network features, like shared medium and mobility, are considered defining the models to be taken into account such as the propagation models and the fluid flow scheduling model. The developed methodology provides accurate computation of these KPIs, while performing orders of magnitude faster than discrete event simulators like ns-3. Finally, this methodology combined to its capacity for performance estimation in MPLS networks enables its application for near real-time converged fixed-mobile networks operation as it is proven in three use case scenarios

A Performance Analysis of a Joint LMDS/ Satellite Communication Network

The goal of this research is to provide a performance analysis of a joint terrestrial/ satellite communication network. The systems of interest are the Local Multipoint Distribution Service (LMDS) terrestrial system and the proposed Teledesic satellite network. This analysis is performed using the OPNET network simulation tool. Simulations are run for twelve separate scenarios involving three factors which include: number of users, modulation type, and Quality of Service (QoS). The key metrics for characterizing simulation scenarios are the end-to-end delay, bit error rate, and average system throughput. The results obtained display the benefit of improved throughput, approximately 20 Mbps for the low user load and approximately 8 to 11 Mbps for the high user load, when the modulation schemes where changed. This improvement comes at the expense the bit error rate. For example, the bit error rate increased by a factor of 5 for the low user load when changing from BPSK to QPSK and by a factor of 1.5 for the QPSK to 8-PSK change. The peak end-to-end delay results, ranging from .053 seconds to .446 seconds, proved to support real-time voice communication for all but one scenario (BPSK/ high user load). The QoS proved to be a benefit for scenarios with a high user load (150 users) increasing the average throughput by 2 to 4 Mbps. The QoS also reduced the peak end-to-end delay, narrowing the range from .04 to .104 seconds. The analysis of these three main operational characteristics gives a fundamental look at the joint network\u27s performance capabilities

Work in progress paper: pessimism analysis of network calculus approach on AFDX networks

Worst-case delay analysis of real-time networks is mandatory, since distributed real-time applications require bounded end-to-end delays. Switched Ethernet technologies have become popular solutions in the context of real-time systems. Several approaches, based on Network Calculus, trajectories, ..., have been proposed for the worst-case analysis of such technologies. They compute pessimistic upper bounds of end-toend delays. Since this pessimism leads to an over-dimensioning of the network, it is important to quantify the pessimism of the computed upper bounds. In this paper, we propose such a pessimism analysis, based on Network Calculus. In a first step we focus on avionics switched Ethernet network (AFDX) with Fixed Priority/First In First Out (FP/FIFO) scheduling