基于资源池的测控设备动态集中管理

为满足日益增长的航天测控任务需求,采用基于资源池的测控设备动态集中管理,可以有效降低投入成本,提高系统的可靠性和资源利用率。介绍了我国传统测控系统体系架构,从优化传统测控站的资源利用率角度入手,提出了基于资源池的测控设备动态集中管理,分析了其功能需求,论述了关键技术问题,为实施基于资源池的测控设备动态集中管理提供了一定参考。     

低轨预警系统动态任务规划启发式算法

该文针对低轨预警系统任务动态规划需求,从预警传感器资源和导弹跟踪任务角度对低轨预警系统动态任务规划问题进行了形式化描述,建立了系统动态任务规划的动态约束满足问题模型。该模型包括两级优化目标跟踪精度、资源利用率、传感器切换率、松弛度综合优化指标和方案调整幅度(调整率)指标;提出了求解动态规划问题的变邻域启发式搜索算法,设计了算法的直接插入、重新分配、替换和删除邻域结构及算子。通过仿真实验验证了基于梯度优化目标的动态规划模型的合理性,并说明启发式算法能有效求解低轨预警系统动态任务规划问题。     

复杂真实约束条件下的多星测控资源调度

测控资源调度是卫星调度研究领域的关键问题之一,其在多星条件下面临着因约束信息来源不同、结构差异大、表达模糊而难以建立统一的约束模型,以及求调度问题的最优解是NP-hard的且不易得到较优解的问题。为此,首先将多星测控问题表达为组合优化模型,再将复杂的约束信息归纳为一套约束,最后提出了一种双层并行约束匹配算法求解问题。与用户现有算法对比,所提算法的周期测控调度成功率提升了9%左右,且可以处理更多约束信息类型。     

WDM格型光网络中的动态组播共享保护算法

该文针对WDM格型网络中单链路失效的情况,提出了一种保护动态组播业务的基于路径的优化共享保护(PB-OSPM)算法。该算法在基于最优路径对的共享不相交路径(OPP-SDP)算法的基础上,通过引入保护波长使用情况矩阵和波长预留矩阵记录预留波长资源的使用情况,允许不发生冲突的不同组播的保护路径间共享预留波长资源。研究采用欧洲光网络(EON)的拓扑对PB-OSPM算法和OPP-SDP算法在增性网络负载情况下的网络冗余度和同波长资源配置和网络负载情况下动态网络负载的网络连接阻塞率做了仿真。结果表明,相同条件下,PB-OSPM算法比OPP-SDP算法有更低的连接阻塞率。组播业务间波长资源的共享是提高波长资源利用率的有效方法。     

接入与回传一体化小基站的接入控制与资源分配联合优化算法

针对全双工无线接入与回传一体化小基站场景下长期的频谱效率和能效同时最大化问题,该文提出一种基于近似动态规划理论的接入与回传一体化小基站接入控制与资源分配联合优化算法。该算法首先联合考虑当前基站的资源使用和功率配置情况,在任一用户需求动态到达以及平均时延、小基站回传速率和传输功率约束下,使用受限马尔科夫决策过程(CMDP)建立频谱效率最大化和功率消耗最小化的多目标优化模型,其次运用切比雪夫理论将多目标优化问题转化为单目标问题,并使用拉格朗日对偶分解法进一步转化为非受限的马尔科夫决策过程(MDP)问题。最后,为了解决其求解时存在的“维度灾”爆炸问题,该文提出基于近似动态规划的无线接入与回传一体化小基站资源动态分配算法进行求解,得到此时的接入与资源分配策略。仿真结果表明,所提算法能在保证平均时延约束、小基站回传速率约束和传输功率约束的同时最大化长期平均频谱效率和能效。     

适于资源动态重组的测控设备体系结构

资源动态重组能够有效提高航天测控站的运行效益。介绍了我国传统测控设备的体系结构,从优化测控站总体设计的角度入手,设计了适应资源动态重组需求的测控设备的体系结构及其监控管理方式,提出了集中监控管理平台的概念,分析了其功能需求,讨论了需要重点关注的关键技术。所提出的体系结构可供该领域的设计、管理人员借鉴。     

基于多样本GA-PSO算法的发射入轨段测控设备优化部署

针对当前航天器发射入轨段地基测控设备部署中存在的效率不高、灵活性不足等问题,考虑最高仰角、地形遮蔽等约束条件,以定轨精度、测控覆盖、资源占用为优化目标,建立给定弹道下测控设备部署优化模型。提出基于多样本遗传-粒子群(Genetic-Particle Swarm Optimization, GA-PSO)算法的发射入轨段测控设备部署优化方法,通过目标权重自适应变换和一定强度的蒙特卡洛仿真实验获取Pareto最优解集,统计分析确定全局最优解。仿真结果表明,该方法可进一步提高发射入轨段定轨精度和测控覆盖率,减少设备冗余,为测控方案制定提供有效数据参考。     

WDM光网络中基于链路的动态组播共享保护算法

