Petri net modeling and performance analysis of can fieldbus

The CAN FB (Controller Area Network FieldBus) has been in existence for ten years. It supports automated manufacturing and process control environments to interconnect intelligent devices such as valves, sensors, and actuators. CAN FieldBus has a high bit rate and the ability to detect errors. It is immune to noise and resistant to shock, vibration, and heat. Two recently introduced mechanisms, Distributed Priority Queue (DPQ) and Priority Promotion (PP) enable CAN FieldBus networks to share out the system bandwidth and grant ail upper bound on the transmission times so as to meet the requirements in real-time communications. Modeling and analysis of such networks are an important research area for their wide applications in manufacturing automation. This thesis presents a Petri net methodology which models and analyzes CAN FieldBus access protocol. A Reachability Graph of the Petri net model is -utilized to study the behavioral properties of the protocol. A timed Petri net simulator is used to evaluate the performance of the protocol. Performance measures include the completion time for successful events and operations. Operational parameters investigated using the Petri Net model are FieldBus speed, the length of each frame, and the number of frames in a message

Probabilistic timing analysis of the h-BEB collision resolution algorithm

Ethernet networks are becoming increasingly popular in industrial computercontrolledsystems, as they allow for a single network protocol at both the higher and the lowerlevels of an industrial communication infrastructure. Despite the introduction in the early 90s ofa full-duplex operating mode, numerous industrial Ethernet networks still operate inheterogeneous environments, with Ethernet Switching Hubs interconnecting both independentnode stations and industrial Ethernet Repeater Hubs. Among node stations interconnected by aRepeater Hub, the network still operates in the traditional shared Ethernet mode; that is,collisions are solved by means of a probabilistic contention resolution algorithm i.e., themedium access is inherently non-deterministic.In this paper, it is analyzed an enhanced collision resolution algorithm for shared Ethernetnetworks, referred as high priority Binary Exponential Backoff (h-BEB). Such algorithm allowsthe coexistence of Ethernet standard devices together with modified (real-time) devices in thesame network segment. Both the analytical and the simulation timing analysis show that theh-BEB algorithm guarantees a maximum access delay that is significantly smaller than for thecase of standard Ethernet stations. Such enhanced collision resolution algorithm enables thetraffic separation between standard and modified (real-time) stations, and is therefore able toguarantee a real-time communication behavior in unconstrained traffic environments

Pfair scheduling of generalized pinwheel task systems

[[abstract]]The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a run-time complexity point of view, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems.

Pinwheel Scheduling for Fault-tolerant Broadcast Disks in Real-time Database Systems

The design of programs for broadcast disks which incorporate real-time and fault-tolerance requirements is considered. A generalized model for real-time fault-tolerant broadcast disks is defined. It is shown that designing programs for broadcast disks specified in this model is closely related to the scheduling of pinwheel task systems. Some new results in pinwheel scheduling theory are derived, which facilitate the efficient generation of real-time fault-tolerant broadcast disk programs.National Science Foundation (CCR-9308344, CCR-9596282

Timely and Efficient Information Delivery in Real-Time Industrial IoT Networks

Enabling real-time communication in Industrial Internet of Things (IIoT) networks is crucial to support autonomous, self-organized and re-configurable industrial automation for Industry 4.0 and the forthcoming Industry 5.0. In this paper, we consider a SIC-assisted real-time IIoT network, in which sensor nodes generate reports according to an event-generation probability that is specific for the monitored phenomena. The reports are delivered over a block-fading channel to a common Access Point (AP) in slotted ALOHA fashion, which leverages the imbalances in the received powers among the contending users and applies successive interference cancellation (SIC) to decode user packets from the collisions. We provide an extensive analytical treatment of the setup, deriving the Age of Information (AoI), throughput and deadline violation probability, when the AP has access to both the perfect as well as the imperfect channel-state information. We show that adopting SIC improves all the performance parameters with respect to the standard slotted ALOHA, as well as to an age-dependent access method. The analytical results agree with the simulation based ones, demonstrating that investing in the SIC capability at the receiver enables this simple access method to support timely and efficient information delivery in IIoT networks

Wi-Fi QoS improvements for industrial automation

Digitalization caused a considerable increase in the use of industrial automation applications. Industrial automation applications use real-time traffic with strict requirements of connection of tens of devices, high-reliability, determinism, low-latency, and synchronization. The current solutions meeting these requirements are wired technologies. However, there is a need for wireless technologies for mobility,less complexity, and quick deployment. There are many studies on cellular technologies for industrial automation scenarios with strict reliability and latency requirements, but not many developments for wireless communications over unlicensed bands. Wireless Fidelity (Wi-Fi) is a commonly used and preferred technology in factory automation since it is supported by many applications and operates on a license free-band. However, there is still room for improving Wi-Fi systems performance for low-latency and high-reliable communication requirements in industrial automation use cases. There are various limitations in the current Wi-Fi system restraining the deployment for time-critical operations. For meeting the strict timing requirements of low delay and jitter in industrial automation applications, Quality of Service (QoS)in Wi-Fi needs to be improved. In this thesis, a new access category in Medium Access Control (MAC) layer for industrial automation applications is proposed.The performance improvement is analyzed with simulations, and a jitter definition for a Wi-Fi system is studied. Then, a fixed Modulation and Coding (MCS) link adaptation method and bounded delay is implemented for time-critical traffic in the simulation cases to observe performance changes. Finally, it is shown that the new access category with no backoff time can decrease the delay and jitter of time-critical applications. The improvements in Wi-Fi QoS are shown in comparison with the current standard, and additional enhancements about using a fixed modulation and coding scheme and implementation of a bounded delay are also analyzed in this thesi

Distributed Backlog-Aware D2D Communication for Heterogeneous IIoT Applications

Delay and Age-of-Information (AoI) are two crucial performance metrics for emerging time-sensitive applications in Industrial Internet of Things (IIoT). In order to achieve optimal performance, studying the inherent interplay between these two parameters in non-trivial task. In this work, we consider a Device-to-Device (D2D)-based heterogeneous IIoT network that supports two types of traffic flows, namely AoI-orientated. First, we introduce a distributed backlog-aware random access protocol that allows the AoI-orientated nodes to opportunistically access the channel based on the queue occupancy of the delay-oriented node. Then, we develop an analytical framework to evaluate the average delay and the average AoI, and formulate an optimization problem to minimize the AoI under a given delay constraint. Finally, we provide numerical results to demonstrate the impact of different network parameters on the performance in terms of the average delay and the average AoI. We also give the numerical solutions of the optimal parameters that minimize the AoI subject to a delay constraint