蜂窝无线通信网络呼叫允许控制分析

无线网络中由于用户的移动性、频谱资源的缺乏以及信道的衰落,使无线网络的服务质量的供给成为一个日益严峻的问题。呼叫允许控制(CAC)是无线资源管理中的重要组成部分,是一种保证服务质量和网络资源利用率的重要机制。总结了CAC领域的研究成果,对蜂窝无线通信网络的CAC方案进行了分析,指出了目前CAC研究中存在的问题,并探讨了今后的研究方向。     

A call admission control strategy for multiservice wireless cellular packet networks

A simple connection control system for multiservice cellular wireless networks is presented. Mobile stations are classified depending on the traffic they generate (e.g., voice, data). Within each class, two subclasses are also identified: stations which have originated inside the cell and stations which come from adjacent cells. The connection control mechanism is carried out by considering a number of priorities among the various classes and their subclasses. It works on two levels: static and dynamic. The static level looks at packet-level quality of service (QoS), such as cell loss and delay, while the dynamic level takes care of connection dynamics and allows the load of the system to be driven with respect to the various subclasses. Results that illustrate the performance of this control mechanism are presented.     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

A probabilistic approach for fair-efficient call admission control in wireless multiservice networks

The efficiency of call admission control (CAC) schemes in multiclass wireless networks should be evaluated not only with regard to the call blocking probability (CBP) achieved for every service class (SC) supported but also with regard to quality of service (QoS) and network efficiency criteria. In this article, four CAC schemes offering priority to SCs of advanced QoS requirements, based on guard channel policy, are studied and evaluated taking into account fairness and throughput criteria in addition to CBP. For the performance evaluation of the proposed CAC schemes and to examine fairness issues, two fairness indices are introduced along with a throughput metric. The analytical results, validated through extensive simulations, indicate that by appropriate selection of the CAC parameters satisfactory fairness and throughput are achieved while achieving low CBP.     

QoS provisioning for multiple non‐real‐time services in cellular wireless networks

Future mobile services are expected to include various non‐voice oriented services. One important category of non‐voice oriented mobile services is non‐real‐time services. When a mobile user establishes a connection to access non‐real‐time service, the mobile user usually cares about whether the total time to complete its data transfer is within its time tolerance. In addition, different mobile users may have different bandwidth requirements and different tolerances in the total completion time. It is essential for wireless systems to provide various mobile users with different total completion times. In this paper, two quality‐of‐service (QoS) metrics, called stretch ratio and eligibility percentage, are employed at a connection level to present the degree of the length of the total completion time. We devise a measurement based call admission control scheme that provides multiple QoSs for various mobile users which have different requirements of stretch ratios, eligibility percentages, and bandwidths. Extensive simulation results show that the measurement based call admission control scheme not only provides various satisfactory QoSs for mobile users but also produces high throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

无线移动网中呼叫接纳控制模型分析

新一代无线网应该能够同时支持传统的数据业务和实时交互式多媒体业务，并能够为用户提供QoS保证。在无线网中提供QoS保证，呼叫接纳控制扮演着重要的角色。对已有的呼叫接纳控制方面的研究成果进行了归纳、总结和分析，以期得出适合于无线移动多媒体网络的呼叫接纳控制模型。为适应当前的多媒体应用，侧重于对和适应性带宽分配相结合的接纳控制模型的分析。另外，介绍了与价格机制相结合的接纳控制模型，经济学概念的引入，为我们解决问题提供了一种新的视角。     

Tiered bandwidth reservation scheme for multimedia wireless networks

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.     

Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks

This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we prove that a timeslot assignment providing one unit of bandwidth on P can be found in O(P) time if such an assignment exists. The results have been extended to the case that P can provide two units of bandwidth. Based on the timeslot assignment for the special cases, an efficient slot assignment algorithm with O(P²k) is proposed for general cases, where k is the number of slots in a TDMA frame. Then, the timeslot assignment algorithm is integrated into a quality of service (QoS) call admission scheme for QoS call requests. Extensive simulations are conducted and the results have demonstrated the superior performance of our method.     

Performance evaluation of priority based adaptive multiguard channel call admission control for multiclass services in mobile networks