针对WDM光网络中单链路失效的情况,提出了一种基于链路的保护动态组播业务的优化共享保护算法(Link-based optimized shared-protection algorithm for multicast sessions,LB-OSPM).该算法在对工作树任意光纤链路失效情况寻找保护路径时,允许组播内不同保护路径共享预留波长资源,同时通过引入预留波长使用情况矩阵和波长预留矩阵记录预留波长资源的使用情况,实现了不发生冲突的不同组播的保护链路间共享预留波长资源.研究采用欧洲光网络(European Optical Network,EON)的拓扑对不同波长资源配置和网络负载情况下LB-OSPM算法的网络连接阻塞率做了仿真.结果表明,通过引入共享机制,LB-OSPM算法在对单链路失效保证100％恢复率的同时可以获得更低的连接阻塞率,提高了波长资源利用效率.     

多编组任务分配动态优化模型及IVFSA算法求解

针对作战智能体多编组协同作战中任务分配的动态优化问题, 考虑到空中突击作战中部分任务的时间窗口属性和编组资源能力损耗的特点, 建立了以任务执行效率为目标、满足上述约束问题的数学模型。设计了一种改进快速模拟退火对动态优化模型予以求解, 给出解方案表达、邻域解生成、冲突消解等步骤, 采用高温随机贪婪搜索、回火技术、禁忌设计和精英保留策略, 避免算法陷入局部最优, 提高算法的计算效率。仿真表明, 所提方法可对多编组任务分配动态优化模型进行快速有效求解。     

基于无线供能反向散射通信系统安全性的稳健机会约束优化算法设计

针对无线供能反向散射通信系统中信道不确定性以及安全性问题,提出一种考虑系统安全性的稳健机会约束优化算法.首先,在考虑窃听数据传输速率约束、最小能量收集约束和设备反射率约束条件下,建立一个基于信道不确定性的最大化系统传输速率最小值的优化问题.为求解该问题,应用基于伯恩斯坦型不等式的安全近似方法,将原不确定性问题转换为确定...     

一种基于先验信息的中高轨卫星遥测任务资源调度方法

中高轨卫星测控需求的特性导致遥测数据接收任务占用了绝大部分设备跟踪时长,但遥测任务的资源调度问题的相比遥控和测轨复杂性更高,使得其资源调度算法的自动化水平一直不高。根据中高轨卫星遥测数据接收任务需求和我国测控站布站情况,设计了一种基于先验信息的中高轨卫星遥测任务资源调度算法。该算法以中高轨卫星遥测任务需求整体满足率最大和算法复杂度最低为设计目标,以人工安排中高轨遥测任务测控工作计划积累的有益经验作为先验信息,赋予中高轨卫星遥测任务可行解优先级使用值。通过实际数据仿真分析,该算法极大缩小了中高轨卫星遥测任务可行解空间规模,有效提高了资源调度效率,资源满足率达到99.7%以上,遥测单收设备使用率超过97.7%,为卫星资源调度算法设计提供了参考。     

Graph‐based resource allocation algorithms for multiuser downlink MIMO‐OFDMA networks

Multiuser multiple‐input multiple‐output orthogonal frequency division multiple access (MIMO‐OFDMA) is considered as the practical method to attain the capacity promised by multiple antennas in the downlink direction. However, the joint calculation of precoding/beamforming and resource allocation required by the optimal algorithms is computationally prohibitive. This paper proposes computationally efficient resource allocation algorithms that can be invoked after the precoding and beamforming operations. To support stringent and diverse quality of service requirements, previous works have shown that the resource allocation algorithm must be able to guarantee a specific data rate to each user. The constraint matrix defined by the resource allocation problem with these data rate constraints provides a special structure that lends to efficient solution of the problem. On the basis of the standard graph theory and the Lagrangian relaxation, we develop an optimal resource allocation algorithm that exploits this structure to reduce the required execution time. Moreover, a lower‐complexity suboptimal algorithm is introduced. Extensive simulations are conducted to evaluate the computational and system‐level performance. It is shown that the proposed resource allocation algorithms attain the optimal solution at a much lower computational overhead compared with general‐purpose optimization algorithms used by previous MIMO‐OFDMA resource allocation approaches. Copyright © 2012 John Wiley & Sons, Ltd.     

毫微微小区中一种基于分组的资源分配方法

为有效解决毫微微小区间( Femtocell)干扰,采用分布式方式对毫微微小区进行资源管理。首先,对毫微微接入点( FAPs)进行分组。基于Lingo数学建模的思想,提出了一种解决分组优化问题的算法。该算法在使用分支定界算法寻找最优解的同时,通过建立单纯形表剪去偏离最优解方向的分支;其次,每组选择一个簇头为本组内FAPs分配资源,为此,提出了新的子信道分配方法,该方法根据干扰指示矩阵修正子信道分配的情况。仿真结果表明：和其他算法相比,提出的算法不仅能找到分组优化问题的最优解,并且效率更高;另外,提出的资源分配算法不仅减小了用户间干扰,而且提高了户间速率公平。     

A joint resource optimization and adaptive modulation framework for uplink single‐carrier frequency‐division multiple access systems

