机器类通信中集中式与分布式Q学习的资源分配算法研究

针对海量机器类通信（massive machine type communication,mMTC）场景,以最大化系统吞吐量为目标,且在保证部分机器类通信设备（machine type communication device,MTCD）的服务质量（quality of service,QoS）要求前提下,提出两种基于Q学习的资源分配算法：集中式Q学习算法（team-Q）和分布式Q学习算法（dis-Q）。首先基于余弦相似度（cosine similarity,CS）聚类算法,考虑到MTCD地理位置和多级别QoS要求,构造代表MTCD和数据聚合器（data aggregator,DA）的多维向量,根据向量间CS值完成分组。然后分别利用team-Q学习算法和dis-Q学习算法为MTCD分配资源块（resource block,RB）和功率。吞吐量性能上,team-Q 和 dis-Q 算法相较于动态资源分配算法、贪婪算法分别平均提高了 16%、23%;复杂度性能上,dis-Q算法仅为team-Q算法的25%及以下,收敛速度则提高了近40%。     

基于效用最大化的IEEE 802.11 DCF性能分析及改进

针对802.11 DCF在系统负载较大时不能有效利用带宽资源的缺点,该文提出一种基于效用函数的DCF优化机制(U-DCF)。通过设置站点吞吐量的对数效用函数,将带宽资源的有效利用问题建模为系统效用最大化问题;应用最优化理论将此系统问题等效为可分布式求解的用户问题,即各站点只须独立选择最大化其净效用的竞争参数(CWmin),则系统整体效用也获得最大化。仿真结果表明:与标准DCF相比,U-DCF通过预估系统的当前平均分组长度和竞争站点数来调整竞争参数CWmin,能够显著提高系统的饱和吞吐量,减小分组发送时延和丢帧率。     

Utility‐based resource allocation in uplink of OFDMA‐based cognitive radio networks

Cognitive radio makes it possible for an unlicensed user to access a spectrum opportunistically on the basis of non‐interfering to licensed users. This paper addresses the problem of resource allocation for multiaccess channel (MAC) of OFDMA‐based cognitive radio networks. The objective is to maximize the system utility, which is used as an approach to balance the efficiency and fairness of wireless resource allocation. First, a theoretical framework is provided, where necessary and sufficient conditions for utility‐based optimal subcarrier assignment and power allocation are presented under certain constraints. Second, based on the theoretical framework, effective algorithms are devised for more practical conditions, including ellipsoid method for Lagrangian multipliers iteration and Frank–Wolfe method for marginal utilities iteration. Third, it is shown that the proposed scheme does not have to track the instantaneous channel state via an outage‐probability‐based solution. In the end, numerical results have confirmed that the utility‐based resource allocation can achieve the optimal system performance and guarantee fairness. Copyright © 2009 John Wiley & Sons, Ltd.     

Max-utility subcarrier allocation for heterogeneous services in wireless OFDM system

In future wireless network, one user will require multiple homogeneous or heterogeneous services simultaneously. Then, the scheduling algorithm is not only responsible for assigning a resource block to different users but also sharing the assigned resource block among multiple services for one user. Most of the traditional scheduling algorithms are designed to serve one service per user, and cannot be applied directly to this scenario because of the fairness criterion. This article focuses on adaptive resource allocation for multiple services per user at the downlink of orthogonal frequency division multiplexing (OFDM) based system. This article addresses this integrative resource scheduling problem based on utility function. First, the optimal algorithm for dynamic subcarrier allocation and share is deduced for homogeneous best-effort service system. Then the algorithm is extended to heterogeneous services system by classifying the delay sensitive service according to the head-of-line packet delay. The design goal is to maximize aggregate utility function to exploit multiuser diversity gain to the greatest extent even as guaranteeing quality of service (QoS) for delay sensitive service.     

基于非合作竞价博弈的网络资源分配算法的应用研究

本文运用博弈理论对资源分配技术进行了深入研究,提出了能够反映供求关系的基于竞价的网络资源定价机制,并设计了端系统的效用函数,论证了资源分配博弈中Nash均衡点的存在性和唯一性以及Nash均衡解.基于所提资源分配博弈模型,设计了一种网络资源分配算法(RANG).仿真实验表明,RANG算法能够为端系统的资源数量提供参考,规范端系统竞价,从而使得整个资源的分配趋于合理.     

下行SDM/OFDMA系统中基于效用函数的多用户调度算法

该文研究了空分复用/正交频分多址(SDM/OFDMA)无线通信系统中的多用户调度问题,针对该系统的空时频三维调度特点,提出一种基于效用函数的多用户调度算法。该算法利用空间多用户分集获得增益,同时兼顾系统的整体效率和用户的个体效用。通过计算机仿真验证了算法具有和穷举搜索算法相近的性能,但算法复杂度大大降低。     

