Call Admission Control Algorithm Research Articles

Performance Evaluation and Analysis of Urban-Suburban 5G Cellular Networks

5G is the fifth-generation technology standard for the new generation of cellular networks. Combining 5G and millimeter waves (mmWave) gives tremendous capacity and even lower latency, allowing you to fully enjoy the 5G experience. 5G is the successor to the fourth generation (4G) which provides high-speed networks to support traffic capacity, higher throughput, and network efficiency as well as supporting massive applications, especially internet-of-things (IoT) and machine-to-machine areas. Therefore, performance evaluation and analysis of such systems is a critical research task that needs to be conducted by researchers. In this paper, a new model structure of an urban-suburban environment in a 5G network formed of seven cells with a central urban cell (Hot spot) surrounded by six suburban cells is introduced. With the proposed model, the end-user can have continuous connectivity under different propagation environments. Based on the suggested model, the related capacity bounds are derived and the performance of 5G network is studied via a simulation considering different parameters that affect the performance such as the non-orthogonality factor, the load concentration in both urban and suburban areas, the height of the mobile, the height of the base station, the radius, and the distance between base stations. Blocking probability and bandwidth utilization are the main two performance measures that are studied, however, the effect of the above parameters on the system capacity is also introduced. The provided numerical results that are based on a network-level call admission control algorithm reveal the fact that the investigated parameters have a major influence on the network performance. Therefore, the outcome of this research can be a very useful tool to be considered by mobile operators in the network planning of 5G.

Performance evaluation of a mobile hotspot supporting quasi‐random traffic

AbstractThe authors study and evaluate a mobility‐aware call admission control algorithm in a mobile hotspot. More specifically, a vehicle which has an access point of a fixed capacity and may alternate between stop and moving phases is considered. In the stop phase, the vehicle services new and handover calls. To prioritise handover calls a probabilistic bandwidth reservation policy is considered where a fraction of the capacity is reserved for handover calls. Based on this policy, new calls may enter the reservation space with a predefined probability. In addition, handover calls have the option to wait in a queue of finite size if there are no available resources at the time of their arrival. In the moving phase, the vehicle services only new calls under the classical complete sharing policy. In both phases, calls arrive in the system according to a quasi‐random process, require a single bandwidth unit for their acceptance in the system and have an exponentially distributed service time. To analytically determine the various performance measures, such as time congestion probabilities, call blocking probabilities and link utilisation, an accurate analytical method is presented based on three‐dimensional Markov chains.

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.

Call Admission Control Algorithm with Efficient Handoff for Both 4G and 5G Networks

Recently, many generations of mobile networks have changed from one transition to another transition. The mode of transition from the first generation (1G) to the fifth generation (5G) is characterized by a lot of performance challenges such as delay, speed of the users, mobility, and variety of services. Currently, different from prior generations, 5G is not only concerned with the mobile networks but also, with various applications and different services such as health sector, transportation, energy consumption, safety well as Smart City. All these services are incorporated by 5G. In this paper, we proposed a call admission control (CAC) algorithm with an efficient handoff for both 4G and 5G networks. Simulation is used to evaluate the effectiveness of the proposed algorithm, and the obtained results indicate it considerably performs better than do other algorithms based on valuable metrics such as data throughput, call blocking probability (CBP), and call dropping probability (CDP).

QoS Aware Multi-Path Routing using Link Scheduling Algorithm

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Performance Evaluation of 5G/WiFi-6 Coexistence

