D2D网络中信道选择与功率控制策略研究

针对D2D通信的资源分配问题,该文研究了D2D信道选择与功率控制策略。在保证蜂窝用户服务质量(QoS)的前提下,提出一种基于启发式的D2D信道选择算法,为系统内的D2D用户找到合适的信道复用资源。同时,利用拉格朗日对偶方法求解得到D2D用户最优传输功率。仿真结果表明当蜂窝用户与多对D2D用户共享信道资源时能够大幅度提升系统平均吞吐量。在相同条件下,该算法的性能要明显优于现有算法。     

基于时延优化的蜂窝D2D通信联合用户关联及内容部署算法

针对蜂窝网络传输性能及基站(BS)缓存能力受限,多用户内容请求难以满足用户服务质量(QoS)需求等问题,该文提出一种蜂窝终端直通(D2D)通信联合用户关联及内容部署算法。考虑到位于特定区域的多用户可能对于相同内容存在内容请求,该文引入成簇思想,提出一种成簇及内容部署机制,通过为各簇头推送热点内容,而簇成员基于D2D通信模式关联簇头获取所需内容,可实现高效内容获取。综合考虑成簇数量、用户关联簇头、簇头缓存容量及传输速率等限制条件,建立基于用户总业务时延最小化的联合成簇及内容部署优化模型。该优化问题是一个非凸的混合整数优化问题,该文运用拉格朗日部分松弛法,将原优化问题等价转换为3个凸优化的子问题,并基于迭代算法及Kuhn-Munkres算法联合求解各子问题,从而得到联合成簇及内容部署优化策略。最后通过MATLAB仿真验证所提算法的有效性。     

LTE-A网络中D2D通信的资源分配算法研究

该文研究了D2D通信使用LTE-A网络上行链路的资源分配问题。首先将问题建模为混合整数非线性规划问题(MINLP),其次根据待接入用户对各信道的青睐程度计算特征值列表并形成相应联盟。在保证各用户服务质量(QoS)的情况下,利用最大加权二部图匹配(MWBM)方法为待接入网络用户寻找合适的资源及复用的组合。仿真结果表明,该算法打破了D2D用户在数据传输过程中一直处于专用或者复用模式的束缚,扩大了D2D用户对可选用的资源范围,与现有算法相比,可有效提高系统的总速率。     

协助D2D通信的波束赋形算法设计

文章考虑下行链路D2D通信对复用同小区的蜂窝资源,不同于传统的基于总功率约束的赋形策略,我们提出了基于单根天线功率约束的波束赋形策略。TD-LTE系统采用的是时分双工,上下行信道具有互易性,因此通过对上行信道信息的获取,可以得到下行信道的信道状态信息(Channel Station Information,CSI),从而有效地实现波束赋形。在CSI已知的情况下,我们提出了一种高效的算法寻找最优的波束赋形策略,使得经典的基于最大最小信干比的问题能够被重写为标准的二阶锥规划(SCOP),从而使最优的目标能够通过标准的二阶锥规划求解器求解。同时,为了减少由于D2D通信对加入给蜂窝网络带来的干扰,一种D2D状态搜索算法被提出,它能够选择最优的D2D通信对加入蜂窝网络中,使得系统的吞吐量得到提升。     

基于非均衡求解的D2D多复用通信资源块分配算法研究

针对小区内D2D多复用的通信资源块分配问题,该文以一个D2D用户分别复用2个和3个蜂窝为基础,提出基于非均衡求解的D2D多复用模式下的资源块分配方案。利用博弈论将资源块划分问题转化为求解被复用蜂窝用户收益联合最大问题。当纳什均衡解不存在时,分析目标函数特性,在可行域内求解“最优解”,保证对不均衡解处理的最优性;对于均衡解存在的情况,将其取整后作为资源分配方案依据,保持其最优性。通过理论分析及仿真实验表明该算法可以提升系统吞吐率,提高小区通信性能。     

D2D通信中联合链路共享与功率分配算法研究