In this paper, we study joint resource allocation and adaptive modulation in single‐carrier frequency‐division multiple access systems, which is adopted as the multiple access scheme for the uplink in the 3GPP Long Term Evolution standard. We formulate an adaptive modulation and sum‐cost minimization (JAMSCmin) problem. Unlike orthogonal frequency‐division multiple access, in addition to the restriction of allocating a subchannel to one user at most, the multiple subchannels allocated to a user in single‐carrier frequency‐division multiple access systems should be consecutive as well. This renders the resource allocation problem prohibitively difficult and the standard optimization tools (e.g., Lagrange dual approach widely used for orthogonal frequency‐division multiple access, etc.) cannot help towards its optimal solution. We propose a novel optimization framework for the solution of this problem that is inspired from the recently developed canonical duality theory. We first formulate the optimization problem as binary‐integer programming (BIP) problem and then transform this BIP problem into continuous space canonical dual problem that is the concave maximization problem. Based on the solution of the canonical dual problem, we derive joint resource allocation and adaptive modulation algorithm, which has polynomial time complexity. We provide conditions under which the proposed algorithm is optimal. We compare the proposed algorithm with the existing algorithms in the literature. The results show a tremendous performance gain. Copyright © 2013 John Wiley & Sons, Ltd.     

Robust resource allocation for NOMA-assisted heterogeneous networks

As a promising technology to improve spectrum efficiency and transmission coverage, Heterogeneous Network (HetNet) has attracted the attention of many scholars in recent years. Additionally, with the introduction of the Non-Orthogonal Multiple Access (NOMA) technology, the NOMA-assisted HetNet cannot only improve the system capacity but also allow more users to utilize the same frequency band resource, which makes the NOMA-assisted HetNet a hot topic. However, traditional resource allocation schemes assume that base stations can exactly estimate direct link gains and cross-tier link gains, which is impractical for practical HetNets due to the impact of channel delays and random perturbation. To further improve energy utilization and system robustness, in this paper, we investigate a robust resource allocation problem to maximize the total Energy Efficiency (EE) of Small-Cell Users (SCUs) in NOMA-assisted HetNets under imperfect channel state information. By considering bounded channel uncertainties, the robust resource optimization problem is formulated as a mixed-integer and nonlinear programming problem under the constraints of the cross-tier interference power of macrocell users, the maximum transmit power of small base station, the Resource Block (RB) assignment, and the quality of service requirement of each SCU. The original problem is converted into an equivalent convex optimization problem by using Dinkelbach's method and the successive convex approximation method. A robust Dinkelbach-based iteration algorithm is designed by jointly optimizing the transmit power and the RB allocation. Simulation results verify that the proposed algorithm has better EE and robustness than the existing algorithms.     

基于补偿式CSI的分布式跨层联合资源分配算法

为消除过时信道状态信息(CSI)对分布式无线多跳网络环境下跨层资源分配效率的影响,提高跨层联合资源分配的准确性,基于信道相关性提出了一种补偿式跨层联合资源分配算法。利用瞬时和过时信道状态信息之间的条件概率密度函数,基于瑞利衰落信道模型求得信噪比(SINR) 模型下条件容量的闭式解。为补偿部分网络性能的损失,提出了一种考虑过时信道状态信息的联合拥塞控制、信道分配和功率控制的算法,在此过程中网络被建模成一个NUM 问题,可变的链路数据率和功率等资源限制作为约束条件。运用拉格朗日对偶分解技术,NUM问题被分布式求解。实验对比分析表明：在确保较低复杂度的前提下,该算法有效改善了分布式多跳网络资源分配的合理性,使其网络总体效用得到提升,降低了能耗。     

Study on distributed and dynamic resource management for delay-sensitive sensor network

The delay-aware dynamic resource management problem was investigated in sensor network,with a focus on resource allocation among the sensors and power control along the time.By taking account of average delay requirements and power constraints,the considered problem was formulated into a stochastic optimization problem.Inspired by Lyapunov optimization theory,the intractable stochastic optimization problem was transformed into a tractable deterministic optimization problem,which was a mixed-integer resource management problem.By exploiting the specific problem structure,the mixed-integer resource management problem was equivalently transformed into a single variable problem,and the cooperative distributed method was present to effectively solve it with guaranteed global optimality.Finally,a dynamic resource management algorithm was proposed to solve the original stochastic optimization problem.Simulation results show the performance of the proposed dynamic algorithm and reveal that there exists a fundamental tradeoff between delay requirements and power consumption.     

基于深度强化学习的反向散射网络资源分配机制

为了提升反向散射网络中物联网设备的平均吞吐量,提出了一种资源分配机制,构建了用户配对和时隙分配联合优化资源分配模型。由于该模型直接利用深度强化学习(Deep Reinforcement Learning,DRL )算法求解导致动作空间维度较高且神经网络复杂,故将其分解为两层子问题以降低动作空间维度：首先,基于深度强化学习算法,利用历史信道信息推断当前的信道信息以进行最优的用户配对;然后,在用户固定配对的情况下,基于凸优化算法,以最大化物联网设备总吞吐量为目标进行最优的时隙分配。仿真结果表明,与其他资源分配方法相比,所提资源分配方法能有效提升系统吞吐量,且有较好的信道适应性和收敛性。