基于选择性子载波的OFDM中继信道无线资源分配算法

针对OFDM中继信道,本文提出了一种基于选择性子载波的无线资源分配算法.文中通过选择信道条件最好的部分子载波进行平均功率分配,并对中继子载波进行优化分配.仿真结果表明,该算法不仅能够提高系统可获取的传输速率,而且可以降低运算复杂度.     

基于OFDM协作中继的机会主义频谱共享协议及其最优资源分配

提出了一种基于OFDM协作中继的机会主义频谱共享协议。当主用户信道不好,不能达到其要求速率时,如果认知用户能够协作帮助主用户达到其要求速率,则该认知用户就可以以协作的方式接入主用户的频谱。在该接入方式中,认知用户利用接入频谱中的一部分子载波放大转发主用户的信息,帮助主用户达到其要求速率。然后可以利用剩余的子载波发送自己的信息。对这种接入方式中的资源分配进行了分析,利用对偶算法,提出了一种以最大化认知用户速率,保证主用户速率达到要求速率为原则的最优资源分配算法。如果认知用户不能够协作帮助主用户达到要求速率,为了有效地利用频谱资源,认知用户以非协作的方式接入主用户的频谱,利用接入的全部频谱来发送自己的信息。仿真结果验证了所提频谱共享协议的有效性,同时说明了主用户和认知用户都能够从该协议中获得好处。     

Adaptive radio resource allocation for multiple traffic OFDMA broadband wireless access system

1 Introduction Next-generation wireless communication systems (systems beyond 3G) will be required to provide flexible and easy deployment solution to high-speed communications and to support a variety of services utilizing advanced multiple access techni…     

一种低复杂度的OFDM子载波分配算法

针对认知无线电中基于OFDM子载波分配ACG算法的计算复杂度高的这一缺点,提出了一种能降低计算复杂度的OFDM子载波分配算法。新的分配算法是通过运用设定方差门限值的方法把一些信道状态变化不大的连续子载波结合成子信道,从而将原来针对每个子载波的分配转变为针对子信道的分配,以此来降低频谱资源的分配次数。仿真分析表明,新的分配算法以牺牲少量频谱效益的代价,较之原有算法,明显地降低了计算复杂度。     

OFDM-UWB系统基于用户速率的多用户动态资源分配算法

在原有动态资源分配算法基础上,提出了一种基于用户速率需求的动态资源分配算法。该算法在满足用户数据速率需求和服务质量要求(QoS)的前提下,以用户公平性为原则,分步执行子载波和比特分配来降低系统总的发射功率。首先,通过比较不同子载波对用户速率的影响,引入速率影响因子,对子载波进行分配;然后为每个用户子载波分配比特,并根据用户速率需求进行比特调整。为了进一步降低系统的复杂度,提出了一种通过子载波分组来完成子载波比特分配的方法。仿真结果表明,该算法能够降低系统功耗、误码率和系统复杂度。     

Joint subcarrier and power allocation with fairness in uplink OFDMA systems based on ant colony optimization

One of the key problems in uplink orthogonal frequency division multiple access systems is to efficiently and fairly allocate subcarriers and powers. However, most existing work has not sufficiently taken into account fairness when allocating these resources so that subcarriers cannot be fairly allocated among users with different channel conditions. To overcome this shortcoming, we first present an optimization framework with fairness, which aims to fairly allocate subcarriers among different users and to distribute the transmission power of each user over the assigned subcarriers. Here, the fairness is guaranteed by associating each user with a utility function and placing a lower limit on the number of subcarriers assigned. In particular, different from previous work, utility functions are allowed to be nonconcave and nondifferentiable so that our framework can be suitable for resource allocation for real‐time applications. Furthermore, an iterative algorithm based on the ant colony optimization is proposed, according to which subcarriers can be efficiently and fairly allocated among different users. Simulation results verify the convergence of our algorithm. In addition, our algorithm outperforms several other algorithms in terms of the fairness of resource allocation. Copyright © 2012 John Wiley & Sons, Ltd.     

一种应用于OFDM系统的MUSIC改进算法