The fifth-generation mobile communication network (5G) is the promising technology nowadays to provide not only a higher speed compared to 4G but also a revolution of services to cover different industrial sectors such as health, production, energy, and many. WiFi-6 is a new wireless local area network (WLAN) technology that is suitable to work in an office, home, and dense areas. As a new technology, 5G has some limitations concerning coverage and capacity. To overcome these limitations, one possible solution is to use the free unlicensed spectrum available in Wi-Fi technology, therefore, a complement solution of 5G/WiFi-6 coexistence is proposed to make both technologies complement each other in providing a better quality of service for the end-user concerning a higher speed, low latency, and higher capacity. According to OFDM modulation, the proposed model divides the cell into two virtual zones, the inner zone represents WiFi-6 technology surrounded by 5G technology. All resources will be shared between the two technologies taken into consideration that more bandwidth should be given to the most inner zone with high intensity of traffic. The call admission control algorithm will be based on a minimum bit rate to be given to each zone that should be satisfied to admit the call. The model is solved using MOSEL-2 simulation language, to study different performance parameters such as BER, utilization, blocking probability, latency, throughput, and aggregate average bit rate in both zones. The simulation results show that coexistence causes some degradation in 5G performance, however, a positive effect on the overall cell performance is achieved by balancing the load all over the whole cell.

5G NB‐IoT: Efficient network call admission control in cellular networks

SummaryThe International Telecommunications Union defines in its IMT‐2020 recommendations three types of use of 5G services: mMTC (massive Machine‐type Communications), eMBB (enhanced Mobile Broadband), and uRLLC (ultra‐Reliable Low Latency Communications). The mMTC service allows a considerable number of machines and devices to communicate while guaranteeing a good quality of service. The eMBB service allows very high data throughput, even at the cell border. The uRLLC service is used for ultra‐reliable communication for critical needs requiring very low latency. These services are provided separately in a given cell. However, the number of connected objects is starting to increase rapidly as well as the bit rates and energy consumption. The 5G network must make it possible to provide access to a vast number of users of its different service categories. Call admission control (CAC) techniques focus more on availability in terms of bit rate and coverage. In this article, we suggest an algorithm for modeling CAC in an area served by the three categories of services in a 5G access network, mainly based on minimum energy consumption. This technique will allow connected objects that consume low energy to connect to the network with an adequate quality of service and enable the development of the Internet of Things.

MRCSC: A cross-layer algorithm for joint Multicast Routing, Channel selection, Scheduling, and Call admission control in multi-cell multi-channel multi-radio cognitive radio wireless networks

This paper addresses the problem of joint multicast routing, channel selection, scheduling, and call admission control in multi-cell multi-channel multi-radio cognitive radio wireless mesh networks. The applied model relies on the QoS sessions, where each one is expressed with a bandwidth requirement. We propose a cross-layer algorithm named “Multicast Routing, Channel selection, Scheduling, and Call admission control (MRCSC)”. The proposed scheme, considering wireless broadcast advantage, channel/radio diversity, and spatial reuse, uses both intra- and inter-cell relaying to create multicast trees with a specific bandwidth. MRCSC considers both inter-flow and intra-flow interferences. It adopts an efficient collision-free mechanism to greedily schedule different multicast transmission in the network. As an advantage, considering the multi-radio technology, MRCSC allows the nodes to simultaneously send/receive data on different available non-overlapping channels. Numerical results of our comprehensive simulations confirm the efficiency of the MRCSC algorithm in terms of the number of transmissions, stability, and multicast period.

An optimum dynamic priority-based call admission control scheme for universal mobile telecommunications system

The dynamism associated with quality of service (QoS) requirement for traffic emanating from smarter end users devices founded on the internet of things (IoTs) drive, places a huge demand on modern telecommunication infrastructure. Most telecom networks, currently utilize robust call admission control (CAC) policies to ameliorate this challenge. However, the need for smarter CAC has becomes imperative owing to the sensitivity of traffic currently being supported. In this work, we developed a prioritized CAC algorithm for third Generation (3G) wireless cellular network. Based on the dynamic priority CAC (DP-CAC) model, we proposed an optimal dynamic priority CAC (ODP-CAC) scheme for Universal Mobile Telecommunication System (UMTS). We then carried out simulation under heavy traffic load while also exploiting renegotiation among different call traffic classes. Also, we introduced queuing techniques to enhance the new calls success probability while still maintaining a good handoff failure across the network. Results show that ODP-CAC provides an improved performance with regards to the probability of call drop for new calls, network load utilization and grade of service with average percentage value of 15.7%, 5.4% and 0.35% respectively.