前言

人们对后3G的要求是:在全球范围内实现无缝覆盖,进行包括语音、文本、图像、视频等在内的高速多媒体通信。为此,在有限频谱资源条件下,必须缩短无线信号的传输半径,极大限度地复用频谱资源,提高单位空间的信道容量。采用各种先进的无线传输技术的无线传输网络则在中、小范围内提供高速率、高质量的无线移动通信服务。因而WLAN和WPAN的需求和应用在不断增长,超宽带(UWB,ultra wide-band)等短距离、高空间容量的技术日益兴起,成为目前无线通信领域的热点。UWB的核心是冲激无线电技术,即利用持续时间非常短(纳秒、亚纳秒级)的脉冲波形来…     

无线数据网络中的非合作功率控制

为了更好地解决CDMA无线数据网络中的远近公平问题,在一种无线数据网络的基础效用函数的基础上,对用户的链路增益与发射功率作定价,提出了一种新的效用函数,并证明了这种非合作功率控制博弈中存在唯一的纳什均衡。仿真结果表明系统的远近公平问题得到了很好的改善。     

基于分段线性函数的广义效用max-min公平分配算法研究

提出了一种基于分段线性函数的广义效用max-min（UMM）公平分配算法，可支持资源分配的上下限以及各种严格单调增和连续的效用函数。该算法避免了迭代计算，复杂度低于UMM公平的注水法。简化后的算法的复杂度与现有的基于分段线性函数的狭义UMM公平分配算法相同。该算法可应用于计算机和通信领域中的各种资源分配问题中。     

A cellular neural network and utility-based radio resource scheduler for multimedia CDMA communication systems

The paper proposes a cellular neural network and utility (CNNU)-based radio resource scheduler for multimedia CDMA communication systems supporting differentiated quality-of-service (QoS). Here, we define a relevant utility function for each connection, which is its radio resource function weighted by a QoS requirement deviation function and a fairness compensation function. We also propose cellular neural networks (CNN) to design the utility-based radio resource scheduler according to the Lyapunov method to solve the constrained optimization problem. The CNN is powerful for complicated optimization problems and has been proved that it can rapidly converge to a desired equilibrium; the utility-based scheduling algorithm can efficiently utilize the radio resource for system, keep the QoS requirements of connections guaranteed, and provide the weighted fairness for connections. Therefore, the CNNUbased scheduler, which determines a radio resource assignment vector for all connections by maximizing an overall system utility, can achieve high system throughput and keep the performance measures of all connections to meet their QoS requirements. Simulation results show that the CNNU-based scheduler attains the average system throughput greater than the EXP [9] and the HOLPRO [5] scheduling schemes by an amount of 23% and 33%, respectively, in the QoS guaranteed region.     

一种提高大型可分区服务器柔软性的方案

文章针对大型可分区服务器的资源配置和管理缺乏柔软性的现象，提出了一种基于分区技术的资源配置和资源重组的方案。该方案解决了大型可分区服务器的资源最大化利用率问题和资源调整的柔软性问题。文章给出了分区资源配置和调整的方案．该方案已应用于某一基于大型可分区服务器的虚拟操作管理系统．该管理系统已经投入使用，取得了良好的效果。     

Maximization of user satisfaction in OFDMA systems using utility‐based resource allocation

In order to keep and/or expand its share of the wireless communication market and decrease churn, it is important for network operators to keep their users (clients) satisfied. The problem to be solved is how to increase the number of satisfied non‐real time (NRT) and real time (RT) users in the downlink of the radio access network of an orthogonal frequency division multiple access system. In this context, the present work proposes a method to solve the referred problem using a unified radio resource allocation (RRA) framework based on utility theory. This unified RRA framework is particularized into two RRA policies that use sigmoidal utility functions based on throughput or delay and are suitable for NRT and RT services, respectively. It is demonstrated by means of system‐level simulations that a step‐shaped sigmoidal utility function combined with a channel‐aware opportunistic scheduling criterion is effective toward the objective of user satisfaction maximization. Copyright © 2014 John Wiley & Sons, Ltd.     

单频网多播系统中的开环半动态功率分配算法

在单频网多播传输中,传统的全反馈动态功率分配数算法需要根据每个时隙反馈的用户瞬时信道信息进行实时的调整,所以造成了资源分配频率快、上行反馈开销大的缺点。为了克服这个缺点,提出了一个低复杂度、没有用户反馈的单频网多播开环半动态功率分配算法。首先在各小区等功率分配的假设下,根据单频网的形状信息算出各小区等价信道增益,然后再根据这个增益值,实现满足速率需求情况下的各小区功率分配。仿真结果显示,与全反馈的动态功率分配算法相比,该算法以一小部分性能损失为代价,大大减少了单频网的上行反馈和资源分配的开销,因此更适用于实际的单频网多播系统。     