根据OFDM信号在频域由多个子载波构成的特点,提出了适用于OFDM系统的阵列信号处理模型。并利用子载波的正交性,推导出一种可以应用于OFDM系统的MUSIC改进算法。该算法将MUSIC空间谱表示为各子载波空间谱的叠加,并可在不同信道特性下,选择不同的子载波数量,以在较小的运算量下达到较佳的性能。在此基础上,提出实用方案,并通过仿真验证了该算法的性能。     

一种基于子载波合并的多播资源调度算法

针对无线OFDM多播系统,该文提出一种基于子载波合并的多播资源调度算法。该算法通过提前将子载波分组,避免了不必要的子载波配对;自适应地选择子载波合并\非合并,在分集和复用两种模式中选取最优方案;同时根据子载波功率分配的特点,将其解耦为配对子载波集合内功率分配和集合间功率分配两个子问题,进一步优化了算法性能。仿真结果表明,与现有方案相比,所提方案能够在复杂度较低的情况下,较好地提升系统性能。     

An uplink resource allocation scheme for OFDMA‐based cognitive radio networks

Cognitive radio makes it possible for an unlicensed user to access a spectrum unoccupied by licensed users. In cognitive radio networks, extra constraints on interference temperature need to be introduced into radio resource allocation. In this paper, the uplink radio resource allocation is investigated for OFDMA‐based cognitive radio networks. In consideration of the characteristics of cognitive radio and OFDMA, an improved water‐filling power allocation scheme is proposed under the interference temperature constraints for optimal performance. Based on the improved water‐filling power allocation, a simple subcarrier allocation algorithm for uplink is proposed. The subcarrier allocation rules are obtained by theoretical deduction. In the uplink subcarrier allocation algorithm, the subcarriers are allocated to the users with the best channel quality initially and then adjusted to improve the system performance. A cursory water‐filling level estimation method is used to decrease the complexity of the algorithm. Asymptotic performance analysis gives a lower bound of the stability of the water‐filling level estimation. The complexity and performance of the proposed radio resource allocation scheme are investigated by theoretical analysis and numerical results. Copyright © 2008 John Wiley & Sons, Ltd.     

多用户OFDM系统中一种新颖的自适应功率分配方案

针对多用户正交频分复用(OFDM)系统自适应资源分配的问题,提出了一种新的自适应子载波分配方案。子载波分配中首先通过松弛用户速率比例约束条件确定每个用户的子载波数量,然后对总功率在所有子载波间均等分配的前提下,按照最小比例速率用户优先选择子载波的方式实现子载波的分配;在功率分配中提出了一种基于人工蜂群算法和模拟退火算法(ABC-SA)相结合的新功率分配方案,并且通过ABC-SA算法的全局搜索实现了在所有用户之间的功率寻优,同时利用等功率的分配方式在每个用户下进行子载波间的功率分配,最终实现系统容量的最大化。仿真结果表明,与其他方案相比,所提方案在兼顾用户公平性的同时还能有效地提高系统的吞吐量,进而证明了所提方案的有效性。     

Efficient Resource Allocation for OFDMA Multicast Systems With Spectrum-Sharing Control

This paper considers the important problem of efficient allocation of available resources (such as radio spectrum and power) in orthogonal frequency-division multiple-access (OFDMA)-based multicast wireless systems. Taking the maximization of system throughput as the design objective, three novel efficient resource-allocation schemes with reduced computational complexity are proposed under constraints on total bandwidth and transmitted power at the base station (BS). Distinct from existing approaches in the literature, our formulation and solution methods also provide an effective and flexible means to share the available radio spectrum among multicast groups by guaranteeing minimum numbers of subcarriers to be assigned to individual groups. The first two proposed schemes are based on the separate optimization of subcarriers and power, where subcarriers are assigned with the assumption of uniform power distribution, followed by water filling of the total available transmitted power over the determined subcarrier allocation. In the third scheme, which is essentially a modified genetic algorithm (GA), each individual of the entire population represents a subcarrier assignment, whose fitness value is the system sum rate computed on the basis of the power water-filling procedure. Numerical results show that with a flexible spectrum-sharing control mechanism, the proposed designs are able to more flexibly and fairly distribute the total available bandwidth among multicast groups and, at the same time, achieve a high system throughput.      

可变带宽光网络路由与资源分配研究