New Bandwidth Upgradation and Degradation Algorithms for Next Generation of Wireless Network Systems

With the increase of the usage of multimedia applications, the next generation of wireless networks need to satisfy the quality of the transmitted application even if the network is characterized by limited radio resources such as bandwidth (that it is not less than that required by all the traffic sessions). Many call admission control (CAC) and bandwidth degradation algorithms for real time transmissions were proposed. However, CAC algorithms may consume intensive processing time that can provoke delay constraint violation for new calls and handover calls, in particular when it deals with real-time transmission. All this could cause the degradation of the quality of service (QoS) requirements. To overcome this problem, our proposed algorithm aims to minimize the risk of delay violation by facilitating the triggering of the CAC algorithms. The objective is to adapt the available bandwidth of the wireless resources to be ready to admit any new session without degrading the QoS of already existing sessions. A bandwidth level degradation algorithm is presented to reduce the bandwidth of some active sessions in the cell in order to accommodate the arrived calls. Moreover, an upgrading bandwidth algorithm is also presented when a call is finished or passed to another cell to increase the bandwidth of residual calls having a risk of QoS degradation. New call blocking probability, handover call dropping probability and bandwidth utilization were used to evaluate the performance of our algorithm. Simulation results show that the proposed algorithm is efficient and it is advantageous to use it for a better management of radio resources. The blocking probability for new calls is about 10% which is significantly lower than of others studied algorithms and about 15% is shown for handover dropping ratio. Those result respond to the QoS requirements although 100% of bandwidth utilization.

Performance Evaluation of Dynamic QoS-Aware CAC (DQA-CAC) Algorithm for Broadband Networks

Call admission control (CAC) is a technique deployed in the management of network resources in mobile broadband networks. Despite its importance, the WiMAX technology like most mobile broadband networks does not make provision for CAC, making it an open area of research. A dynamic QoS-Aware Call Admission Control (DQACAC) scheme was recently proposed to improve resource utilization and ensure QoS. Several simulation experiments were conducted to evaluate the performance of the DQA-CAC against other CAC algorithms. The results of the simulation indicated that the DQA-CAC outperformed the existing CAC schemes in terms of reduced new connection blocking rate. However, the evaluation failed to consider other performance metrics like resource utilization and throughput that are also very crucial in the real-world scenario. This paper therefore attempts to improve the performance of the DQA-CAC by investigating its performance in terms of additional metrics like the average system throughput and resource utilization that further mimic the real-world experience. A Java based discrete event simulator designed for the study was used and the simulation results indicate that the DQA-CAC algorithm outperforms the existing CAC algorithms in terms of improved per-flow throughput, average system throughput and resource utilization in addition to reducing the connection blocking rate.

Congestion Control Call Admission Control (CC-CAC) Algorithm for Mobile Broadband Networks

Mobile broadband networks are continuously faced with the challenge of limited resources due to the increasing demand for high speed Internet services. To manage these resources, call admission control (CAC) which determines whether or not a connection request should be accepted or rejected is one of the resource management techniques usually deployed. A Dynamic QoS-aware CAC algorithm was recently proposed to improve resource utilization. However, the algorithm detects congestion of the network only after it has occurred, which leads to increase in blocking probability and thus lead to reduction in throughput. In this paper, a congestion control call admission control (CC-CAC) algorithm is proposed to reduce call blocking and increase throughput of all connection classes. The CC-CAC employs a congestion control mechanism that regulates the base station buffer to operate at a target threshold. It also employs a dynamic bandwidth degradation mechanism to degrade the resources of the admitted connections when resources are not sufficient to admit more connections. The algorithm is evaluated using simulation. The results show that the proposed scheme outperforms the benchmark scheme in terms of decrease in blocking probability and increase in throughput for all connection classes.

B&W Call Admission Control for Multimedia Communication Networks