Joint connection level, packet level, and link Layer resource allocation for variable bit rate multiclass services in cellular DS-CDMA networks with QoS constraints

An approximate analytical formulation of the resource allocation problem for handling variable bit rate multiclass services in a cellular direct sequence code-division multiple-access (DS-CDMA) system is presented. The novelty in this paper is that all grade-of-service (GoS) or quality-of-service (QoS) requirements at the connection level, packet level, and link layer are satisfied simultaneously, instead of being satisfied at the connection level or at the link layer only. The analytical formulation shows how the GoS/QoS in the different layers are intertwined across the layers. A complete sharing (CS) scheme with guard channels is used for the resource sharing policy at the connection level. The CS model is solved using a K-dimensional Markov chain. Numerical results illustrate that significant gain in system utilization is achieved through the joint coupling of connection/packet levels and link layer. This can translate to more revenues for network providers and/or lower charges for mobile users.     

多媒体DS-CDMA系统中基于效用函数的 无线资源优化策略

本文提出了一种DS-CDMA系统上行链路中基于效用函数(utility function)的无线资源分配策略.在该模型的框架下,我们提出了两种基于效用函数的无线资源分配算法:URRA-EA (Utility-based Radio Resource Allocation-Efficiency Focused)和URRA-UF (Utility-based Radio Resource Allocation-User Focused).URRA-EF旨在追求系统资源的全局最优化,而相比之下URRA-UF在用户公平性方面更有优势.为避免非线性优化带来的过高的计算复杂度,我们将基于效用函数的无线资源分配问题转换为一个市场模型,这样资源的最优配置将以分布式的模式获得,因此计算复杂度将大大降低.仿真结果表明,该策略与传统方式相比能够更灵活有效的配置无线多媒体DS-CDMA系统中的无线资源,其性能提高是显著的.     

Resource management in wireless networks using intelligent agents

This article relates to the larger‐scale traffic variations and proposes an adaptive resource assignment approach based on the multi‐agent technique which relies on self‐learning. The adaptive resource allocation scheme Channel Segregation (CS) containing inherently a self‐learning attribute was selected to test and validate the concept of using intelligent agents in base stations. Copyright © 2000 John Wiley & Sons, Ltd.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

A flexible downlink scheduling scheme in cellular packet data systems

Fast downlink scheduling algorithms play a central role in determining the overall performance of high-speed cellular data systems, characterized by high throughput and fair resource allocation among multiple users. We propose a flexible channel-dependent downlink scheduling scheme, named the (weighted) alpha-rule, based on the system utility maximization that arises from the Internet economy of long-term bandwidth sharing among elastic-service users. We show that the utility as a function of per-user mean throughput naturally derives the alpha-rule scheme and a whole set of channel-dependent instantaneous scheduling schemes following different fairness criteria. We evaluate the alpha-rule in a multiuser CDMA high data rate (HDR) system with space-time block coding (STBC) or Bell Labs layered space-time (BLAST) multiple-input multiple-output (MIMO) channel. Our evaluation shows that it works efficiently by enabling flexible tradeoff between aggregate throughput, per-user throughput, and per-user resource allocation through a single control parameter. In other words the Alpha-rule effectively fills the performance gap between existing scheduling schemes, such as max-C/I and proportional fairness (PF), and provides an important control knob at the media-access-control (MAC) layer to balance between multiuser diversity gain and location-specific per-user performance.     

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper,we present a non-transferable utility coalition graph game(NTU-CGG) based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing(OFDMA) based cognitive radio networks to maximize both system throughput and system fairness.In this algorithm,with the assistance of others SUs,SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs.So this scheme can effectively exploit both space and frequency diversity of the system.Performance results show that,NTU-CGG significantly improves system fairness level while not reducing the throughput comparing with other existing algorithms.     

Multiuser computation offloading for edge-cloud collaboration using submodular optimization

A computation offloading scheme based on edge-cloud computing was proposed to improve the system utility of multiuser computation offloading.This scheme improved the system utility while considering the optimization of edge-cloud resources.In order to tackle the problems of computation offloading mode selection and edge-cloud resource allocation,a greedy algorithm based on submodular theory was developed by fully exploiting the computing and communication resources of cloud and edge.The simulation results demonstrate that the proposed scheme effectively reduces the delay and energy consumption of computing tasks.Additionally,when computing tasks are offloaded to edge and cloud from devices,the proposed scheme still maintains stable system utilities under ultra-limited resources.