基于公平度和惩罚函数的OFDMA自适应资源分配

针对基于速率自适应准则的正交频分多址自适应资源分配中系统容量和用户公平度的问题,提出了一种采用子载波分配和功率分配两步来解决该问题的新方案。该方案主要通过基于公平度的子载波分配算法和基于惩罚函数的功率分配算法来实现。在子载波分配算法中,当满足公平度约束时就提高系统的容量,否则就提升用户的公平度。而子载波分配后,并不能较好地兼顾系统容量和用户公平度。所以,在功率分配算法中,又基于惩罚函数提出了一种新的功率寻优策略,并且该策略利用基于模拟退火思想的改进人工蜂群算法来实现系统容量和用户公平度的折中。仿真结果表明所提出的方案不仅可以有效地提升系统容量,同时也可以实现给定的公平度约束,进而证明所提方案的有效性。     

改进的子载波比特功率分配算法

针对多用户多输入多输出-正交频分复用(multiple input multiple output-orthogonal frequency divi-sion multiplexing,MIMO-OFDM)系统的自适应资源分配问题,对子载波比特功率两步分配(Two-Steps)和联合分配方法进行了比较,分析了收发天线数目对系统性能的影响.提出了一种改进的子载波比特功率算法,该算法基于两个用户可以同时在一个子载波上发送数据的子载波复用方法,将子载波和比特功率联合分配,对比特重新调整的迭代过程进行了改进.仿真结果表明,该算法在不影响系统误码性能的前提下降低了复杂度.     

Resource allocation with minimum transmit power in multicast OFDM systems

To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing (OFDM) downlink system, resource allocation algorithms that adaptively allocate subcarriers and bits are proposed. The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power, while guaranteeing each user’s instantaneous minimum rate requirement. The resource allocation problem is first formulated as an integer programming (IP) problem, and then, a full search algorithm that achieves an optimal solution is presented. To reduce the computation load, a suboptimal algorithm is proposed. This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation. Greedy-like algorithms are employed in both procedures. Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.     

基于OFDMA的无线协作多播网络资源分配算法

在传统的无线多播传输中,多播组的系统性能受限于多播组内的最差用户的信道质量。为了克服多播组的系统性能受限的问题,将协作传输引入到基于正交频分多址(orthogonal frequency division multiple access,OFDMA)的无线多播网络中,并提出了在总传输速率受限的情况下,最小化总传输功率的动态资源分配算法。为了减少计算复杂度和保障公平性,提出了协作公平子载波分配算法(cooperative fair, CF)和迭代注水功率分配算法。仿真结果显示,在多播组的用户中进行协作传输的系统性能,要远高于采用传统多播直接传输的性能,并且所提算法也在保证系统性能的同时,实现了多播组间良好的公平性。     

Joint power and spectrum allocation algorithm in cognitive radio networks

The spectrum sharing problem between primary and cognitive users is mainly investigated.Since the interference for primary users and the total power for cognitive users are constrained,based on the well-known water-filling theorem,a novel one-user water-filling algorithm is proposed,and then the corresponding simulation results are given to analyze the feasibility and validity.After that this algorithm is used to solve the communication utility optimization problem subject to the power constraints in cognitive radio network.First,through the gain to noise ratio for cognitive users,a subcarrier and power allocation algorithm based on the optimal frequency partition is proposed for two cognitive users.Then the spectrum sharing algorithm is extended to multiuser conditions such that the greedy and parallel algorithms are proposed for spectrum sharing.Theory and simulation analysis show that the subcarrier and power allocation algorithms can not only protect the primary users but also effectively solve the spectrum and power allocation problem for cognitive users.     

Low complexity hybrid power distribution combined with subcarrier allocation algorithm for OFDMA

To improve the total throughput of the uplink orthogonal frequency division multiple access system,a low complexity hybrid power distribution(HPD) combined with subcarrier allocation scheme is proposed.For the fairness mechanism for the subcarrier,the inter-cell interference is first analyzed to calculate the capacity of the multi-cell.The user selects the subcarrier with the largest channel gain.Based on the above subcarrier allocation scheme,a new kind of HPD scheme is proposed,which adopts the waterfilling-power-distributed scheme and the equal-power-distributed scheme in the cell-boundary and the cellcenter,respectively.Simulation results show that compared with the waterfilling-power-distributed scheme in the whole cell,the proposed HPD scheme decreases the system complexity significantly,meanwhile its capacity is 2% higher than that of the equal-powerdistributed scheme over the same subcarrier allocation.     

Energy efficient resource allocation in non-cooperative multi-cell OFDMA systems

