Clustering and scheduling methods based on SLNR in downlink CoMP system简

In downlink coordinated multi-point（CoMP） system, full cooperation is always not applicable in real world because of its high request in the backhaul. To deal with this problem, clustering decision is made to process transmission. In this paper clustering methods based on the metric signal-to-leakage-plus-noise（SLNR） is proposed. In addition, user scheduling schemes based on SLNR is also put up to make the scheduling set as large as possible. Simulation results show that the proposed clustering methods not only reduce the data sharing among the cooperating base stations（BSs）, but also improve the system throughput compared with the traditional clustering methods based on channel strength.     

AF中继下行链路系统的能效资源分配方案

为最大化放大转发中继系统的下行链路总能效,结合系统的电路功率,提出了一种基于能效的中继选择和功率分配联合方案.为降低复杂度,采用分步式次优化方案,利用虚拟直传信道增益得到中继选择方法,并将中继系统转换为单跳系统;然后利用凸规划得到最优功率分配.此外,为适应不同的用户分布,提出联合小区呼吸机制的分配方案.仿真结果表明,所提次优联合方案逼近最优值,联合小区呼吸的方案可适应不同的用户分布并进一步提升能效.     

Low complexity resource allocation and scheduling algorithms for downlink SDMA systems

The downlink zero-forcing beamforming strategy in the case of random packet arrivals is investigated. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. It has been shown that allocating resources to maximize a queue-length-weighted sum of the rates is a stabilizing policy. However, the high complexity of user selection and the feasible rates determination for optimal scheme may prevent the real-time scheduling operation. Two low complexity algorithms are provided taking the channel state, queue state and orthogonality into account. In particular, the authors pick the first user with the largest product between channel gain and queuing length, and select the remaining users to construct candidate user set based on the greedy user selection method or channel orthogonal user selection method. Then, the power and rate allocation for the selected users are implemented based on the modified water-filling method. The complexity of the proposed algorithms is analyzed. The average delay and average throughput are studied in homogeneous scenarios and heterogeneous scenarios, respectively. Simulation results show that the proposed algorithms can take full advantage of the multi-user diversity gain and provide average delay (or throughput) and fairness improvement compared with channel-aware-only schemes.     

一种基于多点协作的上行资源调度方式

介绍了基于多点协作的上行资源调度方式。从边缘用户与中心用户判定、无线资源分配模式选择、天线设置与接收数据处理和系统仿真结果四个方面进行了论述。重点分析了中心用户与边缘用户区分标准的设定和资源分配、频选模式的频选度量值设定以及多点协作方式的联合接收数据处理等问题。仿真结果表明,通过合理设置和调整系统的控制参数,多点协作可以有效地降低系统误码率、提升系统吞吐量。     

基于TG-PF的LTE-A中继蜂窝网络下行分层调度方法

设计了一种中继蜂窝网络的分层调度模型,将中继蜂窝小区的资源调度过程分为高层调度和低层调度两部分,分别由基站和中继站完成。所设计模型中,高层调度和低层调度分别采用PF算法和保障吞吐量的比例公平（TG-PF算法）,该算法充分利用了最大载干比（Max C/I）算法和比例公平（PF）算法的优势,能够有效地提升小区边缘的吞吐量,以满足中继蜂窝小区的系统吞吐量和调度公平性要求。仿真结果表明,所提方法能够以较低的调度公平性牺牲换取小区边缘吞吐量的较大提升。     

Cognitive radio network with coordinated multipoint joint transmission

Cognitive radio (CR) is considered to be a promising technology for future wireless networks to make opportunistic utilization of the unused or underused licensed spectrum. Meanwhile, coordinated multipoint joint transmission (CoMP JT) is another promising technique to improve the performance of cellular networks. In this paper, we propose a CR system with CoMP JT technique. We develop an analytical model of the received signal‐to‐noise ratio at a CR to determine the energy detection threshold and the minimum number of required samples for energy detection–based spectrum sensing in a CR network (CRN) with CoMP JT technique. The performance of energy detection–based spectrum sensing under the developed analytical model is evaluated by simulation and found to be reliable. We formulate an optimization problem for a CRN with CoMP JT technique to configure the channel allocation and user scheduling for maximizing the minimum throughput of the users. The problem is found to be a complex mixed integer linear programming. We solve the problem using an optimization tool for several CRN instances by limiting the number of slots in frames. Further, we propose a heuristic‐based simple channel allocation and user scheduling algorithm to maximize the minimum throughput of the users in CRNs with CoMP JT technique. The proposed algorithm is evaluated via simulation and found to be very efficient.     

针对突发事件应急决策和资源调度系统的实现

传统的应急决策和调度对突发事件地点周围的人员和物资信息不能及时充分掌握,不能第一时间做出决策方案的问题,面对这一问题,本文设计的系统旨在紧急突发事件发生后,快速参考对比相似案例,通过案例推理和规则推理算法分析得出最佳应急决策,通过决策进行资源的合理、便捷调度.     

MIMO下行链路中的多用户调度算法

