The rapid change in link capacity and user count induced by platform mobility in communication systems based on high altitude platform stations (HAPS) exploiting TV White Space (TVWS) spectrum may result in a high rate of handover failure and reduced resource utilization. In addition, in High Altitude Platform (HAP) wireless networks exploiting TV White Space (TVWS) spectrums, radio resources are frequently shared across numerous customers. When the number of users accepted into a network exceeds the network's capacity, network congestion occurs, resulting in a decrease in Quality of Service (QoS) or user displeasure. To address these issues, Call admission control (CAC) may be used. This article proposed a novel call admission control scheme using deadline, channel, and tolerance aware scheduling (DCTS) algorithm to solve the challenge of scheduling real-time flows in wireless networks while maintaining tight latency guarantees. The DCTS system ensures that the average packet drop due to deadline violation converges to the preset packet loss tolerance for a given deadline requirement, packet loss tolerance, and arrival rate. Our approach covers how to handle multiple real-time packet flows at the same time with a high risk of packet losses due to latency violations without surpassing a set threshold. It also discusses how realtime application scheduling in a wireless context must account for the complicated relationship between packet deadlines, channel circumstances, and flow tolerance, as well as how to propose such scheduling policies. We also test our proposed algorithm's performance for various arrival, channel state, deadline, and threshold scenarios. The convergence of packet drops near the threshold was demonstrated analytically. In wireless networks, CAC is a critical component in ensuring guaranteed quality of service. For real-time wireless applications that employ the DCTS scheduler, we present a threshold-based CAC method. We use the assumption that all flows belong to the same traffic class for determining the admission criteria. Our goal is to create a CAC algorithm that ensures that packet loss due to deadline violations is kept to a minimum for all allowed users. As a result, our CAC is based on a set of criteria that includes the maximum packet deadline, loss tolerance, and pace of newly received calls, as well as the accepted flows' minimum flow priority. The admission controller threshold is compared to the properties of freshly arrived flow in our CAC method. We compare our scheme's performance to that of the CAC of Violation Fair Exponential Rule (VFEXP) algorithm and the Modified Largest Weighted Delay First (MLWDF) methods.