A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access(OFDMA) system.The objective is to raise the spectral efficiency of the system and prolong the life time of user nodes.This paper defines a game player as a cell formed by the unique base station and the served users.The utility function considered here measures the user’s achieved utility per power.Each individual cell’s goal is to maximize the total utility of its users.To search the Nash equilibrium(NE) of the game,an iterative and distributed algorithm is presented.Since the NE is inefficient,the pricing of user’s transmission power is introduced to improve the NE in the Pareto sense.Simulation results show the proposed game outperforms the water-filling algorithm in terms of fairness and energy efficiency.Moreover,through employing a liner pricing function,the energy efficiency could be further improved.     

AF-OFDM非对称通信双向中继系统能效优化

针对具有非对称通信需求的单中继协同放大转发正交频分复用(amplify forward orthogonal frequency division multiplexing,AF-OFDM)双向中继系统,提出一种中继能效优化策略。在AF-OFDM双向非对称中继通信系统中,子载波有两种工作模式:单向中继传输和双向中继传输。以系统能效为优化目标,构建联合中继传输模式选择、功率分配和比特加载组合优化模型;采用结构近似优化算法,首先固定子载波分配集合,优化单向中继传输和双向中继传输的功率分配,将原优化问题分解为两个子优化问题求解,然后优化子载波分配集合,利用子载波配对形成的线性结构搜索双向中继传输的最佳子载波数,避免穷举搜索造成的大运算量。仿真结果表明,该能效优化策略能有效提高AF-OFDM双向非对称中继通信系统的能量效率。     

Heuristic based data scheduling algorithm for OFDMA wireless network

A system model based on joint layer mechanism is formulated for optimal data scheduling over fixed point-to-point links in OFDMA ad-hoc wireless networks. A distributed scheduling algorithm （DSA） for system model optimization is proposed that combines the randomly chosen subcarrier according to the channel condition of local subcarriers with link power control to limit interference caused by the reuse of subcarrier among links. For the global fairness improvement of algorithms, a global power control scheduling algorithm （GPCSA） based on the proposed DSA is presented and dynamically allocates global power according to difference between average carrier-noise-ratio of selected local links and system link protection ratio. Simulation results demonstrate that the proposed algorithms achieve better efficiency and fairness compared with other existing algorithms.     

基于SC-FDMA的可调公平度动态子载波分配算法

高速无线数据传输利用自适应的资源分配方式以对抗无线传输环境的不利影响。基于单载波频分复用系统提出一种最大平均容量动态子载波分配算法,并在此算法基础上引入公平系数,提出一种公平度可调的动态子载波分配算法,以实现系统分配公平性与总容量性能之间的权衡。仿真结果表明,最大平均容量算法在显著降低算法复杂度的同时,能获得与贪婪算法相近的系统总容量及误码率性能。可调公平度算法通过调整公平系数,能在较大范围内调整信道资源分配的公平度,满足不同传输质量需求,且不增加算法复杂度。     

一种基于剩余能量的无线网络资源分配算法研究

针对采用网状网模式组网的WMAN中,提出一种由移动站电量余量决定的分配优先级的系统带宽分配算法,按需分配网络资源并提高网络整体性能问题。通过提高重要节点收发数据时的时间集中度,降低重要节点收发数据时的功率消耗,较大程度降低了重复迭代计算的算法复杂度。该算法可以通过启发式分配等效可分配时间和发射功率来优化系统的资源分配,亦还可以通过改变效用函数的斜度参数满足不同的业务特性。     

MC-NOMA增强型反向散射网络中的谱能效率均衡优化

环境信号的不确定性导致不可预测的谱能机会.传输机会和能源供应的缺乏给反向散射通信网络的多址接入设计带来了极大的挑战.本文针对多载波非正交多址接入(multicarrier non-orthogonal multiple ac-cess,MC-NOMA)增强型反向散射网络,提出了一种分阶段优化算法实现均衡调控下的谱能效率...     

802.11ax系统中基于OFDMA调度接入的公平性资源分配算法

针对802.11ax系统中基于正交频分多址接入(orthogonal frequency division multiple access, OFDMA)调度接入的上行多用户传输链路, 提出了基于能量效率的公平性子信道匹配和功率分配算法。根据基于能量效率的上行链路模型, 提出资源块(resource unit, RU)数量确定算法和独立子信道匹配与功率分配算法; 进而针对独立分配中频谱利用不足和功率分配不合理的问题, 提出改进的联合子信道和功率迭代分配算法, 通过应用广义分式规划, 改写约束条件并在目标函数中加入惩罚项来松弛整型变量, 进一步用序列凸规划(sequential convex programming, SCP)来求解。仿真结果表明, 通过独立和联合迭代分配功率和子信道, 系统中用户的能量效率相对原有算法得到提升的同时兼顾了用户间的公平性。     

基于用户QoS的MIMO/OFDM系统资源分配研究

