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.     

D-PRMA：一种新的无线Ad Hoc网络资源预留MAC机制

支持资源预留的介质访问控制(MAC)机制是无线ad hoc网络提供服务质量保证的关键.本文在分析分组预留多址接入(PRMA)的基础上,给出了一种新的支持资源预留的无线ad hoc网络MAC机制:分布式PRMA(D-PRMA).D-PRMA的主要特点是分布式的,这适合无线ad hoc网络无中心的特点,同时,D-PRMA具有很短的碰撞持续时间,支持不同速率的实时业务,避免了对分组的分片和重组.通过仿真,本文进一步分析了D-PRMA的性能,仿真结果表明D-PRMA能保证实时业务的带宽和时延.     

A New Connection Admission Control for Spotbeam Handover in LEO Satellite Networks

Frequent spotbeam handovers in low earth orbit (LEO) satellite networks require a technique to decrease the handover blocking probabilities. A large variety of schemes have been proposed to achieve this goal in terrestrial mobile cellular networks. Most of them focus on the notion of prioritized channel allocation algorithms. However, these schemes cannot provide the connection-level quality of service (QoS) guarantees. Due to the scarcity of resources in LEO satellite networks, a connection admission control (CAC) technique becomes important to achieve this connection-level QoS for the spotbeam handovers. In this paper, a geographical connection admission control (GCAC) algorithm is introduced, which estimates the future handover blocking performance of a new call attempt based on the user location database, in order to decrease the handover blocking. Also, for its channel allocation scheme, an adaptive dynamic channel allocation (ADCA) scheme is introduced. By simulation, it is shown that the proposed GCAC with ADCA scheme guarantees the handover blocking probability to a predefined target level of QoS. Since GCAC algorithm utilizes the user location information, performance evaluation indicates that the quality of service (QoS) is also guaranteed in the non-uniform traffic pattern.     

Adaptive Call Admission Control for QoS/Revenue Optimization in CDMA Cellular Networks

In this paper, we show how online management of both quality of service (QoS) and provider revenue can be performed in CDMA cellular networks by adaptive control of system parameters to changing traffic conditions. The key contribution is the introduction of a novel call admission control and bandwidth degradation scheme for real-time traffic as well as the development of a Markov model for the admission controller. This Markov model incorporates important features of 3G cellular networks, such as CDMA intra- and inter-cell interference, different call priorities and soft handover. From the results of the Markov model the threshold for maximal call degradation is periodically adjusted according to the currently measured traffic in the radio access network. As a consequence, QoS and revenue measures can be optimized with respect to a predefined goal. To illustrate the effectiveness of the proposed QoS/revenue management approach, we present quantitative results for the Markov model and a comprehensive simulation study considering a half-day window of a daily usage pattern.     

蜂窝网络中环状搜索移动性管理策略

位置管理是移动通信领域的一个具有挑战性的问题,涉及到位置更新和位置查找操作.在现行蜂窝系统的位置管理策略(简称"基本策略")中,一旦移动台越区,就需要进行位置更新.由于移动台的越区具有局部性,基本策略会造成系统资源的极大浪费.因此,降低位置管理的费用成为移动通信领域的一个研究热点.该文给出不需要进行位置更新的环状搜索位置管理策略(简称"环状策略"),并推导出搜索位置区平均层数的一个公式,然后利用这一公式对基本策略、指针推进策略与环状策略的费用进行了对比研究,得出:在一定条件下,环状策略的费用要比基本策略及基本指针推进策略小.     

A Framework for JRRM with Resource Reservation and Multiservice Provisioning in Heterogeneous Networks