The CAC (call admission control), which can guarantee call services to meet their QoS (Quality of Service) requirements, plays a significant role in providing QoS in wireless mobile networks. In this paper, an adaptive multiguard channel scheme‐based CAC strategy is proposed to prioritize traffic types and handoff calls. The major aim of the study is to develop the analytical model of the priority traffic and handoff calls based adaptive multiguard channel scheme and examining the performance through setting the value of the adaptive ratio parameters. Our proposed scheme tries to mediate the advantages and drawbacks of the static and dynamic CAC schemes. The proposed scheme is quite different from previous studies because multithreshold values have been considered for multiclass traffic by adaption parameters, and a closed form analytical model is developed The numerical results show that this scheme can be used to keep the targeted QoS requirement by suitably setting the adaptive ratio parameters. Copyright © 2011 John Wiley & Sons, Ltd.     

基于多种业务流资源共享的在线呼叫接入控制算法

本文针对多种业务类型提出了一种在线呼叫接入控制算法（OCAC）。OCAC算法是基于QoS业务量的服务质量要求和BE业务量的拥塞状态来动态地调整资源的分配,目的是更有效地利用资源并且在QoS业务流调整服务质量的同时,改善BE业务量的吞吐量。针对多跳的情况,本文描述了OCAC算法的两种实现方案,即基于每个节点和基于源节点的OCAC实现方案（ENS和SNS）。最后给出了仿真结果,并对本文提出的算法和静态接入控制算法的仿真结果进行了比较,进一步说明OCAC算法的有效性。     

多业务无线蜂窝移动通信系统的一种呼叫允许控制策略

第三代移动通信系统要求支持宽带多媒体业务,如话音、视频、数据等多种业务,不同业务有不同的QoS要求。本文提出的多业务无线蜂窝移动通信系统中一种基于QoS的呼收允许控制策略,对不同业务的切换呼叫给予不同的优先权。本文分析了两种呼叫允许控制（CAC）算法,一种是各种业务的切控呼叫无缓冲器,不进入排队系统;另一种是各种业务的切换呼叫设置有缓冲器,进入排除系统,并且话音、视频业务的切切呼叫比数据业务的切换呼叫有更高的优先权,系统的空闲信道应首先分配给话音、视频业务的切换呼叫,再分配给数据业务的切换呼叫。在分析两种CAC算法的呼叫阻塞概率、切换失败概率以及系统吞吐量的基础上,给出了计算机仿真结果。     

Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

Combining Bandwidth Borrowing and Reservation in Cellular Networks

In the third generation cellular networks and beyond, a wide variety of different services are/will be provided by the operators. Out of QoS reasons, it is preferable to assign higher priority to certain connection types. These include calls carrying delay-sensitive services and already ongoing calls. In this paper, a prioritization method combining bandwidth borrowing and reservation, called BBR, will be presented. BBR monitors the rate-adaptiveness of the ongoing calls in a cell. Simultaneously, advanced movement predictions are applied to estimate the arrival rate to each cell. If it is determined that the use of bandwidth borrowing (temporarily reducing the data rate of other connections in the same cell) is not sufficient to support the high priority calls that are expected to arrive, a portion of the assigned bandwidth to the cell is exclusively reserved for these calls to prevent call dropping. The scheme enables the operator to increase the average user satisfaction in the network. This is achieved by defining appropriate penalty functions for the events of blocking, dropping and bandwidth reduction of a call.     

QoS‐based adaptive error control for wireless networks

Wireless channels are highly affected by unpredictable factors such as cochannel interference, adjacent channel interference, propagation path loss, shadowing, and multipath fading. The unreliability of media seriously degrades the transmission quality. Automatic Repeat reQuest (ARQ) and Forward Error Correction (FEC) schemes are frequently used in wireless environments to reduce the high bit error rate of the channel. In this paper, we propose an adaptive error‐control scheme for wireless networks on the basis of dynamic variation of error‐control strategy as a function of the channel bit error rate, desired QoS, and number of receivers. Reed–Solomon codes are used throughout this study because of their appropriate characteristics in terms of powerful coding and implementation simplicity. Simulation results show that our adaptive error‐control protocol decreases the waste of bandwidth due to retransmissions or extra coding overheads while satisfying the QoS requirements of the receivers. Copyright © 2002 John Wiley & Sons, Ltd.     

Power allocation and call admission control in multi‐class traffic DS‐CDMA systems with imperfect power control