针对采用随机波束成形的MIMO下行链路,提出了一种多用户调度算法。在接收端利用每个用户在各个波束方向上的比例公平性参数来得到容量门限。仿真结果显示,这种调度算法相比其他门限调度算法,在系统性能无明显损失的情况下,有效地减小了反馈量。     

多功能雷达系统资源管理与调度技术

针对多功能一体化相控阵雷达的资源管理与调度,对系统工作模式、约束条件进行了探讨。研究了一种多功能资源资源管理与调度技术,分析了在各种模式下系统资源分配、系统功能实现的状况以及高效、高速合成系统多任务所需的不同波束。     

Buffer-aware resource scheduling scheme for LTE-A uplink relay-assisted network

Due to the constraint of single carrier frequency division multiple access （SC-FDMA） adopted in long term evolution （LTE） uplink, subcarriers allocated to single user equipment （UE） must be contiguous. This contiguous allocation constraint limits resource allocation flexibility and makes the resource scheduling problem more complex. Most of the existing work cannot well meet UE＇s quality of service （QoS） requirement, because they just try to improve system performance mainly based on channel condition or buffer size. This paper proposes a novel resource scheduling scheme considering channel condition, buffer size and packet delay when allocating frequency resource. Firstly, optimization function is formulated, which aims to minimize sum of weight for bits still left in UE buffer after each scheduling slot. QoS is the main concern factor here. Then, to get packet delay information, this paper proposes a delay estimation algorithm. Relay node （RN） is introduced to improve overall channel condition. Specific RN selection strategy is also depicted in the scheme. Most important of all, a creative negotiation mechanism is included in the subcarrier allocation process. It can improve the overall system throughput performance in guarantee of user＇s QoS requirement. Simulation results demonstrate that the scheme can greatly enhance system performance like delay, throughput and jitter.     

An energy‐saving‐centric downlink scheduling scheme for WiMAX networks

This study proposes an energy‐saving‐centric downlink scheduling scheme to support efficient power utilization and to satisfy the QoS requirements. The base station considers the queue lengths of mobile stations with real‐time and non‐real‐time connections and considers their QoS requirements to determine the sleeping parameters when the mobile stations issue sleep requests. The proposed scheme appropriately reschedules the sleep‐requesting mobile station to transmit its queued packets for optimal power‐saving efficiency. The QoS requirement is considered as the constraint during traffic rescheduling. The treatment of real‐time connections generally requires a trade‐off of the delay requirement and the longer sleep window, and the non‐real‐time connections must concern the packet drop and minimum data rates when performing the energy‐centric scheduling. Two rescheduling algorithms, that is, whole and partial reschedules, are proposed and analyzed in this paper. The whole‐reschedule scheme provides improved energy‐saving performance at the cost of tolerable longer delay and computing complexity when compared with the partial‐reschedule scheme. Our simulation results indicated that both schemes not only guarantee the desired QoS but also achieve superior energy‐saving efficiency to that of traditional scheduling. Copyright © 2012 John Wiley & Sons, Ltd.     

Coalition-based downlink resource allocation for LTE system with divide-and-conquer approach

To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users,it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers,bits,and power.Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way,which brings about high computational complexity and makes it impractical for real system.Therefore,a coalitional game framework for downlink multi-user resource allocation in long term evolution(LTE) system is proposed,based on the divide-and-conquer idea.The goal is to maximize the overall system data rate under the constraints of each user’s minimal rate requirement and maximal transmit power of base station while considering the fairness among users.In this framework,a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users.The total computational complexity is greatly reduced in comparison with conventional methods.The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness,compared to maximal rate and max-min schemes.     

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

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

Joint downlink and uplink resource allocation for multi-carrier SWIPT system

A multi-carrier simultaneous wireless information and power transfer (SWIPT) communication system including one base station (BS) and one user was investigated,where both uplink and downlink adopt orthogonal frequency division multiplexing (OFDM).In the downlink,the BS transmited information and power to the user simultaneously.In the uplink,the user transmited information to the BS by using the power harvested from the BS in the downlink.The weighted sum of the downlink and uplink achievable rates by jointly optimizing subcarrier allocation and power allocation of the uplink and downlink were aimed to maximized.An optimal algorithm to solve the joint resource allocation problem was proposed,which was based on the Lagrange duality method and the ellipsoid method.Finally,the result shows the performances of the proposed algorithm by computer simulations.     

Joint scheduling and mapping in support of downlink fairness and spectral efficiency in ieee 802.16e OFDMA system

The next generation broadband wireless networks deploy orthogonal frequency division multiple access (OFDMA) as the enabling technologies for broadband data transmission with QoS capabilities. In such broadband wireless systems, one major issue is how to utilize radio resource efficiently while maintaining fairness between sessions as well as providing adequate QoS. In this work, we propose an approach for OFDMA/time division duplex (TDD) downlink suitable for IEEE802.16e WiMAX systems that combines scheduling and burst mapping algorithms for a trade‐off between session fairness, QoS, and spectral efficiency. While optimizing radio resources under QoS and fairness constraints is an NP‐hard problem, we follow a heuristic approach that simplifies the complexity of the algorithm. Performance results show that while the new scheme outperforms the Proportional Fair algorithm in terms of fairness, it also improves the overall system spectral efficiency. Copyright © 2016 John Wiley & Sons, Ltd.     

