基于非合作博弈的OFDMA-WLAN系统资源分配算法研究

为满足无线局域网中基于正交频分多址技术(OFDMA-WLAN)的多用户通信需求,提出了一种基于非合作博弈的资源分配策略,利用博弈论这一有效工具对无线网络服务质量的资源分配问题进行研究,同时将用户对信道质量的不同需求转化为多用户对不同信道资源分配的非合作博弈竞争问题。此外,还将纳什均衡问题(NEP)细分为数个变分不等式子问题,通过凸优化函数对这些子问题分别求解。数值分析结果表明,所提算法在资源分配的公平性和数据传输率方面达到了更好的折中。     

A novel distributed scheduling scheme for OFDMA uplink using channel information and probabilistic transmission

Distributed uplink scheduling in OFDMA systems is considered. In the proposed model, mobile terminals have the responsibility of making their own transmission decisions. The proposed scheme is based on two dimensional reservation in time and frequency. Terminals use channel state information in order to favor transmissions over certain subchannels, and transmission is done in a probabilistic manner. The proposed approach provides more autonomy to mobile devices in making transmission decisions. Furthermore, it allows avoiding collisions during transmission since it leads to collision detection during the resource reservation phase. The proposed approach is compared to other random access methods and shown to be superior in terms of increasing sum-rate, reducing the number of users in outage, and reducing the collision probability in the reservation phase.     

减少上行CQI反馈的OFDIVIA系统资源分配

针对目前OFDMA系统上行信道信息的反馈量大和公平性欠佳的问题,提出了减少上行反馈的资源 分配算法,该算法在高信噪比下,小区中心的用户不需要反馈CQI,而在低信噪比的小区边缘,当用户量小 时,采用1B反馈,当用户量大时,采用基于门限的Best-M反馈方案．同时,根据Best-M反馈方案,提出了对 第1个用户优先选择方案．本文算法在保证资源分配必要的反馈信息的前提下,对复杂度和性能之间进了折 中,同时满足了用户之间资源分配的公平性     

Heuristic algorithms for two-dimensional uplink burst construction in IEEE 802.16 networks

Many burst construction algorithms have been proposed for Orthogonal Frequency Division Multiple Access (OFDMA). However, none meets the burst structure characteristics required by the IEEE 802.16 standard. In this study, two heuristic algorithms, Best Corner Oriented (BCO) and Best Subchannel Oriented (BSO), are proposed to provide high throughput for uplink burst construction in IEEE 802.16 networks. The BCO maintains all available slots as a continuous area and attempts to construct each burst from one of the two ending slots of this area. The BSO, however, constructs each burst in its best quality subchannels to adopt a better modulation coding scheme (MCS). The simulation results under a heavy load indicate that BSO and BCO achieve 2 and 1.5 times, respectively, the throughput achieved by Raster, the conventional algorithm. However, the superior performance of BSO is achieved at the expense of increased time complexity.     

LTE中SC-FDMA技术的研究

SC—FDMA技术作为3GPPLTE上行链路多址技术,它联合了单载波调制技术、正交频率复用和频域均衡技术（FDE）,是一种新的多址技术。文中概述了SC—FDMA技术,分析了子载波分配对系统的影响以及与OFDMA、DS—CDMA技术间的联系。     

A survey on resource allocation techniques in OFDM(A) networks

In this contribution, we present a survey on the radio resource allocation techniques in orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. This problem goes back to 1960s and that is related to properly and efficiently allocate the radio resources, namely subcarriers and power. We start by overviewing the main open issues in OFDM. Then, we describe the problem formulation in OFDMA, and we review the existing solutions to allocate the radio resources. The goal is to discuss the fundamental concepts and relevant features of different radio resource management criteria, including water-filling, max–min fairness, proportional fairness, cross-layer optimization, utility maximization, and game theory, also including a toy example with two terminals to compare the performance of the different schemes. We conclude the survey with a review of the state-of-the-art in resource allocation for next-generation wireless networks, including multicellular systems, cognitive radio, and relay-assisted communications, and we summarize advantages and common problems of the existing solutions available in the literature. The distinguishing feature of this contribution is a tutorial-style introduction to the fundamental problems in this area of research, intended for beginners on this topic.     

基于两跳匹配的OFDMA中继网络联合资源分配算法

针对OFDMA中继网络的两跳特性,提出一种基于两跳匹配的中继网络联合资源分配算法。首先根据中继网络的两跳性建立两跳速率匹配模型,然后利用对偶分解理论将中继网络资源分配的主问题分解为：中继选择、子载波分配和功率分配三个主要的子问题并进行联合优化,同时基于中继网络两跳性在子载波分配的过程中考虑两跳子载波配对,以逼近系统最优解。最后为了保证算法的公平性,考虑子载波分配因子约束以优化子载波分配。仿真结果表明：所提算法将中继选择、两跳子载波配对与功率分配联合优化以进一步提升系统吞吐量,同时引入子载波分配因子约束,保证了算法的公平性。     

基于不完备CSI的OFDMA公平资源分配算法

针对在信道状态信息不完备时,很难兼顾系统容量和公平性这一问题,通过引入公平松弛因子,提出一种公平性可调的遍历容量最大化资源分配算法。为了降低计算复杂度,在利用对偶优化方法求解拉格朗日算子过程中,提出同层循环迭代的搜索方式以代替传统的内外层循环迭代方式。通过仿真和分析表明,该算法在满足公平性的同时实现了遍历容量最大化,且计算复杂度明显降低。     

大规模MIMO OFDMA下行系统能效资源分配算法

针对大规模多输入多输出（MIMO）正交频分多址(OFDMA)下行移动通信系统,提出了一种基于能效最优的资源分配算法。所提算法在采用迫零(ZF)预编码的情况下,以最大化系统能效的下界为准则,同时考虑每个用户的最低速率要求,通过调整带宽分配、功率分配和基站天线数分配来优化能效函数。首先根据优化条件提出了一种迭代算法确定每个用户的带宽分配,然后利用分数规划的性质并采用凸优化方法,通过联合调整基站端的发射天线数和用户的发射功率来优化能效函数。仿真结果表明,所提算法在较少迭代次数的同时能够取得较好的系统能效性能和吞吐量性能。