Inter-working and convergence of heterogeneous wireless networks are paving the way to scenarios in which end users will be capable of using simultaneously services through different Radio Access Technologies (RATs), by means of reconfigurable mobile terminals and different network elements. In order to exploit the potential of these heterogeneous networks scenarios, optimal RAT selection and resource utilization mechanisms are required. As a result, the heterogeneous networks are introducing a new dimension to the Radio Resource Management (RRM) problem, so that new algorithms dealing with the dissimilarities and complementarities of the multiple RATs from a joint perspective have to be considered. In this sense, this paper proposes a Joint Radio Resource Management (JRRM) strategy in a multi-RAT, multicellular and multiservice scenario. An approach based on Fuzzy Neural methodology is presented. Firstly, the way how the proposed Fuzzy Neural framework deals with the multiservice allocation in a heterogeneous scenario is presented. A reinforcement learning algorithm based on neural networks allows guaranteeing a multidimensional QoS focusing on those QoS requirements which mainly affect the user perception of the service. In addition to this, the performances obtained by the Fuzzy Neural JRRM for both real-time and non real-time services, are compared to the ones offered by alternative JRRM strategies. Secondly, special attention is paid to real-time services and to mechanisms to improve their performances. An approach based on predicting future JRRM decisions and on accordingly reserving radio resources for handoff calls is presented. Simulation results will show improvements in terms of both new connection blocking and handoff call dropping probabilities. Finally, the full set of results provides the sufficient insight into the problem to allow stating that the present Fuzzy Neural framework can be a firm candidate for JRRM.

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

区域化的无线蜂窝网自主节能管理机制

为了实现无线蜂窝网的区域化节能,该文基于自主管理技术提出了区域化的自主节能管理机制(AESMM)。首先分析了无线蜂窝网的节能模型,之后提出AESMM流程。针对AESMM中核心问题,提出了区域化双基站补偿法和智能自主覆盖优化算法,以在保证区域覆盖率的同时实现区域节能的最大化。该机制在WCDMA/HSDPA 城区场景中进行了仿真,并与参考文献中的两种算法进行对比,验证了该机制能够在保证有效业务质量和良好的覆盖情况下,节约区域约17%的能量,实现最大化的节能。     

CDMA蜂窝网中的无线资源管理

本文对CDMA蜂窝网络中的无线资源管理研究作综述。内容包括功率控制、接纳控制、越区切换和无线分调度等方面，并考虑了多种业务下的服务质量。     

An Adaptive Resource Management Architecture for Active Networks

This paper presents a framework for resource management in highly dynamic active networks. The goal is to allocate and manage node resources in an efficient way while ensuring effective utilization of network and supporting load balancing. The framework supports co-existence of active and non-active nodes and proposes a novel Directory Service (DS) architecture that can be used to discover the suitable active nodes in the Internet and for selecting the best network path (end-to-end) and reserving the resources along the selected path. Intranode and internode resource management are facilitated through the DS, while within an active node the framework implements a composite scheduling scheme to schedule both the CPU and bandwidth resources to resolve the combined resource scheduling problems. In addition, a flexible active node database system and a simple adaptive prediction technique have been introduced in order to resolve the challenging problem of determining the CPU requirements of the incoming packets.     

基于合作中继的OFDM蜂窝网络的QoS感知资源调度算法

针对基于中继的OFDM蜂窝网络,该文考虑具有不同QoS要求的混合业务场景,引入合作传输机制,提出了一种基于合作中继的QoS感知资源调度算法,解决了合作中继节点选取,子载波分配以及功率控制等问题。以最大化系统效用为目标,在考虑QoS业务的速率要求与基站功率约束的同时,针对中继结构引入了中继节点的功率约束。为降低计算复杂度,将原非线性组合优化问题分解为子载波分配与功率控制两个子问题。仿真结果表明,该文所提算法在能量节约、系统效用,吞吐量等性能方面都有显著优势。     

QoS Performance Bounds and Efficient Connection Admission Control for Heterogeneous Services in Wireless Cellular Networks