针对D2D （Device-to-Device,D2D）通信过程中的资源分配问题,提出一种联合链路共享和功率分配算法.在保证系统内蜂窝用户服务质量（Quality of Service,QoS）需求的前提下,利用系统的信道状态信息,为D2D用户生成一个由蜂窝用户组成的通信链路的候选集合;在通信链路候选集合内使用凸优化方法得到D2D用户最优功率分配策略;最后利用（Kuhn-Munkres,KM）算法求解最大加权二部图匹配（Maximum Weight Bipartite Matching,MWBM）问题,为D2D用户选择最优的蜂窝用户进行资源共享.仿真结果表明该算法能有效的提升通信网络的吞吐量,可以为D2D用户选择最优的资源分配策略.     

基于不完美CSI的D2D通信网络鲁棒能效资源分配算法

针对设备到设备(D2D)直连通信网络传统最优资源分配算法在随机信道时延、信道估计误差影响下鲁棒性弱的问题,该文在考虑参数不确定性影响的条件下,提出D2D用户总能效最大的鲁棒资源分配算法。考虑干扰功率门限、用户最小速率需求、最大传输功率和子信道分配约束,建立了下垫式频谱共享模式下多用户D2D网络资源分配模型。基于有界信道不确定性模型,利用最坏准则方法将原非凸鲁棒资源分配问题转换为确定性的凸优化问题。然后利用拉格朗日对偶理论求得资源分配的解析解。仿真结果表明所提出的算法具有很好的鲁棒性。     

基于不完美CSI的D2D通信网络鲁棒能效资源分配算法

针对设备到设备(D2D)直连通信网络传统最优资源分配算法在随机信道时延、信道估计误差影响下鲁棒性弱的问题,该文在考虑参数不确定性影响的条件下,提出D2D用户总能效最大的鲁棒资源分配算法.考虑干扰功率门限、用户最小速率需求、最大传输功率和子信道分配约束,建立了下垫式频谱共享模式下多用户D2D网络资源分配模型.基于有界信道不确定性模型,利用最坏准则方法将原非凸鲁棒资源分配问题转换为确定性的凸优化问题.然后利用拉格朗日对偶理论求得资源分配的解析解.仿真结果表明所提出的算法具有很好的鲁棒性.     

中继协同D2D通信的能效优化

针对D2D中继通信中D2D设备电池容量受限问题,本文提出了一种逐步优化功率控制和中继选择从而最大化系统能量效率的方法。首先,在满足蜂窝链路最小数据速率的条件下,将功率控制问题建模为一个非线性规划问题,并求解出D2D发射机的最优发射功率;然后,分别利用发送节点与接收节点的邻域为半径建立节点均匀分布的球状模型;其次,基于路径损耗相似性对节点进行k-means迭代聚类,并得到路径损耗最小节点的质心;最后,将得到的质心作为中继节点进行D2D中继通信。仿真结果表明,在保证高质量通信的条件下,本文提出的优化方法能够最大化系统的能量效率。      

全负载蜂窝网络下多复用D2D通信功率分配算法研究

针对全负载蜂窝网络中D2D通信的功率分配问题,该文提出了一种基于非合作完全信息博弈纳什均衡解的多复用D2D通信功率分配算法。以优先保证蜂窝用户通信质量与D2D用户接入率为前提,设置D2D通信系统上行链路帧结构,之后建立非合作完全信息博弈系统模型,引入定价机制到功率分配博弈模型中并分析纳什均衡解的存在性与唯一性,最后给出该模型的分布式迭代求解算法。仿真结果表明,随着D2D用户复用数量的增加,该算法在提升系统吞吐量的同时,能有效地控制系统内部干扰,大幅度降低系统总能耗。     

Multi-cell Optimal Downlink Beamforming Algorithm with Per-base Station Power Constraints

