Call Blocking Probabilities under a Probabilistic Bandwidth Reservation Policy in Mobile Hotspots

In this paper we study a mobility-aware call admission control algorithm in a mobile hotspot. To this end, a vehicle is considered which has an access point with a fixed capacity. The vehicle alternates between stop and moving phases. When the vehicle is in the stop phase, it services new and handover calls by prioritizing them via a probabilistic bandwidth reservation (BR) policy. Based on this policy, new handover calls may enter the reservation space with a predefined probability. When the vehicle is in the moving phase, it services new calls only. In that phase, two different policies are considered: (a) the classical complete sharing (CS) policy, where new calls are accepted in the system whenever there exists available bandwidth, and (b) the probabilistic BR policy. Depending on the selected policy in the moving phase, we propose the probabilistic BR loss model (if the CS policy is selected) and the generalized probabilistic BR loss model (if the probabilistic BR policy is selected). In both stop and moving phases, where the call arrival process is Poisson, calls require a single bandwidth unit in order to be accepted in the system, while the service time is exponentially distributed. To analytically determine call blocking probabilities and the system’s utilization, we propose efficient iterative algorithms based on two-dimensional Markov chains. The accuracy of the proposed algorithms is verified via simulation.

Joint Channel Assignment and Bandwidth Reservation using Improved FireFly Algorithm (IFA) in WMN

In WMN, at the time of network consignment and bandwidth registration, the active network consignment method did not take into consideration the intrusion, congestion load and bandwidth necessities as a whole. The significance centred bandwidth registration methods result in famishment of slightest significance congestion. Hence in this paper, we propose a Joint Channel Assignment and Bandwidth Reservation using Improved FireFly Algorithm (IFA) in WMN. Initially the priority of each node is determined based on the channel usage, future interference and link congestion probability metrics. The bandwidth is allocated straight, comparative to the nodule significance and entire quantity of congestion movements incomplete on the demanded nodule. For channel assignment and path selection, the improved FireFly Algorithm (IFA) is used. The objective function of IFA is determined in terms of link capacity, interference and flow conservation constraints. Then the channels and the path which minimize the objective function are selected by applying IFA. By simulation results we show that the proposed technique minimizes the traffic and enhances the channel efficiency.

Enhanced Adaptive Call Admission Control Scheme With Bandwidth Reservation for LTE Networks

Call admission control (CAC) is one of the radio resource management techniques that regulates and provide resources for new or ongoing calls in the network. The existing CAC schemes wastes bandwidth due to its failure to check before degrading admitted real-time calls and it also increases the call dropping probability (CBP) and calling blocking probability (CBP) of real-time calls due to the delay incurred when bandwidth is degraded from them. This paper proposed an enhanced adaptive call admission control (EA-CAC) scheme with bandwidth reservation. The scheme employs a prior-check mechanism that ensured bandwidth to be degraded will be enough to admit the new call request. It further incorporates an adaptive degradation mechanism that degrades non-real time calls before degrading the RT calls. The performance of the EA-CAC scheme was evaluated against two existing schemes using Vienna LTE system level simulator. The EA-CAC scheme exhibits better performance compared to the two schemes in terms of throughput, CBP, and CDP of RT calls without sacrificing the performance of NRT calls.