在多用户、多天线环境下的正交频分复用(OFDM)系统中,提出一个低复杂度的自适应资源分配方案。包括自适应子载波分配、功率分配以及波束成型等。目的就是在保障各用户的服务质量要求(QoS)(即包括传输速率和比特误码率(BER)要求)的同时,最小化总的发射功率。利用随机矩阵和排序统计的理论知识,进行详细的性能分析。理论分析和仿真试验都表明,该方案可以有效地保障用户的QoS,并提高系统的整体性能。最后,仿真结果也验证了理论分析的正确性。     

云计算环境中SBS应用动态资源分配方法

建立了一个SBS（基于服务的系统，service based system）应用端到端性能评价模型，并在该模型的基础上提出了SBS应用动态资源分配方法，该方法通过将静态的初始资源分配和动态的资源分配方案调整相结合，能够适应用户访问行为的动态变化，保证SBS应用端到端性能. 在SBS应用动态资源分配问题求解中，提出了服务吞吐量约束确定算法并在此基础上 给出了SBS应用动态资源分配算法，该算法根据SBS应用吞吐量约束确定服务资源需求量并在此基础上通过起始服务 到服务间的转移时间计算服务的资源分配时刻，从而能够在保证SBS应用端到端性能约束的同时提高资源利用率. 实验验证了所提出的基于SBS应用端到端性能评价模型的动态资源分配方法的有效性.     

用多能工应对需求波动的混流装配线平衡问题

在混流装配线中,需求波动会造成工位负荷的变化并可能产生过载,利用多能工协助装配是解决过载问题的常见方法.多能工的引入会改变装配线平衡的约束,同时平衡方案也会影响应对需求波动所需的多能工数量,然而现有的平衡研究还没有讨论过多能工带来的影响.本文研究了使用多能工应对需求变化的混装线平衡问题,决策者需要决定多能工和普通工人的数量及任务分配.以最小化人工成本并满足不同情境的需求.文章建立了数学模型,分析了问题的复杂性和成本下界,并提出了启发式和精确算法来求解,最后使用数值实验证明了算法的有效性.     

面向用户需求的空天地一体化车载网络任务分配策略

为了提高空天地一体化车载网络(space-air-ground integrated vehicular networks, SAGVN)内用户的网络服务质量体验, 解决不同网络间相互协同的问题, 提出了面向用户需求的SAGVN任务分配策略。基于用户信号强度、时延、网络费用和带宽需求, 利用效用函数理论和层次分析法(analytic hierarchy process, AHP), 构建用户需求和满意度描述框架。将网络任务分配过程抽象为半马尔可夫决策过程(semi Markov decision process, SMDP), 根据用户需求和网络状态, 利用价值迭代算法获得整体用户满意度最大的网络任务分配策略, 利用Q-learning算法得到近似最优策略。实验表明, 相较于传统策略, 所提策略整体用户满意度提高超过30%;在网络拥塞的环境下, 可以有效降低对网络服务需求迫切用户服务请求的拒绝率。     

面向战场多任务网络的等级优先动态带宽分配

为实现空中信息分发平台对战场多任务网络带宽资源的有效管理,在战术互联网资源管理模型中,提出一种等级优先动态带宽分配（classification prioritized dynamic bandwidth allocation,CPDBA）算法。该算法改进了基于网络效能最大化的带宽分配方法,优化了对指数效能业务的调度策略。仿真结果表明,该算法不但能够使相同带宽资源产生更高的任务价值,而且在网络过载时可以确保高优先级业务的服务质量,从而有效解决了多任务网络的链路带宽竞争问题。     

云边协同系统中基于博弈论的资源分配与任务卸载方案

综合考虑时延、能耗和计算资源成本，构建云边协同系统中的效用最大化问题，并将其分解为计算资源分配、上行功率分配和任务卸载策略三个子问题。提出一种基于博弈论的资源分配和任务卸载方案（game-based resource allocation and task offloading， GRATO） 以分别解决上述子问题。利用凸优化条件求得计算资源分配最优解；设计一种低复杂度的上行功率分配方法用于降低无线干扰；针对任务卸载策略优化问题，提出一种基于博弈论的分布式任务卸载算法（game-based distributed task offloading algorithm， GDTOA）。仿真结果表明，GRATO方案在时延和能耗方面的性能优于其他方案，还可以感知用户的优先级，使紧急用户具有更高的效用和更低的时延。     

Membrane-inspired quantum shuffled frog leaping algorithm for spectrum allocation

To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping(MQSFL) algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane computing and quantum computing to the shuffled frog leaping algorithm,which is an effective discrete optimization algorithm.Then the proposed MQSFL algorithm is used to solve the spectrum allocation problem of cognitive radio systems.By hybridizing the quantum frog colony optimization and membrane computing,the quantum state and observation state of the quantum frogs can be well evolved within the membrane structure.The novel spectrum allocation algorithm can search the global optimal solution within a reasonable computation time.Simulation results for three utility functions of a cognitive radio system are provided to show that the MQSFL spectrum allocation method is superior to some previous spectrum allocation algorithms based on intelligence computing.