We consider a problem of optimizing multi-cell downlink throughput in multiple-input single-output (MISO) beamforming with single user per sub-channel in the wireless communication system. Previous work based on the generalization of uplink-downlink duality has already reformulated the maximum achievable downlink throughput into dual uplink throughput maximization problem. Since the dual uplink problem is nonconvex, it is difficult to find its optimal solution. The main contribution of this paper is a novel practical algorithm based on heuristic to find the solution of beamforer design satisfying the necessary optimality conditions of the dual uplink problem. Meanwhile the converged beamforming vectors can in turn improve the system sum rate significantly. As the dual problem is a mixed optimization, we also provide algorithms for its two sub-optimal problems. Simulation results validate the convergence and the efficiency of proposed algorithms.     

一种基于GNC和增广拉格朗日对偶的非凸非光滑图像恢复方法

逐步非凸方法（GNC）和增广拉格朗日对偶在非凸非光滑图像恢复中有较高的恢复性能.然而分别使用这两种方法时GNC不能够保证全局收敛,增广拉格朗日对偶不能获得有效的初始值.为克服上述缺陷,本文通过转换原始问题为等式约束优化问题推出了一种基于GNC和增广拉格朗日对偶的组合图像恢复方法,并对其收敛性严格证明.该方法不仅可以获得有效的初始值,同时不要求问题具有凸性和光滑性.更多地,一个自适应能量函数通过对偶迭代而得到.实验结果表明推出的方法可以有效地提高图像恢复质量和算法效率.     

Dual methods for nonconvex spectrum optimization of multicarrier systems

The design and optimization of multicarrier communications systems often involve a maximization of the total throughput subject to system resource constraints. The optimization problem is numerically difficult to solve when the problem does not have a convexity structure. This paper makes progress toward solving optimization problems of this type by showing that under a certain condition called the time-sharing condition, the duality gap of the optimization problem is always zero, regardless of the convexity of the objective function. Further, we show that the time-sharing condition is satisfied for practical multiuser spectrum optimization problems in multicarrier systems in the limit as the number of carriers goes to infinity. This result leads to efficient numerical algorithms that solve the nonconvex problem in the dual domain. We show that the recently proposed optimal spectrum balancing algorithm for digital subscriber lines can be interpreted as a dual algorithm. This new interpretation gives rise to more efficient dual update methods. It also suggests ways in which the dual objective may be evaluated approximately, further improving the numerical efficiency of the algorithm. We propose a low-complexity iterative spectrum balancing algorithm based on these ideas, and show that the new algorithm achieves near-optimal performance in many practical situations.     

Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems

The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing the optimum solution through exact algorithms to this problem appears to be unrealistic considering the large scale nature and NP-hardness of the problem. Therefore, the solution algorithm strategy consists in computing effective lower and upper bounds for the problem. Lower bounds are evaluated through a Lagrangean relaxation technique and subgradient method. A Lagrangean heuristic is developed to compute upper bounds based on the Lagrangean solution. The bounds are improved through a customized branch and bound algorithm which takes in account specific knowledge of the problem to improve its efficiency. Thirty two random test instances are solved using the proposed algorithm and the CPLEX optimization package. The results show that the duality gap is excessive, so it cannot guarantee the quality of the solution. However, the proposed algorithm provides optimal or near optimal solutions for the problem instances for which CPLEX also provides the optimal solution. It further suggests that the proposed algorithm provides optimal or near optimal solutions for the other instances too. Finally, the results demonstrate that the proposed algorithm is superior to CPLEX as a solution approach for the CND problem.     

Multi-cell uplink-downlink beamforming throughput duality based on Lagrangian duality with per-base station power constraints

Despite significant research efforts in beamforming, the maximum achievable downlink throughput with beamforming in a multi-cell environment is not available due to difficulty in finding optimal downlink beamforming. Thus, to reformulate the problem into a more solvable form, we derive dual uplink throughput optimization problem to multi-cell downlink beam- forming throughput maximization with per-base station (BS) power constraints based on Lagrangian duality. The optimal downlink beamforming is shown to be a minimum mean squared error (MMSE) beamforming in the dual uplink. It is also shown that the dual uplink problem achieves the same optimal throughput as the primal downlink problem.     

