Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

一个利用模糊预测的ATM广域网流量控制算法

本文提出了一个采用模糊预测的ＡＴＭ广域网流量控制算法，该算法包括二个部分，即非受控业务量的模糊预测和网络带宽的动态分配，在预测部分，提出了一组模糊判决规则和相关的隶属函数，在带宽分配地对ＡＴＭ广域网传输时延长的特点，把模糊预测与本文作者在文献「１」中所提出的ＳＥＲ流量控制机制相结合，保证了带分配的公平性和链路的高利用率，仿真结果表明，带宽分配具有公平性，链路利用率达到设计目标、交换节点处缓冲队列很     

效用max—min公平准则及其在ABR业务中的应用

本文提出一种新的基于效用函数的max-min(UMM）公平准则,它实现的是用户效用之间的公平分配。在ABR业务下,本文提出UMM公平性的另外两个等价定义,考察了用户的最小需求和最大需求。为了求解UMM公平分配,文中给出集中式的UMM公平分配算法及其数学证明。文章从保证分配效率的角度出发赋予峰值信元位率PCR以新的含义。UMM公平性不仅是对以往ABR业务中max-min公平性的概括,还具有很好的推广前景,特别适用于多应用类型的网络资源分配。     

Resource Allocation with Limited Feedback and Joint Coding Scheme for Wireless Multi-antenna Multicast System

In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, we introduce a resource allocation algorithm by exploiting layered coding combined with erasure correction coding for multicast services in the downlink of OFDMA-based multi-antenna system. To reduce the feedback overhead of uplink, we design a novel transmission scheme with limited feedback. Then, we formulate the joint subcarrier and power allocation problem for the data of base layer and enhancement layers, which is shown to be NP hard. Hence, in order to reduce the computational complexity, we propose a three-phase suboptimal algorithm. The algorithm is designed to maximize the system throughput while at the same time guarantee the quality of services (QoS) requirements of all multicast groups. It is composed of precoding scheme, proportional fairness subcarrier allocation algorithm and modified water-filling power allocation algorithm with QoS guarantees (MWF-Q). To further decrease the complexity of MWF-Q, a power allocation algorithm with increased fixed power allocation algorithm with QoS guarantees is introduced. Simulation results show that the proposed algorithms based on limited feedback scheme significantly outperform CMS and any other existing algorithm with full feedback. Moreover, the proposed scheme can efficiently reduce 50 % of the full feedback overhead.     

Multi-layer Resources Fair Allocation in Big Data with Heterogeneous Demands

The resource fair allocation is very important for the most systems. This paper focuses on the resource allocation in a big data system. This system has the characteristics of multiple resources owning and heterogeneous resource demanding. Firstly, a basic allocation scheme is proposed. Some allocation properties are introduced including sharing incentive, strategy proofness, envy-freeness, Pareto optimality, resource efficiency, single-layer multi-resource fairness, multi-layer single-resource fairness. Secondly, a single layer dominant and max–min fair allocation (SDMMF) is proposed. The basic idea is that the resources are firstly allocated using dominant resource fairness scheme. If some resources are not fully allocated, using max–min fairness scheme allocate the surplus ones. The SDMMF is theoretically proved satisfying all the hierarchical resource allocation properties. Thirdly, a Multi-layer resource allocation scheme, namely multi-layer dominant and max–min fair allocation (MDMMF) is proposed. The basic idea is that a multi-layer resource demand hierarchy can be divided into a series of single layer resource demand. So a resource demand vector can be built in the hierarchy from down to top. Then, the resource allocation of first layer is calculated using SDMMF allocation. The result of such allocation is further allocating in the third layer. Recursively do the MDMMF allocation until the bottom layer nodes obtain resource allocation shares. Lastly, The MDMMF is also theoretically proved satisfying all the hierarchical resource allocation properties.     

Integrating Distributed Channel Allocation and Adaptive Handoff Management for QoS-Sensitive Cellular Networks

Next generation high-speed cellular networks are expected to support multimedia applications, which require QoS provisions. Since frequency spectrum is the most expensive resource in wireless networks, it is a challenge to support QoS using limited frequency spectrum. In the literature, two orthogonal approaches are used to address the bandwidth utilization issue and the QoS provision issue; that is, channel allocation schemes have been proposed to improve bandwidth efficiency, whereas handoff management schemes, based on bandwidth reservation, have been proposed to guarantee a low connection dropping rate. However, little effort has been taken to address both issues together. In this paper, we integrate distributed channel allocation and adaptive handoff management to provide QoS guarantees and efficiently utilize the bandwidth. First, we present a complete distributed distributed channel allocation algorithm and propose techniques to reduce its message complexity and intra-handoff overhead. Second, we integrate the proposed distributed channel allocation algorithm with an adaptive handoff management scheme to provide QoS guarantees and efficiently utilize the bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous schemes, our scheme can significantly reduce the message complexity and intra-handoff overhead. Moreover, the proposed scheme can improve the bandwidth utilization while providing QoS guarantees.     

Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network

A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular network. The scheme uses the generalized processor sharing (GPS) fair service discipline to allocate uplink channel-resources, taking into account the characteristics of channel fading and intercell interference. In specific, the resource allocated to each traffic flow is proportional to an assigned weighting factor. For real-time traffic, the assigned weighting factor is a constant in order to guarantee the traffic statistical delay bound requirement; for non-real-time traffic, the assigned weighting factor can be adjusted dynamically according to fading, channel states and the traffic statistical fairness bound requirement. Compared with the conventional static-weight scheme, the proposed dynamic-weight scheme achieves capacity gain. A flexible trade-off between the GPS fairness and efficient resource utilization can also be achieved. Analysis and simulation results demonstrate that the proposed scheme enhances radio resource utilization and guarantees statistical QoS under different fairness bound requirements.     

Proportional fair scheduling with superposition coding in a cellular cooperative relay system

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation outperform conventional schedulers based on orthogonal user allocation, both in terms of throughput and proportional fairness. These results indicate promising new directions for the design of future radio resource allocation and scheduling algorithms.     

Stability and sensitivity for congestion control in wireless mesh networks with time varying link capacities

A critical challenge for wireless mesh networks is the design of efficient transport protocols that provide high bandwidth utilization and desired fairness in the multi-hop, wireless environment. While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both wireline and wireless networks, a common assumption therein is fixed link capacities. This unfortunately will limit the application scope in wireless mesh networks where channels are ever changing. In this paper, we explicitly model link capacities to be time varying and investigate congestion control problems in multi-hop wireless networks. In particular we propose a primal–dual congestion control algorithm which is proved to be trajectory stable in the absence of feedback delay. Different from system stability around a single equilibrium point, trajectory stability guarantees the system is stable around a time varying reference trajectory. Moreover, we obtain sufficient conditions for the scheme to be locally stable in the presence of delay. Our key technique is to model time variations of capacities as perturbations to a constant link. Furthermore, to study the robustness of the algorithm against capacity variations, we investigate the sensitivity of the control scheme and through simulations to study the tradeoff between stability and sensitivity.     

Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Queue-Aware Resource Allocation for Multi-cell OFDMA Systems with QoS Provisioning

This paper proposes a queue-aware resource allocation algorithm which provides quality of service (QoS) guarantees. The proposed solution adopts a cross-layer design approach since it is aware of both users’ queue buffer states (data link layer) and channel quality state (physical layer). Main advantages of the proposed resource allocation algorithm are: the low computational complexity and its capacity of maintaining lower QoS violation probability than other multi-cellular schemes. The proposed solution can also result in enhanced cell-edge data rate and improved fairness performance. User minimum data rate and target bit error rate as considered as QoS parameters. Validation of the proposed algorithm is achieved through various simulation scenarios wherein QoS violation probability, system fairness, user average data rate and cell-edge throughput are investigated. Numerical results and complexity analysis demonstrate the efficiency and the feasibility of the proposed QoS-oriented approach.     

一种低复杂度基于公平性的MIMO-OFDMA资源分配方案

该文针对MIMO-OFDMA下行链路系统,考虑在总功率和BER 以及用户数据速率成比例的约束下,以获取整个系统吞吐量极大化为准则,提出一种基于成比例公平性约束的资源分配方案。新的方案基于MIMO信道状态信息,利用特征子信道来确定子载波和功率分配,充分利用了空间域,频域以及多用户分集提高系统的频谱效率。在子载波分配时,松弛成比例约束条件,使用户数据速率近似地成比例于每个用户分配的子载波数,推导出一种线性的不需要迭代的低复杂度的功率分配方案。仿真和分析表明,整个方案在保证系统吞吐量的前提下,取得了用户间良好的速率公平性,同时又具有较低的计算复杂度。     

Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the users cannot generally be achieved with such a scheme. In this paper, a set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees. Since the optimal solution to the constrained fairness problem is extremely computationally complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. In the proposed algorithm, subchannel allocation is first performed by assuming an equal power distribution. An optimal power allocation algorithm then maximizes the sum capacity while maintaining proportional fairness. The proposed algorithm is shown to achieve about 95% of the optimal capacity in a two-user system, while reducing the complexity from exponential to linear in the number of subchannels. It is also shown that with the proposed resource allocation algorithm, the sum capacity is distributed more fairly and flexibly among users than the sum capacity maximization method.     

Joint Downlink Scheduling and Radio Resource Allocation for User-Individual QoS in Adaptive OFDMA Wireless Communication Systems

1Introduction Futurewirelessandmobilecommunicationsystems areexpectedtoofferhigherdatarates,tosupporta largenumberofsubscribersandtoensurethefulfillment ofQualityofService(QoS)requirements,giventhe limitedavailabilityoffrequencyspectrumandtimevary ingchan…     

基于边缘策略网络拥塞控制的设计与实现

设计了一种新型的基于边缘策略的拥塞代价控制功能,实现了网络中速率分配的公平性.此方案在目前实际的IP网络中加以应用,并通过网络仿真工具NS2对其性能进行了评估.仿真结果表明,控制机制简单高效,同时能够有效地控制网络系统中数据流速率的变化,从而使网络系统保持良好的传输效率和稳当性.     

基于对偶分解的OFDMA系统资源分配算法

该文针对多业务OFDMA系统资源分配问题,建立了考虑业务服务质量、数据到达、系统约束的最优化问题。分析了不同业务的速率约束、延时约束和队列长度之间的关系,并利用对偶分解方法将原问题分解为若干独立子问题,分别得到了最优资源块与最优功率分配规则,进而提出了基于对偶分解的最优资源分配算法。仿真结果表明,该算法在业务违反概率较低、公平性较好、算法复杂度略有上升的情况下,可以实现非实时业务吞吐量最大化。     

A LP-RR principle-based admission control for a mobile network

In mobile networks, the traffic fluctuation is unpredictable due to mobility and varying resource requirement of multimedia applications. Hence, it is essential to maintain traffic within the network capacity to provide service guarantees to running applications. This paper proposes an admission control (AC) scheme in a mobile cellular environment supporting hand-off and new application traffic. In the case of multimedia applications, each applications has its own distinct range of acceptable quality of service (QoS) requirements. The network provides the service by maintaining the application specified QoS range. We propose a linear programming resource reduction (LP-RR) principle for admission control by maintaining QoS guarantees to existing applications and to increase the percentage of admission to hand-off and new applications. Artificial neural networks are used to solve the linear programming problem, which facilitates in real time admission control decision in the practical systems. We present an analytical model and results for the proposed AC scheme with resource reduction principle and a simulation study of the AC for performance evaluation. The simulation results demonstrate that the proposed AC scheme performs well in terms of increasing the number of admitted applications and maintains higher percentage of resource utilization. The suggested principle also shown that it is appropriate for the fair resource allocation with improved resource utilization.     

VLC网络中兼具功率与时隙分配的自适应干扰管理机制

为了更好解决目前可见光通信（visible light communication,VLC）中干扰管理方案存在的动态优化问题,提出了一种兼具优化功率分配与时隙分配的自适应干扰管理机制。首先,在每个时隙依据用户的位置建立每个用户的接入点（access point,AP）协作集,寻找所有由最多数量互不干扰用户组成的极大独立集,以此自适应地避免同频干扰;在每个时隙为每个极大独立集采用改进的线性注水功率分配算法为信道自适应地分配发送功率,以此优化每个极大独立集的用户和速率;基于用户和速率、速率公平性及时延公平性的归一化优先因子,选出具有最大优先因子的候选极大独立集,其中包含的用户在该时隙被调用。通过仿真且与代表性文献中的算法比较可得,本文提出的自适应干扰管理与优化资源分配方案在网络频谱利用率、能效、用户速率公平性与时延公平性方面具有明显优势。      

Cross-layer resource allocation over wireless relay networks for quality of service provisioning

The authors propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-of-service (QoS) guarantees. By integrating information theory with the concept of effective capacity, the proposed scheme aims at maximizing the relay network throughput subject to a given delay QoS constraint. This delay constraint is characterized by the so-called QoS exponent thetas, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. Over both amplify-and-forwards (AF) and decode-and-forward (DF) relay networks; the authors develop the associated dynamic resource allocation algorithms for wireless multimedia communications. Over DF relay network, the authors also study a fixed power allocation scheme to provide QoS guarantees. The simulations and numerical results verify that our proposed cross-layer resource allocation can efficiently support diverse QoS requirements over wireless relay networks. Both AF and DF relays show significant superiorities over direct transmissions when the delay QoS constraints are stringent. On the other hand, the results demonstrate the importance of deploying the dynamic resource allocation for stringent delay QoS guarantees.     

Fair Multiuser Channel Allocation for OFDMA Networks Using Nash Bargaining Solutions and Coalitions

In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only$O(K^2Nlog_2 N+K^4)$, where$N$is the number of subcarriers and$K$is the number of users.