文章针对灵活速率光信道数据单元（ODUflex）以及带宽可变光正交频分复用（OFDM）两种光网络分别提出路由与速率分配和路由与频谱分配课题。该课题将降低系统总能耗作为最优化目标,采用最优化软件ILOG CPLEX进行仿真,分别提出了相应的启发式算法,并将最优化结果同启发式算法的结果进行了性能上的比较与讨论。     

认知网络中基于中继的频谱资源分配

根据无线认知中继网络上、下行链路子载波的信道特性,研究认知网络的频谱资源分配,提出一种上、下行链路子载波联合优化的分配算法。该算法根据子信道增益差值因子的大小分配下行链路子载波,以源节点和中继节点功率最小化为优化目标配对上行链路子载波,以用户的实时需求分配子载波的比特和功率,有效降低了系统的发射功率,提高了系统吞吐量。仿真结果表明,与启发—集中式和分布式辅助反馈传输功率分配算法比较,该联合优化算法的单位比特功耗降低了1.5~3 dBμW,误比特率性能提高了1个数量级左右。     

A Study on Deflection Routing in Optical Burst-Switched Networks

A major concern in optical burst-switched networks is contention,which occurs when multiple bursts contend for the same link. While a deflection routing protocol is proposed as one of the contention resolution techniques,there has been no appropriate deflection routing algorithm to find an alternate route. In this paper, we formulate a deflection routing problem based on the burst blocking rate resulting from resource contention in an optical burst-switched network. This algorithm minimizes the contention on the alternate path with the minimum distance. Furthermore, in this paper, we develop an analytical model for the deflection routing time when deflection routing is performed to resolve contention. In this model, we investigate the expected deflection routing time considering that the burst could be dropped even with deflection routing due to another contention on the alternate path. Simulations are conducted to show that there is an improvement in terms of burst loss rate and network throughput.     

预编码⁃TR联合峰均比抑制算法研究

OFDM架构的雷达干扰一体化波形是近年来研究的热点,该类波形将探测子载波与干扰子载波分开,具有探测子载波稳定、干扰子载波灵活的结构特点,能够同时保证波形的探测性能和干扰性能,同时也具有波形峰均比较大的波形特点。本文针对OFDM架构的雷达干扰一体化波形子载波的调制特点,提出了一种预编码?TR联合峰均比抑制算法。该算法结合预编码峰均比抑制算法和TR峰均比抑制算法原理,能够在保持一体化波形探测干扰子载波能量分配方式不变的前提条件下对波形峰均比进行有效抑制。理论和仿真试验表明：本文所提出的预编码?TR联合峰均比抑制算法对一体化波形具有不失真、峰均比抑制能力强、效率高以及性能稳定的性能优点。     

Bee colony optimization aided adaptive resource allocation in OFDMA systems with proportional rate constraints

Orthogonal frequency division multiple access (OFDMA) is a promising technique, which can provide high downlink capacity for the emerging wireless systems. The total capacity of OFDMA can be maximized by adaptively assigning subcarriers to the users with the best gains for those subcarriers, with power subsequently distributed by water-filling. In this paper, we propose the use of artificial bee colony (ABC) algorithm combined with Deb’s selection mechanism to handle the constraints. In this scheme, a probabilistic selection scheme assigns probability values to feasible solutions based on their fitness values and to infeasible individuals based on their violations, to allocate the resources to the users in downlink OFDMA system. Specifically we propose two approaches for resource allocation in downlink OFDMA systems using ABC algorithm. In the first approach, ABC algorithm is used for subcarrier allocation only, while in second approach the ABC algorithm is used for joint subcarrier and power allocation. It is shown that both these approaches obtain higher sum capacities as compared to that obtained by previous works, with comparable computational complexity. It is also shown that the joint subcarrier and power allocation approach provides near optimal results at the cost of slightly higher computational cost.     

Dynamic wavelet-based pilot allocation algorithm for OFDM-based cognitive radio systems