In the multimedia communication networks providing quality of service (QoS), an interface between the signal processing systems and the communication systems is the call admission control (CAC) mechanism. Owing to the heterogeneous traffic produced by diverse signal processing systems in a multimedia communication network, the traditional CAC mechanism that used only one CAC algorithm can no longer satisfy the aim of QoS CAC: Utilize the network resource to the most best and still satisfy the QoS requirements of all connections. For satisfying the aim of QoS CAC in the multimedia communication networks, this study proposed an innovative CAC mechanism called black and white CAC (B&W CAC), which uses two CAC algorithms. One of them is called black CAC controller and is used for the traffic with specifications more uncertain, which is called black traffic here. The other is call white CAC controller and is for the traffic with clearer specifications, which is call white traffic. Because white traffic is simple, an equivalent bandwidth CAC is taken as the white CAC. On the other hand, a neural network CAC (NNCAC) is employed to be the black CAC to overcome the uncertainty of black traffic. Furthermore, owing to more parameters needed in a QoS CAC mechanism, a hierarchical NNCAC is proposed instead of the common used NNCAC. Besides to accommodate more parameters, a hierarchical NNCAC can keep the complexity low. The simulation results show the B&W CAC can obtain higher utilization and still meet the QoS requirements of traffic sources.

A QoS Guaranteed Call Admission Control (QOG-CAC) Algorithm for Broadband Networks

Call admission control (CAC) is one of the techniques deployed in managing network resources. Recently, the dynamic QoSaware CAC (DQA-CAC) algorithm was proposed to reduce the new connection blocking rate and improve resource utilization. However, the algorithm admits new connections and degrades existing ones without recourse to delay requirements of delay-intolerant extended real-time polling service (ertPS) and real-time polling service (rtPS) connections—which may incur additional delay, leading to an increase in packet drop rate and, consequently, reduced throughput. In this article, a QoS-guaranteed call admission control (QOG-CAC) algorithm is proposed to ensure QoS and consequently increase the throughput of all class of connections. The proposed QOG-CAC is simulated using a Java-based discrete event simulator. The results of the extensive simulation experiments conducted show that the proposed algorithm outperforms the compared scheme with regard to average system throughput, new connection blocking rate, and per-flow throughput of real-time as well as non-real-time connections

A Hybrid Approach to Call Admission Control in 5G Networks

Artificial intelligence is employed for solving complex scientific, technical, and practical problems. Such artificial intelligence techniques as neural networks, fuzzy systems, and genetic and evolutionary algorithms are widely used for communication systems management, optimization, and prediction. Artificial intelligence approach provides optimized results in a challenging task of call admission control, handover, routing, and traffic prediction in cellular networks. 5G mobile communications are designed as heterogeneous networks, whose important requirement is accommodating great numbers of users and the quality of service satisfaction. Call admission control plays a significant role in providing the desired quality of service. An effective call admission control algorithm is needed for optimizing the cellular network system. Many call admission control schemes have been proposed. The paper proposes a methodology for developing a genetic neurofuzzy controller for call admission in 5G networks. Performance of the proposed admission control is evaluated through computer simulation.

Call Admission Control Algorithm for Energy Saving in 5G H-CRAN Networks

Call Admission Control Algorithm for Energy Saving in 5G H-CRAN Networks

A Novel Call Admission Control Algorithm for Next Generation Wireless Mobile Communication