Quality-of-Service (QoS) performance and connection admission control (CAC) for heterogeneous services in wireless multiple access networks are investigated. The heterogeneous services include constant bit rate (CBR), variable bit rate (VBR) and available bit rate (ABR) services. Multiple access control is handled by a polling-based scheme with non-preemptive priority. Tight delay variation (jitter) bounds for CBR connections and delay bounds for VBR connections are derived. A CAC scheme based on the derived bounds is developed. The CAC makes use of user mobility information to reserve an appropriate amount of system resources for potential handoff connections to achieve low handoff connection dropping rate (HCDR). Simulation results show that the proposed CAC scheme can achieve both low HCDR and high resource utilization.     

Fuzzy Rule-Based Mobility and Load Management for Self-Organizing Wireless Networks

Mobility management in a cluster-based, multihop ad hoc network is studied. It is shown that the process of clustering the network into groups of stations has similarities to data analysis, in particular, pattern recognition. In data analysis, the term clustering refers to the process of unsupervised learning, which also describes the situation in a mobile ad hoc network.In this paper, existing data-clustering algorithms are first classified into different categories. Some of the most important types of algorithms are afterwards described, and their applicability to the problem of mobility management in an ad hoc network is studied. It is shown that most of the pattern-recognition algorithms are not suited to the application under consideration.This is why we have developed a new clustering scheme that incorporates some of the ideas of the data classification schemes. The new clustering scheme is based on a rule-based fuzzy inference engine. The main idea consists of the consideration of dynamic clustering events chosen as a consequence of the fuzzy rules. Four types of clustering events are considered.The performance of the clustering algorithm has been evaluated by computer simulation.     

Scalable Schemes for Call Admission and Handover in Cellular Networks with Multiple Services

The introduction of new service categories withdifferent bandwidth requirements, e.g., data and multimedia, to cellularmobile radio networks makes many of the traditional mechanisms for controlingtraffic unusable orless efficient. The call admission and the handover handling are of the mostsensitive issues in this extension to new services. The performance of allservices includingthe traditional voice and the new services can be dramatically affected ifappropriate schemes are not used. In this paper, we propose call admission andhandover handling schemes for a cellular mobile network that offers twoservice types: voice and data. The data connections are assumed to transmitatdifferent transmission rates that are integer multiples to that of one radiochannel. In the case of congestion, the base station asks the active dataconnections to reduce their transmission rate in order to provide freechannels for the newly arrived request of both service types. This isbasically intended for incoming handover requests. The request will berejected if the transmission rate of the active connections reaches a givenminimum rate. Similar mechanism can also be used for new call arrivals, butsome priority can be given to handovers by setting a higher transmission ratethreshold for the new call rejection. As an extension to the proposedscalability, aqueuing of new calls is also proposed and analyzed. Analytical models werebuilt for the two proposed schemes together with the traditional channelreservation scheme. The effect of different traffic and configurationparameters on the performance measures like the grade of service, blockingprobabilities, and utilization, are studied using the proposed technique.Results show that the proposed schemes provide very good performance and morefairness among the different service types.     

Call Admission Policies Based on Calculated Power Control Setpoints in SIR-Based Power-Controlled DS-CDMA Cellular Networks

In this paper, we develop call admission control algorithms for SIR-based power-controlled DS-CDMA cellular networks. We consider networks that handle both voice and data services. When a new call (or a handoff call) arrives at a base station requesting for admission, our algorithms will calculate the desired power control setpoints for the new call and all existing calls. We will provide necessary and sufficient conditions under which the power control algorithm will have a feasible solution. These conditions are obtained through deriving the inverse of the matrix used in the calculation of power control setpoints. If there is no feasible solution to power control or if the desired power levels to be received at the base station for some calls are larger than the maximum allowable power limits, the admission request will be rejected. Otherwise, the admission request will be granted. When higher priority is desired for handoff calls, we will allow different thresholds (i.e., different maximum allowable power limits) for new calls and handoff calls. We will develop an adaptive algorithm that adjusts these thresholds in real-time as environment changes. The performance of our algorithms will be shown through computer simulation and compared with existing algorithms.     

