Medium Access Control Scheduling Policy Performance Evaluation in Wireless Networks

Abstract

According to the implementation model, MAC scheduling techniques may be broken down into two distinct categories centralized and distributed scheduling. These categories apply to wireless networks. Both centralized and distributed schedulers have the ability to assure a dependable throughput capacity region, also known as achieving throughput-guaranteed, by establishing MAC scheduling criteria in a reasonable manner. However, it has been shown that some throughput-guaranteed scheduling systems that are already in use are unable to further provide constrained end-to-end mean latency, as well as the explanation for these phenomena has not been well investigated. Both throughput and latency are regarded as critically significant in operational communication networks. In this study, we build on this concept by thoroughly examining the current MAC scheduling algorithms from the perspectives of throughput and latency, and by comparing their respective performances using theoretical analysis and simulation tests. The goal of this investigation is to provide a conceptual basis for the development of MAC routing technique in next-generation cellular networks.