A single transmission selection scheme for downlink distributed antenna system in multicell environment

In this paper, based on maximum signal‐to‐interference‐plus‐noise ratio criterion at the receiver, we propose a single transmission selection scheme for distributed antenna system and investigate the corresponding ergodic capacity together with outage probability in multicell environment. Assuming that the channels suffer from independent non‐identical Nakagami‐m fading with integer values of fading severity parameter m, we derive exact closed‐form expressions for the ergodic capacity and outage probability. Monte‐Carlo simulations are carried out to validate the theoretical analysis. Simulation results show that the ergodic capacity and outage probability of the proposed single transmission selection scheme outperform that of blanket transmission scheme. Copyright © 2013 John Wiley & Sons, Ltd.     

面向网络性能优化的虚拟计算资源调度机制研究

针对基于Xen的vCPU调度机制对虚拟机网络性能的影响进行了深入研究和分析。提出一种高效、准确、轻量级的网络排队敏感类型虚拟机（NSVM）识别方法,可根据当前虚拟机I/O传输特征将容易受到影响的虚拟机进行准确识别和区分。进而设计一种新型虚拟计算资源调度和分配机制Diff-Scheduler,将不同类型虚拟机的vCPU实施分池隔离调度,同时提高NSVM类型虚拟机vCPU的调度频率。原型系统实验结果表明,相比Xen默认的调度机制,Diff-Scheduler能够大幅提高虚拟机网络性能,同时保证计算资源分配的公平性。     

A green scheduling with adaptive spatial division multiple access grouping for multi‐user coordinated multi‐point networks

Multi‐User Coordinated Multi‐Point (MU‐CoMP), which couples CoMP with Multi User‐Multiple Input Multiple Output (MU‐MIMO), appears as a promising solution to enhance the Long Term Evolution‐Advanced (LTE‐A) system performance. However, some challenging issues in MU‐CoMP networks require more investigation. First, the set of users transmitting under CoMP mode should be properly identified. Secondly, time‐frequency resource should be efficiently partitioned between CoMP and non‐CoMP users in order to improve the system radio capacity. Thirdly, a fair and green scheduler is much needed for a more energy efficient system. This paper deals with these three issues. We propose an adaptive transmission mode selection according to the total load in the cluster and to users' quality of service. The adequate size of the Spatial Division Multiple Access users' groups is also analyzed. We finally propose a new scheduling algorithm to further enhance the radio capacity and the energy consumption in the cluster. Simulations results showed that significant improvements are obtained in terms of total system throughput and outage probability in the cluster with our proposed scheme. Moreover, energy efficiency has increased by four times with our proposed scheduling algorithm as compared to commonly used schedulers. Copyright © 2015 John Wiley & Sons, Ltd.     

A joint communication and computing resource management scheme for pervasive grid networks

The last years have been characterized by an increasing interest in the grid and cloud computing that allow the implementation of high performance computing structures in a distributed way by exploiting multiple processing resources. The presence of mobile terminals has extended the paradigm to the so called pervasive grid networks, where multiple heterogeneous devices are interconnected to form a distributed computing resource. In such a scenario, there is the need of efficient techniques for providing reliable wireless connections among network nodes. This paper deals with the proposal of a suitable resource management scheme relying on a routing algorithm able to perform jointly the resource discovery and task scheduling for implementing an efficient pervasive grid infrastructure in a wireless ad hoc scenario. The proposed solutions have been considered within two different parallelization processing schemes, and their effectiveness has been verified by resorting to computer simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

A dynamic even distribution resource scheduling mechanism combined with network coding for inter-LEO satellite networks

Resource scheduling mechanism of LEO satellite networks is the key to determining communication efficiency. Facing the LEO satellite networks with the dynamic topology changes, varying service requirements, and intermittent inter-satellite links (ISLs), the state-of-the-art cannot achieve high resource efficiency under both heavy and burst traffic loads, and the applicability of parameters design is insufficient under intermittent ISLs. Considering this, we propose a dynamic even distribution mechanism combined with network coding DENC. This novel mechanism obtains the service requirements and allocates resources dynamically through the even distribution algorithm to balance network maintenance overhead and resource waste and improves the success probability of transmission based on network coding to balance retransmission and redundancy. In this paper, we establish performance analysis models to optimize the parameters such as maintenance frequency and coding coefficient. Besides, we construct a system-level simulation platform. Mathematical and simulation results indicate that the resource efficiency of EMNC can be improved by more than 48% compared with SAHN-MAC, ICSMA, CSMA-TDMA, and HTM when all nodes have service needs, and the ISL outage rate is 20%. As the outage probability of ISL increases and the proportion of nodes with service requirements decreases, the performance advantage of EMNC becomes more apparent.