Modeling Inter-Arrival Time for a Delay Efficient Packet Scheduler in Machine Type Communication Traffic

Abstract

:-Machine-type-communication (MTC) applications are widely deployed across several industries. One example is the Automation Industry, where a delay in processing requests may result in misreading incoming data. This work mainly concentrates on the latency issues observed in the uplink channel of MTC, specifically in transmitting data from several sensors to the Programmable Logic Controller (PLC). The requests originating from sensors and directed toward the Programmable Logic Controller (PLC) exhibit a random nature, thereby necessitating the modeling of the unpredictability associated with the arrival of MTC requests. The incoming traffic to the MTC system is classified into Event-Driven (ED) and Periodic Update (PU). The PU traffic exhibits periodic behavior accompanied by specific latency deadlines. On the other hand, ED traffic exhibits a random nature and needs prompt processing following the criticality of the application. The total utility of the system will be determined by the multiplication of the average utility of ED delay and the average utility of PU. This study introduces a packet scheduling algorithm that prioritizes delay efficiency. The packet scheduler under consideration is being evaluated against scheduling policies such as preemptive priority, First Come, First Serve (FCFS), and Earliest Due Date (EDD). The findings indicate a significant enhancement of 90% in the performance of MTC.