Guard Channels (guard + channel)

Distribution by Scientific Domains

Selected Abstracts

Call admission control in cellular networks: A reinforcement learning solution

Sidi-Mohammed Senouci
In this paper, we address the call admission control (CAC) problem in a cellular network that handles several classes of traffic with different resource requirements. The problem is formulated as a semi-Markov decision process (SMDP) problem. We use a real-time reinforcement learning (RL) [neuro-dynamic programming (NDP)] algorithm to construct a dynamic call admission control policy. We show that the policies obtained using our TQ-CAC and NQ-CAC algorithms, which are two different implementations of the RL algorithm, provide a good solution and are able to earn significantly higher revenues than classical solutions such as guard channel. A large number of experiments illustrates the robustness of our policies and shows how they improve quality of service (QoS) and reduce call-blocking probabilities of handoff calls even with variable traffic conditions.,Copyright 2004 John Wiley & Sons, Ltd. [source]

Performance analysis of a cellular mobile network with retrials and guard channels using waiting and first passage time measures

A. Economou
Most studies of modern cellular mobile networks concern performance measures directly computable from the stationary state probabilities such as the blocking probability and the mean traffic rates of the various kinds of calls. In this paper, we consider a cellular mobile system with retrials and guard channels for the handover calls, but we concentrate on performance measures related to the waiting and first passage times of the system. More concretely, we first build a Markovian model representing a station of the network and then we study the waiting time of a customer, the idle times of the guard channels and the time between successive lost calls. These measures shed light on the behaviour of the system and quantify the quality of service from both points of view of the customer and the administrator. Several numerical results illustrate the effect of the system parameters in its performance. Copyright 2008 John Wiley & Sons, Ltd. [source]

A distributed adaptive guard channel reservation scheme for cellular networks

H.K. Pati
Abstract In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality-of-service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright 2006 John Wiley & Sons, Ltd. [source]