Gradient flow approach to discrete-time envelope-constrained filterdesign via orthonormal filters

Using digital orthonormal filters and Lagrangian duality theory, the envelope-constrained (EC) filtering problem has been formulated as a dual quadratic programming (QP) problem with simple constraints. Applying the barrier-gradient and barrier-Newton methods based on the space transformation and gradient flow technique, two efficient design algorithms are constructed for solving this QP problem. An adaptive algorithm, based on the barrier-gradient algorithm, is developed to solve the EC filtering problem in a stochastic environment. The convergence properties are established in the mean and mean square error senses. To demonstrate the effectiveness of the proposed algorithms, a practical example using the Laguerre networks is solved for both the deterministic and stochastic cases     

Relax online resource allocation algorithms for D2D communication

Maximizing the system sumrate by sharing the resource blocks among the cellular user equipments and the D2D (device to device) pairs while maintaining the quality of service is an important research question in a D2D communication underlaying cellular networks. The problem can be optimally solved in offline by using the weighted bipartite matching algorithm. However, in long‐term evolution and beyond (4G and 5G) systems, scheduling algorithms should be very efficient where the optimal algorithm is quite complex to implement. Hence, a low complexity algorithm that returns almost the optimal solution can be an alternative to this research problem. In this paper, we propose 2 less complex stable matching–based relax online algorithms those exhibit very close to the optimal solution. Our proposed algorithms deal with fixed number of cellular user equipments and a variable number of D2D pairs those arrive in the system online. Unlike online matching algorithms, we consider that an assignment can be revoked if it improves the objective function (total system sumrate). However, we want to minimize the number of revocation (ie, the number of changes in the assignments) as a large number of changes can be expensive for the networks too. We consider various offline algorithms proposed for the same research problem as relaxed online algorithms. Through extensive simulations, we find that our proposed algorithms outperform all of the algorithms in terms of the number of changes in assignment between 2 successive allocations while maintaining the total system sumrate very close to the optimal algorithm.     

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.     

协作D2D异构网络的联合资源分配和功率控制

针对下行协作D2D(Device-to-Device)异构网络中复用蜂窝用户的联合资源分配和功率控制问题,提出了一种量子珊瑚礁优化算法(Quantum Coral Reef Optimization Algorithm,QCROA)。首先,构建异构网络模型并推导得到整个网络总吞吐量的数学表达式;其次,基于QCROA算法分析全局最优量子珊瑚的测量状态,提出最优联合资源分配和功率控制方案;最后,通过仿真验证QCROA算法的优越性。实验结果表明,在不同网络通信场景下,QCROA算法均表现出良好的适应性,其收敛速度和种群多样性均优于其他基于智能优化算法的方案,在迭代次数达到1 500次时即可获得吞吐量最高的全局最优。     

Resource Allocation and Adaptive Modulation in Uplink SC-FDMA Systems

In this paper, we study joint power and sub-channel allocation, and adaptive modulation in Single Carrier Frequency Division Multiple Access (SC-FDMA) which is adopted as the multiple access scheme for the uplink in the 3GPP-LTE standard. A sum-utility maximization problem is considered. Unlike OFDMA, in addition to the restriction of allocating a sub-channel to one user at most, the multiple sub-channels allocated to a user in SC-FDMA 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 OFDMA, etc.) can not help towards its optimal solution. We propose a novel optimization framework for the solution of this problem which is inspired from the recently developed canonical duality theory. We first formulate the optimization problem as binary-integer programming problem, and then transform this binary-integer programming problems into a continuous space canonical dual problem that is a concave maximization problem. Based on the solution of the continuous space dual problem, we derive joint power and sub-channel allocation algorithm whose computational complexity is polynomial. We provide conditions under which the proposed algorithms are optimal. We also propose an adaptive modulation scheme which selects an appropriate modulation strategy for each user. We compare the proposed algorithm with the existing algorithms in the literature to assess their performance. The results show a tremendous performance gain.