Wireless communication technology is progressing very vastly. With this change in technology customer services for multimedia and non-multimedia are increasing day by day. But due to limited resources of the wireless network, we need to design an efficient CAC algorithm to enhance QoS levels for end users. The Quality of service (QoS) enhancement in the wireless network is related to making an efficient use of current network resources and the optimization of the users. Call acceptance in CAC is one of the challenge in mobile cellular networks to ensure that the acceptance of a new call into a resource limited wireless network should not deviate the service level Agreement (SLAs) at the time of conversations. In the next generation wireless network, CAC has the direct impact on QoS for user calls & overall system performance. To handle handoff calls and new calls in cellular network channel reservation scheme have been already proposed to reserve system bandwidth for higher priority call for CAC. This earlier proposed scheme is not as per the required level of satisfaction because the available reversed bandwidth is not allocated properly in case of least handoff rate. In this, the authors like to present a new channel borrowing scheme where new non real time (NRT) calls can make use of reserved channels. It can borrow this reserved channel on a temporary basis and after this immediately if any handoff call enters the current cell and no any other channels are available, then it will pre-empt the channel from an earlier borrowed NRT user if exists. This pre-empted NRT call is kept in the priority queue to consider its service when any channel becomes free. The number of NRT calls in the queue should not be large to avoid delayed service. The fundamental objective of the proposed scheme to design of the system for evaluating the results and comparing with the results of the existing system. From the results of current research work, it is observed that proposed scheme decreases call dropping probability which increase slightly in call blocking rate over high-density handoff call rate.

A Discrete Event Simulation for Hierarchical Mobile IPv6

In recent years’ simulators like the open source tool ns-2, and commercial software’s like OPNET have included Mobile IPv6 extensions in order to provide analysis for advanced Mobile IPv6 system development. Although these simulators are among the significant simulators, however, they have a tendency to be specific to hardware, vast integrated components, complex and the need of licensing cost for commercial simulators. To strike an ideal balance in gauging these tradeoffs and to further complement the repository of simulators, this study deliberates the details of a general-purpose programming language based Discrete Event Simulation for Hierarchical Mobile IPv6. This paper has incorporated a call admission control algorithm as an example to validate the simulator for Hierarchical Mobile IPv6. A Fuzzy Inference System based call admission control has been used as a benchmark deployment algorithm. The base model has been extensively analyzed and the set of parameters (simulation and non-simulation parameters), events, performance metrics and other fundamental elements has been derived. The Fuzzy Inference based call admission control is studied and evaluated against the benchmark model. The results demonstrate that the developed discrete event simulator has effectively produced the benchmark results and verified that the new simulator has effectively become a dependable selection for Hierarchical Mobile IPv6 performance analysis.

Call Admission Control With Inter-Network Cooperation for Cognitive Heterogeneous Networks

In this paper, a call admission control algorithm based on inter-network cooperation is proposed via a Stackelberg game framework for cognitive heterogeneous networks. The call admission control problem is subject to the variable bandwidth rate traffic, network service selection, feasible subchannel allocation, and call blocking probability. The call admission control algorithm is based on spectrum price at primary heterogeneous networks and subchannel allocation price and network selection at cognitive heterogeneous networks. In order to determine the call blocking probability, a probability upper bound of exceeding the maximum admission number for secondary mobile terminals (MTs) is analyzed based on ${\mathrm{M}}/{\mathrm{M}}/\infty $ model. Then, the subchannel allocation price and network selection are designed via the dual decomposition method, and the vacant spectrum price is determined with Bertrand game theory. Finally, a call admission control algorithm is proposed. Simulation results demonstrate that the proposed algorithm not only improves quality of service at each secondary MT, but also reduces the call blocking probability for cognitive heterogeneous networks.

Cell Permanence Time and mobility analysis in infrastructure networks: Analytical/statistical approaches and their applications

Given the recent computation technologies and dedicated systems able to analyze huge amounts of “real-world” data and to extract information from it, the application possibilities reached in wireless mobile systems have significantly increased. The availability of mobile information, directly extracted from mobility traces, can be used to enhance the quality of the services offered, especially in a vehicular environment, where mobility is one of the main challenges. We present an in-depth study of mobility information management in infrastructure networks, where the covering devices can have a complete local visibility of what happens in terms of covered nodes. We focus our attention on the ways the gathered information can be used to set the coverage radius, to enhance a call admission control algorithm and to predict future movements. The paper introduces also a detailed description of how the obtained data can be statistically processed, and the obtained results confirm the benefits of the proposed scheme, especially in terms of call dropping probability (a minimum gain of 0.35 is obtained), which is a dominant parameter in infrastructure networks.