We deal with power allocation (PA) and call admission control (CAC) under imperfect power control (IPC) in the reverse link of direct sequence‐code division multiple access systems for supporting multi‐class traffic. First, we briefly review the optimum PA scheme under perfect power control (PPC) and the CAC scheme subject to an outage constraint on the total composite received power. Then, we analyze the outage degradation due to the power control error when the optimum reference power levels under PPC are used. In order to mitigate the outage degradation, we would modify the reference power levels by incorporating a call dropping strategy and an outage‐lowering strategy into the optimum PA scheme under PPC. Also, we derive a constraint inequality to determine the reverse link capacity under IPC. Finally, through numerical analyses, we compute the modified reference power levels under IPC and evaluate the reverse link capacity under IPC. Copyright © 2006 John Wiley & Sons, Ltd.     

面向统计QoS保障的多时间尺度接纳控制算法

采用在线测量的方法计算业务流的统计特性估计其突发水平以便选择合适的业务流模型。为了保障业务流的统计QoS,基于选定的业务流模型,通过有效带宽和有效包络的转换定理,获得多分形和自相似业务流的有效包络。然后,采用统计网络演算获得QoS参数进行接纳控制决策,并且通过选择接纳时机减小接纳控制本身对QoS的影响。仿真结果表明该算法能够准确地选择流模型,满足流模型的统计延迟要求,提高带宽利用率。     

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access (TDMA) mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution (NBS) derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.     

Adaptive admission/congestion control policies for CDMA‐based wireless internet

Radio resource management (RRM) is vital for the next generation wireless networks. RRM comprises many functionalities and this paper focuses on the investigation of the performance of several adaptive call admission/congestion control policies based on a window‐measurement estimation of the status of the buffer at the base station under the hybrid TDMA/CDMA access scheme. In our study, we interrelate the physical limitations of the base stations (i.e. the number of transmission and reception modems), call and burst level traffic, instantaneous buffer conditions and end‐to‐end bit error performance in one queuing problem. Subsequently, a window‐measurement estimator is implemented to estimate the likelihood of buffer congestion at the base station. Accordingly, the traffic loads shall be controlled. We use event‐driven simulation to simulate the multimedia integrated CDMA networks where heterogeneous traffic users are multiplexed into a simple TDMA frames. The simulation results show outstanding performance of the proposed call admission/congestion control policies in guaranteeing QoS requirements. Copyright © 2005 John Wiley & Sons, Ltd.     

Optimized bandwidth allocation with fairness and service differentiation in multimedia wireless networks

In this article we present an optimal Markov Decision‐based Call Admission Control (MD‐CAC) policy for the multimedia services that characterize the next generation of wireless cellular networks. A Markov decision process (MDP) is used to represent the CAC policy. The MD‐CAC is formulated as a linear programming problem with the objectives of maximizing the system utilization while ensuring class differentiation and providing quantitative fairness guarantees among different classes of users. Through simulation, we show that the MD‐CAC policy potentially achieves the optimal decisions. Hence our proposed MD‐CAC policy satisfies its design goals in terms of call‐class‐differentiation, fairness and system utilization. Copyright © 2006 John Wiley & Sons, Ltd.     

A correlation‐based and spectrum‐aware admission control mechanism for multimedia streaming in cognitive radio sensor networks

Bandwidth management and traffic control are critical issues to guarantee the quality of service in cognitive radio networks. This paper exploits a network load refinement approach to achieve the efficient resource utilization and provide the required quality of service. A connection admission control approach is introduced in cognitive radio multimedia sensor networks to provide the data transmission reliability and decrease jitter and packet end‐to‐end delay. In this approach, the admission of multimedia flows is controlled based on multimedia sensors' correlation information and traffic characteristics. We propose a problem, connection admission control optimization problem, to optimize the connection admission control operation. Furthermore, using a proposed weighting scheme according to the correlation of flows issued by multimedia sensors enables us to convert the connection admission control optimization problem to a binary integer‐programming problem. This problem is a kind of a Knapsack problem that is solved by a branch and bound method. Simulation results verify the proposed admission control method's effectiveness and demonstrate the benefits of admission control and traffic management in cognitive radio multimedia sensor networks. Copyright © 2015 John Wiley & Sons, Ltd.