A Dynamic Reservation-Based Call Admission Control Algorithm for Wireless Networks Using the Concept of Influence Curve

In this paper a dynamic channel reservation and call admission control scheme is proposed to provide QoS guarantees in a mobile wireless network using the concept of influence curve. The basic idea behind the proposed scheme is that a moving user, in addition to its requirements in the current cell, exerts some influence on the channel allocation in neighboring cells. Such an influence is related to the moving pattern of the users and is calculated statistically. Furthermore we developed a general analytical model to calculate the corresponding blocking probabilities for wireless networks with multiple platforms, which removes the commonly used assumption that new calls and handoff calls have same channel holding time. The numerical results demonstrate that our scheme outperforms traditional channel reservation schemes and can effectively adapt to the real time network conditions.     

B3G无线异构网络的切换技术研究

移动性管理技术是实现异构网络融合的关键技术之一,而切换管理对移动性管理显得尤为重要.针对未来异构网络的特点,本文研究了相应的切换机制,并对不同方案进行了比较分析.结果表明,两种混合式方案具有较好的切换性能,极具应用潜力.     

UMTS-WLAN垂直切换优化策略

随着移动Internet用户对IP业务宽带无线接入需求的急剧增长，通用移动通信系统（UMTS）和无线局域网（WLAN）的融合已成为亟需解决的问题．文章结合移动IPv6快速切换与基于隧道的快速切换技术，提出一种基于双向边隧道的优化策略，来实现UMTS-WLAN两种接入网络之间的无缝垂直切换．利用MN的旧转交地址截获并缓存由CN送往MN的数据分组，然后通过在旧接入路由和目标网络接入路由间预先建立的双向边隧道将分组重定向到新的网络。     

Power Control for Link Quality Protection in Cellular DS-CDMA Networks with Integrated (Packet and Circuit) Services

The problem of admission control in a DS-CDMA network carrying a heterogeneous mix of traffic is addressed. In an interference limited system such as DS-CDMA, admission of a new user impacts the performance of all other users, as well as the system capacity. The admission process is concerned with two factors: (1) maintaining the QoS of active users, (2) allocating bandwidth to new users. We propose a simple power control algorithm and prove that it is optimal in the sense of maintaining active link quality while maximizing free capacity for new admissions. The algorithm scales the powers of active links appropriately to achieve link protection and improved tolerance of the link to new interference from bursty sources. This algorithm can be used to overlay bursty packet data services without compromising QoS of active circuits.     

Admission Control Algorithms for Cellular Systems

This paper evaluates call admission control algorithms for a cellular or microcellular system. Algorithms are evaluated based on two Quality of Service (QoS) metrics: the new call blocking probability, which is the probability that a new call is denied access to the system, and the forced-termination probability, which is the probability that a call that has been admitted will be terminated prior to the call's completion. Three novel algorithms are presented: the Weighted Sum Scheme, the Probability Index Scheme, and the Hybrid Control Scheme. The weighted sum scheme uses the weighted sum of the number of calls underway in various cells when making the admission decision. The probability index scheme computes a probability index, which reflects the forced-termination probability of a new call arrival, and admits those calls with low probability indexes. The hybrid control scheme combines these two approaches. These novel algorithms are compared with three known algorithms: the Reservation Scheme in which a specific number of channels are reserved in each cell for handoffs, the Linear Weighting Scheme in which the admission decision depends on the total number of calls underway in a group of cells, and the Distributed Admission Control Scheme in which the admission decision depends on the projected overload probabilities in the cell at which the new call arrives and adjacent cells. We show that the Hybrid Control Scheme yields the best performance, particularly during periods when load differs from the expected level. We also show that the simple Reservation Scheme performs remarkably well, often superior to more complex schemes that have been proposed.