Idil Candan

Analytical modeling of a time-threshold based bandwidth allocation scheme for cellular networks

In this paper, we developed an analytical model of a time-threshold based bandwidth allocation scheme for voice calls in cellular networks. The main idea in this scheme is based on monitoring the elapsed real time of handoff calls and according to a time-threshold parameter; a handoff call is either prioritized or treated as a new call. The scheme is modeled using a two-dimensional Markov chain and numerical analysis is presented to estimate blocking probabilities of new calls, dropping probabilities of handoff calls and system utilization. The scheme is also simulated under different network conditions. It is observed that analytical results closely match the simulation results. The results show that the proposed scheme yields a considerable performance enhancement when compared with other schemes.

Performance Analysis of a Time-Threshold Based Bandwidth Allocation Scheme for Data Calls in Cellular Networks

In this paper, we developed an analytical model of a time-threshold based bandwidth allocation scheme for data calls in cellular networks. The scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold parameter, handoff calls are either prioritized or treated as new calls. The scheme is modeled using a onedimensional markov chain and numerical analysis is presented to estimate blocking probabilities of new calls, dropping probabilities of handoff calls and system utilization. The scheme is simulated under different network conditions. It is observed that analytical results closely match the simulation results. The results show that the proposed scheme yields a considerable enhancement in terms of performance/cost ratio when compared with the conventional schemes.

Analytical Modeling of a Time-Threshold Based Multi-guard Bandwidth Allocation Scheme for Cellular Networks

In this paper, the analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme is presented using a two-dimensional markov chain. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritized. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the numerical results obtained from two dimensional markov chain analysis are compared with the numerical results which are obtained using one-dimensional markov chain analysis and simulation ones. The simulation and analytical results agree well. The performances of different bandwidth allocation schemes are measured using a crucial general performance metric Z. Z, which is a performance/cost ratio, is a function of the new call blocking probability, handoff call dropping probability and system utilization all together. The results indicate that our scheme outperforms other traditional schemes.

A time-threshold based multi-guard bandwidth allocation scheme for cellular networks

In this paper, a time-threshold based multi-guard bandwidth allocation scheme for voice calls is presented. The main idea of the new scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritised. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the performances of different bandwidth allocation schemes are measured using a crucial general performance metric Z. Z, which is a performance/cost ratio, is a function of the new call blocking probability, handoff call dropping probability and system utilization all together. The results indicate that our scheme outperforms other traditional schemes in terms of performance/cost ratio, and maintains its superiority under different network circumstances

A new bandwidth allocation scheme for data handoff calls in cellular networks

This paper focuses on how to allocate bandwidth for new and handoff data calls in cellular networks. Many schemes proposed in the literature give priority to handoff calls at the expense of blocking newly originating calls and degrading channel utilization. We introduce a novel bandwidth allocation scheme based on guard policy for data handoff calls. Accordingly, if the amount of occupied bandwidth exceeds a bandwidth threshold B/sub t/, new calls are blocked. The novelty of our scheme is based on observing the elapsed time of data handoff calls and according to a time threshold parameter, handoff calls can either be prioritized or treated as new calls. Compared with traditional well-known schemes, the simulation results show that our scheme achieves much better results on the handoff dropping probability, new call blocking probability, grade of service (GoS) and system utilization.

A Preemptive Time-Threshold Based Multi-Guard Bandwidth Allocation Scheme for Cellular Networks

In the next generation cellular communication environment, the effective delivery of multimedia traffic will become an increasingly important issue. In multimedia cellular networks, we should not only minimize handoff dropping probability, but also control new call blocking probability and utilize bandwidth efficiently. In this paper, a novel preemptive time-threshold based bandwidth allocation scheme(PTTS) is presented. The main idea of the new scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritized and preempt a new call. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Our simulation results show that the individual quality of service criteria of multiclass traffic such as handoff dropping probability can be achieved within targeted objective and the new call blocking probability is constrained to be below a level.

Mobility and queue based guard channel scheme for cellular networks

This paper presents a dynamic and queue based bandwidth allocation scheme for cellular networks. According to mobility values, the bandwidth threshold is dynamically changed and a queuing policy is used for newly originating calls. If the number of busy bandwidth units is greater than or equal to bandwidth threshold, the arriving new calls are queued. The results indicate that, our scheme outperforms other proposed scheme in terms of handoff dropping, new call blocking probabilities and utilization, and also maintains its superiority under different network circumstances.

Performance analysis of a time-threshold based bandwidth allocation scheme using a onedimensional markov chain in cellular networks

In this paper, the performance analysis of a time-threshold based bandwidth allocation scheme is presented. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold parameter; a handoff call is either prioritized or treated as a new call. The scheme is modeled using a one-dimensional Markov chain and numerical results are presented to estimate new call blocking probability, handoff dropping probability and system utilization. The scheme is also simulated under different network conditions. It is observed that the analytical and simulation results agree well. Also in this paper, the different bandwidth allocation schemes are compared using a performance measure (Z). The results indicate that our scheme outperforms other traditional schemes.