In a cognitive radio system, the goal is to make better use of the radio electric spectrum, allowing non-licensed users access to those currently unused electromagnetic bands assigned to licensed users (LUs). This can be achieved using OFDM, where the non-licensed users must select the temporarily available subcarriers and turn off those subcarriers used by LUs in order to avoid interference. Hence, only a subset of the subcarriers can be used for data or pilot tone transmission. To this end, some pilot allocation algorithms have been proposed for this dynamic scenario, but they are designed in such away that an equispaced pilot placement is respected (as much as possible) while minimizing the mean squared error of the channel estimate. Nevertheless, this equispaced placement can lead to the use of an increased number of pilots in order to achieve a good channel estimation. In this work, a new pilot allocation algorithm based on wavelet transform is presented. The proposed algorithm uses the discrete wavelet transform to analyze the previous channel state information, taking the knowledge of the available subcarriers into account to provide a suboptimal solution for the pilot positions. This solution leads to a non-equispaced pilot placement, which improves the channel estimation and consequently, the system performance. Likewise, the introduced algorithm allows a reduction of the number of necessary pilots, which aids in increasing the data rate. Finally, simulation results corroborate the effectiveness of the algorithm in dynamic channel scenarios.     

Computationally efficient bandwidth allocation and power control for OFDMA

The paper studies the problem of finding an optimal subcarrier and power allocation strategy for downlink communication to multiple users in an orthogonal-frequency-division multiplexing-based wireless system. The problem of minimizing total power consumption with constraints on bit-error rate and transmission rate for users requiring different classes of service is formulated and simple algorithms with good performance are derived. The problem of joint allocation is divided into two steps. In the first step, the number of subcarriers that each user gets is determined based on the users' average signal-to-noise ratio. The algorithm is shown to find the distribution of subcarriers that minimizes the total power required when every user experiences a flat-fading channel. In the second stage of the algorithm, it finds the best assignment of subcarriers to users. Two different approaches are presented, the rate-craving greedy algorithm and the amplitude-craving greedy algorithm. A single cell with one base station and many mobile stations is considered. Numerical results demonstrate that the proposed low complexity algorithms offer comparable performance with an existing iterative algorithm.     

基于Ka/Ku相控阵天线的空基自组网协议设计

针对空基自组织网络的大容量通信需求,首先提出了基于频分复用的定向MAC协议,在邻居发现过程中将测距算法与多维尺度变换定位算法相结合得到每个节点的相对位置,并设计了双预约资源分配算法,完成定向数据传输;然后提出了定向路由协议,解决了次佳路由问题和路由应答风暴,并加入相邻搜索、链路质量评估和备用路由,降低了协议开销。空基自组网基于Ka/Ku相控阵天线的定向传播特性以及Ka/Ku频段频谱资源丰富的特点,使用频分复用、空分复用技术实现多个信道的高速并行传输,从而极大地提高网络的吞吐量。     

Efficient scheduling algorithms for mixed services in wireless OFDMA system

Orthogonal Frequency Division Multiple Access (OFDMA) is an attracting system for combating the frequency selective fading. It’s widely considered as a promising candidate modulation and access scheme for next generation mobile communication systems. However, the explosive growth of multimedia applications raises higher performance requirements for Radio Resource Management (RRM) in OFDMA system. In particular, limited bandwidth and fierce resource competition impose a challenging issue on the design of packet scheduler. In this paper, we propose two scheduling algorithms applicable to mixed services (i.e., real-time and non-real-time services), that is QoS-oriented Dynamic Threshold Control (DTC) algorithm and fairness-oriented Fairness Aware and QoS Aware (FAQA) algorithm. These two algorithms are both composed of two stages, i.e., initial subcarrier allocation and subcarrier reallocation. For the DTC algorithm, in the stage of initial subcarrier allocation, based on the different metrics to weigh QoS between both services, we design a unique scheduling strategy for each type of service. A dynamic threshold is adopted to help users quickly recover from starvation, so that any one user in system can escape from severely degraded QoS. In the stage of subcarrier reallocation, we will reallocate the surplus subcarriers from the buffer-empty users to the buffer-nonempty users so as to increase spectrum efficiency. For FAQA algorithm, in the stage of initial subcarrier allocation, for the purpose of achieving Proportional Fairness (PF) with lower complexity, we deduce a simple scheduling strategy satisfying PF criterion by means of Greedy algorithm. In the stage of subcarrier reallocation, in order to increase the number of users satisfying QoS requirements, we’ll reallocate the surplus subcarriers from the QoS-satisfied users to the QoS-unsatisfied users. Simulation results demonstrate that, on one hand, the DTC algorithm not only guarantees the quality of both services, but also increases the spectrum efficiency; on the other hand, the FAQA algorithm well maintains the fairness among users, and increases the QoS satisfaction degree at the same time.