Admission control for QoS support in heterogeneous 4G wireless networks

Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

This paper presents new distributed power and admission control algorithms for ad-hoc wireless networks in random channel environments. Previous work in this area has focused on distributed control for ad-hoc networks with fixed channels. We show that the algorithms resulting from such formulations do not accurately capture the dynamics of a time-varying channel. The performance of the network in terms of power consumption and generated interference can be severely degraded when power and admission control algorithms that are designed for deterministic channels are applied to random channels. In particular, some well-known optimality results for deterministic channels no longer hold. In order to address these problems we propose a new criterion for power optimality in ad-hoc wireless networks. We then show that the optimal power allocation for this new criterion can be found through an appropriate stochastic approximation algorithm. We also present a modified version of this algorithm for tracking nonstationary equilibria, which allows us to perform admission control. Ultimately, the iterations of the stochastic approximation algorithms can be decoupled to form fully distributed on-line power and admission control algorithms for ad-hoc wireless networks with time-varying channels.

Due to huge popularity of wireless service, public transport vehicles (PTV) might provide wireless Internet service through Mobile Local Area Network (MLAN) where mobile router (MR) is the main controlling element. MR can ask necessary resources to cellular base stations so that it can provide the guaranteed service of on-board users. The other users, non-PTV users, might observe variations of available resource in the cellular networks. If the admission control is performed by using the current available resource information then the network might see huge call interruption ratio (CIR) whenever the available resource for non-PTV users decrease. Therefore, it is necessary to propose an efficient admission control algorithm for these networks. In this paper, we propose a probabilistic admission control (PAC) algorithm for providing guaranteed service to PTV calls and reducing fluctuation in the wireless networks. Admission control is applied only for non-PTV calls not PTV calls. The admission decision of non-PTV calls depends not only current traffic conditions such as available resource but also admission probability. We have proposed two call interruption thresholds: max and min. If the observed CIR is less than min then admission probability is 1. On the other hand, if the observed CIR is greater than max then admission probability is 0. If the CIR is between min and max then admission probability will be in between 0 and 1. The relationship between CIR and admission probability is linear. Our scheme tries to serve PTV calls even by interrupting one or more non-PTV calls. The performance of this algorithm is evaluated through discrete event simulation. The arrival process of non-PTV and PTV calls is Poisson. Each non-PTV call needs one Bandwidth Unit (BU), and the PTV calls need different number of BUs at different time. The performance metrics of our scheme are CBP of PTV, CBP of non-PTV, CIR, and fluctuation in terms of total serving calls. Simulation results show that CIR can be maintained precisely between min and max. Moreover, the proposed algorithm can provide the guaranteed service to PTV calls, minimize CBP of non-PTV calls, and minimize fluctuation. Results also show that there is a trade off between CIR and CBP of non-PTV calls.

The current industrial Internet is usually composed of heterogeneous network infrastructure. In order to adapt to different business scenarios, 5G network needs to improve the ability to flexible orchestration and realize the vertical deployment of service and infrastructure integration. Based on 5G network orchestration architecture and open source mano (OSM) technology, a 5G network scenario orchestration platform superimposed on heterogeneous 5G network resource orchestrator is designed. Furthermore, in order to effectively combine heterogeneous 5G network resources and provide reliable bearer for high-performance business scenarios, this paper designs a reliable path orchestration algorithm to establish equivalent backup paths between unrelated heterogeneous networks. This paper implements the scenario-based orchestration platform design for heterogeneous 5G networks and provides an equivalent path orchestration algorithm. Simulation experiments show that the proposed algorithm can provide highly reliable orchestration services under the condition of sharing heterogeneous network resources.

It has for long been recognized that in multi-cell wide-band code division multiple access (WCDMA) networks the admission of a new session into the system can have undesirable impacts on the neighboring cells. Although admission control algorithms that take into account such multi-cell impacts have been studied in the past, little attention has been paid to multi-cell admission and rate control algorithms when traffic is elastic. In this work, we propose a model for multi-cell WCDMA networks to study the impact of admission and rate control algorithms on key performance measures such as the class-wise blocking and dropping probabilities, block error rates and the overall throughput. By means of simulation we compare the performance of multi-cell algorithms with that of a single cell algorithm. For voice traffic, we find that multi-cell algorithms improve the session drop and block error probabilities in both of the examined heterogenous (termed "Hotspot" and "Hotround") scenarios. When traffic is elastic, the multicell algorithms perform better in the examined homogeneous case.

