Deterministic Scheduling Algorithm Based on Proportional Conflict and Deadline in Industrial Wireless Networks

Deterministic Scheduling Algorithm Based on Proportional Conflict and Deadline in Industrial Wireless Networks

Deterministic scheduling technology is of great significance for the real-time and deterministic transmission of industrial wireless network data. In view of the fact that the industrial wireless network data stream itself has priority classification attribute, this paper, based on multi-channel time-division multiple access (TDMA) technology, analyzes link conflict delay and channel contention delay caused by high priority data stream to low priority data stream, and performs scheduling preprocessing on the network, so as to eliminate the network with unreasonable parameters, and feedback to the network manager. For preprocessed networks, the scheduling algorithm prioritizes the allocation of time slots and channel resources for links of high priority data streams, while for data streams belonging to the same priority class, a scheduling scheme based on Maximum Proportional Conflict and Deadline First (MPC-D) is proposed. Under the premise of meeting schedulability conditions, time slots and channel resources are allocated sequentially according to the proportional conflict deadline values of each link, from largest to smallest. The experimental results show that the proposed scheduling algorithm can achieve a high network scheduling success rate.