Adaptive Probabilistic Scheduling for a Cellular Emergency Network

Abstract

Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexible, analytically-based scheme for dealing with admission control in a cellular network that supports emergency service. In the scheduling scheme, a priority queue is used to ensure the wise utilization of system resources while guaranteeing the priority of public handoff traffic. Also, probabilistic scheduling is considered for adaptively ensuring the high admission rate of emergency traffic and protecting public calls for different traffic demands. The admission of emergency traffic and public originating traffic can be flexibly adjusted. Numerical results about the evaluation of this strategy are presented and show an obvious improvement over related strategies.