We study the problem of admission control and resource (subcarriers, power and bit-loading) allocation in a heterogeneous OFDMA wireless network serving both QoS-constrained high-priority users and best-effort users. By clustering subcarriers, efficient algorithms for cluster and power allocation have been proposed. Our strategy maximizes the total network utility of the best-effort users while satisfying the QoS request for maximum number of high-priority users. We approximate best-effort user utility function as a piece-wise linear function and propose a linear programming based cluster allocation algorithm. The feasibility of the resource allocation problem depends on the number of HP users in the network. Since a large number of demanding HP users would render the resource allocation problem infeasible, a joint admission control and resource allocation scheme could be an efficient way of tackling both problems with less overhead. By incorporating admission control, we propose an efficient and optimal joint admission control and resource allocation algorithm.

Next generation wireless networks (NGWN) will be heterogeneous, comprising a number of radio access technologies (RATs) coexisting in the same geographical area. In NGWN, a joint call admission control (JCAC) algorithm is needed to select the most appropriate RAT for each incoming call. The JCAC algorithm must be user-centric (i.e., consider user preferences in making RAT selection decisions) in order to enhance userspsila satisfaction. This paper investigates a user-centric JCAC (UJCAC) algorithm for heterogeneous wireless networks. The UJCAC algorithm uses Fuzzy multiple-attribute decision-making technique to select the most appropriate RAT for each incoming call. We develop a Markov model for the UJCAC algorithm to evaluate the overall call blocking probability and handoff call dropping probability in heterogeneous wireless networks. Performance of the UJCAC algorithm is evaluated using a three-RAT heterogeneous network. Simulation results show that a UJCAC algorithm can lead to highly unbalanced network load, and high call blocking/dropping probability. Therefore, a flexible UJCAC algorithm is more suitable for NGWN. In flexible UJCAC, if the mostly preferred RAT for incoming call is fully loaded, the next preferred RAT will be selected for the call. The call will be blocked only if none of the available RATs can accommodate the call. Therefore, call blocking/dropping probability will be reduced.

Mobile communication plays an important role in the future of communication systems. To meet personalized and intelligent requirements, mobile communication has evolved from single wireless cellular network to heterogeneous mobile communication network, including wireless cellular network, wireless local network, and wireless personal network. In the heterogeneous communication system, to entirely fulfill the spectrum resource complementary advantages of such a heterogeneous wireless network, the spectrum resource trade algorithm has attracted tremendous research efforts. In this paper, the advantages and disadvantages of dynamic spectrum allocation and load balancing are discussed and spectrum auction takes the place of spectrum allocation to maximize the operation revenue. The authors design a joint spectrum auction and load balancing algorithm (SALB) based on heterogeneous network environment to develop a more flexible and efficient spectrum management. The simulation result shows that SALB increases the operation profit significantly.

Adaptive admission control algorithm in a QoS-aware Web system

Admission control plays a very important role in guaranteeing the quality-of-service (QoS) in wireless mesh networks (WMNs). In this paper, based on the channel and hidden terminal information, we first estimate the available bandwidth in the operation of medium access control (MAC). We then design an admission control algorithm (ACA) at the MAC layer to address the QoS issue for real-time and nonreal-time traffic. For real-time traffic, all nodes on a route make an admission control decision based on the estimated available bandwidth. For the nonreal-time traffic, a rate adaptation algorithm is proposed to adjust the sending rates of sources to prevent the network from entering the congestion state. Finally, through extensive simulations, we demonstrate the effectiveness of our algorithm.

A distributed algorithm, where only one user for each cell is involved in the adjustment of weight and power, is proposed for joint diversity and power control in wireless networks. We prove that the power and weight of this algorithm converge to the optimal power and weight that minimize the total power consumption. In addition, we also prove some properties that facilitate the operation of the admission control in which the distributed algorithm is incorporated. Two approaches are proposed for the admission control: 1) the admission criterion and 2) the admission control algorithm. The proposed admission criteria are realized by considering a set of inequalities, whereas the proposed admission control algorithm is based on the connection removal. It is shown that the number of inequalities for the proposed admission criteria can be reduced from the number of users to the number of base stations so that the computational complexity of the proposed admission criteria can largely be reduced. In addition, we have found in the simulation results that the proposed admission control algorithm outperforms other admission control algorithms in terms of the average execution time and computational complexity.

One of the most important features of the evolving Fourth Generation (4G) wireless communication system is heterogeneous wireless access in which users could connect to several wireless access networks simultaneously. The new feature brings new challenges for the bandwidth allocation (BA) among heterogeneous networks. A non-cooperative bandwidth allocation game (NCBAG) algorithm for heterogeneous wireless networks is proposed in this paper. A BA problem is modeled as a non-cooperative game, and formulated to maximize the total utility of different networks. The existence of Nash equilibrium is verified for the proposed game model. The utility functions are developed for different applications to avoid assigning too much bandwidth to single user. Simulation results show that our proposed scheme can not only achieve high utility, but also reduce the blocking probability within a few steps of iteration.

Fifth-generation (5G) networks are already available in major urban areas and are expected to bring a major transformation to citizens’ lives. 5G services, such as enhanced mobile broadband (eMBB), ultra-reliable low latency communications (URLLC), and massive machine-type communications (mMTC), require a network infrastructure capable of supporting stringent requirements in terms of latency and bandwidth demands; as such, it must be highly dynamic and flexible. Network slicing is a key enabler technology that can provide dynamic and flexible characteristics to 5G network architecture. A network slice (NS) can be defined as a partition of network and IT resources, that is, network links and nodes capacity dedicated to a specific set of service demands. As a result, different NSs can coexist over the same physical infrastructure network and can be used to dynamically and flexibly deploy the aforementioned 5G services. However, to efficiently implement NSs with different requirements, communication service providers (CSPs) that own the physical infrastructure network must adopt sophisticated techniques for admission control and resource allocation of NSs. In this paper, we present a novel framework for admission control and resource allocation of 5G NSs in metro-core networks. Specifically, our framework is based on a deep reinforcement learning (DRL) algorithm called Advantage Actor Critic (A2C), which performs admission control, i.e. it is capable of learning which slice to admit based on the availability of the physical network resources. Then, given the diversity of requirements for each 5G service, we propose different resource allocation algorithms based on integer linear programming (ILP) and heuristics to treat each service accordingly. Results show that our proposed framework can increase the number of admitted NSs with respect to the case in which the admission control is disabled by improving the resource allocation performance.

The advancement of computing capabilities and increase of available network bandwidths have resulted in an emergency telemedicine services which can provide high quality medical services. However, existing telemedicine systems mainly have offered a one to one communication configuration instead of a multi-connection configuration. Therefore, we suggested a hybrid multimedia telemedicine system to support the multi-patients services in wired and wireless (heterogeneous) network environments. Methods: We designed the hybrid multimedia telemedicine system consisting of 4 sub-systems, a patient system, a doctor system, a emergency monitoring system, and a multi-control server system. The patient system could deliver multimedia data of a patient to the emergency monitoring system or to the doctor system according to link configuration. The link configuration was decided as 'Flowing', or 'By-passing' in accordance the connection type of patient systems or doctor systems. At this time, as the multi-control server system considers the hybrid network, it monitored the patient's multimedia data and the state of emergency telemedicine services. Results: The hybrid multimedia telemedicine system including the multi-control server system performed the best communication configuration over heterogeneous networks. This system achieved high quality emergency telemedicine services through dynamic wired and wireless networks at real-time. Conclusion: This study represented a hybrid multimedia telemedicine system over heterogeneous networks in emergency cases. We expected that the designed system could provide not only the high quality services, tele-diagnosis and tele-consultation, but also the effective emergency telemedicine services to multi-patients in the heterogeneous network environments.239

Decision making is the hot topic in business management. Recently, there have been investigations in Call Admission Control (CAC) to handle the handover events in wireless network environments. Wireless networks have been seen to support different handoff mechanisms, in which the user can switch from one wireless network to another such as from IEEE 802.11 to IEEE 802.16. Many wireless standards, such as IEEE 802.16e and IEEE 802.11, have been proposed to satisfy diverse requirements for mobile users.. Several strategies have been proposed to realize seamless handoff in the heterogeneous networks; in this paper, we analyze the performance of some novel intelligent handoff mechanisms with multiple attributes. The mobile set dynamically selects the optimal network and provides the user with high throughput of Quality of Service (QoS) as to minimize the blocking probability of the system in heterogeneous networks. We evaluate some intelligent handoff mechanisms such as Technique for Order Preference by Similarity to Ideal Solutions (TOPOSIS), Simple Additive Weight (SAW), Analytic Hierarchy Process (AHP) and Fuzzy Logic and Grey Relational Analysis (GRA). From the results, blocking probability and dropping rate can be referenced to support better QoS.