中继增强的无线蜂窝多小区系统的联合调度与功率控制算法

针对采用全局频率复用的中继增强的无线蜂窝多小区系统,该文考虑多种通信模式并存的混合场景,提出了一种干扰感知的联合资源分配策略。以最大化系统总吞吐量为目标,同时考虑小区间干扰对中继节点与移动站点的影响,以及基站与中继节点各自的发射功率约束。为了降低计算复杂度,针对用户与中继节点配对问题提出了一种基于小区间干扰的调度算法;针对功率控制问题分别提出了一种基于符号规划的最优功率分配算法和一种次优的最小能耗功率分配算法。仿真结果表明,该文所提算法逼近最优资源分配,在系统吞吐量与能量效率等性能方面具有显著优势。     

MR-MC无线传感器网络最小延迟数据聚集调度研究

单radio单信道无线传感器网络的最小延迟聚集调度是一个NPC问题,已提出许多解决方案。在多radio多信道网络中,节点可以同时接收多个不同节点传输的数据,降低延迟。基于上述特点,考虑树结构约束,时槽、信道和radio分配等约束条件,将多radio多信道无线传感器网络最小延迟聚集调度问题定义为一个优化问题,并分解为建立聚集树和节点调度2个子问题,针对这2个子问题分别提出启发式算法。实验结果表明,提出的算法具有良好的性能。     

基于三角模糊数改进的块存储调度算法

OpenStack作为当前应用最广泛的开源云平台得到了业界的普遍认可,随之带来其块存储模块Cinder的应用也越来越广泛,但Cinder的调度算法以剩余存储空间作为节点调度的条件,这种调度显然并不能达到对综合性能最优节点的调度。文中提出了一种基于三角模糊数的调度算法,该算法同时考虑多个对存储节点的评价因素,可以实现对综合性能最优节点的调度。同时由于三角模糊数的引入,定性指标可以使用定量的方法进行描述,使得调度模型更加健壮。     

网络资源的均衡化调度算法研究

针对传统轮询算法对网络资源的均衡化调度存在负载均衡性差、网络资源浪费严重以及资源调度效果差的问题,提出一种新的网络资源均衡化调度算法。基于网络资源的均衡化算法运行过程,设计异构集群的并行计算熵的计算矩阵,实现虚拟机的调度,对调度目标的物理节点进行分析,完成网络资源多线程负载均衡调度。采用基于处理时间的网络资源负载动态均衡算法,对每个物理节点建立负载调度机制,使物理节点按照内部最优调度方式实施均衡调度,实现对网络资源的均衡化调度。实验结果表明,所提算法的调度效率高,且具有较高的负载均衡稳定性,可以减少网络资源的浪费,增强网络资源的调度效果。     

树形网格自适应调度模型研究

提出一种基于树形计算网格的自适应调度模型,实现对小粒度独立任务和用户大作业的自适应最优调度.通过对网格环境的实时检测,给出了基于节点负载状况、节点任务执行时间和任务特性的自适应调度算法.实验证明该任务调度模型在负载平衡和容错方面具有良好的性能.     

分布式开放实时系统调度策略研究

为有效管理分布式开放实时系统(Distributed Open Real-Time System,DORTS)的CPU和网络资源,提供实时应用端到端延时确保,提出一种基于资源预留的分层调度策略.对于任务的调度,首先利用最大需求任务优先与最小可利用率节点适应算法将任务分配到各节点,然后在节点上采用基于服务器的两层调度架构...     

基于商空间的层次式数据网格资源调度算法

为了解决传统数据网格调度算法在对层次式数据网格调度过程中出现的极易陷入局部最优值和收敛速度过慢的问题,将粒计算的思想引入到网格调度中,提出了一种基于商空间的层次式数据网格资源调度QSHDGRA (quotient space theory based hierarchical data grid resource allocation)算法。首先分析了层次式数据网格的特点,接着提出一种基于业务请求平均等待时间和网络与节点资源利用均衡度的调和函数的调度问题模型,随后设计了基于商空间的层次式最优资源调度算法。该算法的特点是可以在不同粒度上由粗至细地对网格业务进行调度,从而保证不同业务的QoS,并实现系统全局最优资源分配。仿真实验表明,算法可以显著地提升系统整体的吞吐率,具有更快的收敛速度,并具备线性扩展能力。     

OBS网络中的最小间隙组调度算法

根据OBS网络的结构和特点,分析了OBS网络核心节点的数据信道调度算法,提出了一种新的数据信道调度算法--最小间隙组调度(SGGS)算法,并详细讨论了该算法的具体实现.该算法将到达核心节点的控制包分组,然后将这一组控制包按数据包到达先后的次序调度数据信道,从而达到合理调度和使用数据信道,最终实现改善整个OBS网络性能的目的.     

分布式天线系统的多用户分集

分布式天线系统(DAS)由于其具有更大的覆盖范围,较好的功率效率,以及更高的系统容量在近年来备受关注,但很多文献都只是基于以上几个方面进行分析,而没有考虑多用户分集。该文提出了一种考虑用户公平性的最小容量损失轮询调度算法,并以该算法为基础,从多用户分集的角度研究了基于迫零波束成形算法的下行分布式天线系统的信道容量。结果表明,在天线数目和总功率相同的情况下,采用分布式天线系统可以得到比集中放置天线系统(CAS)更大的多用户分集增益。最小容量损失轮询调度算法明显优于普通轮询调度算法,该算法对DAS和CAS都适用。     

实时网络的分布式调度

针对主—从结构实时网络的性能特点,提出了一种基于EDF的主节点分布式实时任务调度算法,给出了该调度算法下实时任务组的可调度的充分条件。仿真测试表明,该调度算法满足实时约束,适合于主—从结构的实时网络调度。     

Optimal scheduling of coordinated multipoint transmissions in cellular networks

In this paper, we study the optimal scheduling problem in coordinated multipoint (CoMP) transmission–based cellular networks. We consider joint transmission and coordinated scheduling together in CoMP transmission–based cellular networks and develop an optimization framework to compute the optimal max‐min throughput and the optimal scheduling of the transmissions to the users. The optimization problem is found to be a complex linear program with number of variables in for a cellular network of N users and K cells. We solve the optimization problem for several network instances using an optimization tool. The numerical results show that the optimal CoMP transmission provides a significant throughput gain over a traditional transmission. We find that in optimal scheduling the fraction time of coordinated scheduling is higher than that of joint transmission. To solve the optimization problem without any optimization tool, we propose a heuristic algorithm. The performance of the heuristic algorithm is evaluated and found to be provided throughput around 97% of the optimal throughput. Further, we extend the optimization framework to study joint scheduling and power allocation (JSPA) problem in CoMP transmission–based cellular networks. We numerically solve the JSPA problem for the network instances and demonstrate that the optimal power allocation at the base stations is not binary for a significant fraction of time of scheduling. However, the gain in max‐min throughput by the optimal JSPA technique over the optimal scheduling technique is not significant.     

Graph‐based optimal asynchronous scheduling in large propagation delay underwater acoustic sensor networks

Optimal scheduling is essential to minimize the time wastage and maximize throughput in high propagation delay networks such as in underwater and satellite communication. Understanding the drawbacks of synchronous scheduling, this paper addresses an asynchronous optimal scheduling problem to minimize the time wastage during the transmission. The proposed scheduling problem is analyzed in both broadcast and non‐broadcast networks, which is highly applicable in high propagation delay networks. In broadcast networks, the proposed scheduling method reduces to a graph‐theoretic model that is shown to be equivalent to the classic algorithmic asymmetric traveling salesman problem (TSP) which is NP‐Hard. Although it is NP‐Hard, the TSP is well‐investigated with many available methods to find the best solution for up to tens of thousands of nodes. In non‐broadcast networks, the optimal solution to the scheduling problem considers the possibility of parallel transmission, which is optimized using graph coloring algorithm. The groups obtained through graph coloring are solved using Asymmetric Traveling Salesman algorithm to obtain the optimal schedule. The proposed method efficiently solves the scheduling problem for networks of practical size.     

基于粒子群算法的嵌入式云计算资源调度

随着移动互联网的发展,基于嵌入式设备的云计算服务成为研究热点。在国内,嵌入式云计算目前正处于探索研究阶段,云资源管理调度是嵌入式云计算的核心技术之一,其效率直接影响嵌入式云计算系统的性能。为了提高云计算性能,本文提出一种基于粒子群优化算法的云计算任务调度模型。粒子群算法中粒子位置代表可行的资源调度方案,以云计算任务完成时间及资源负载均衡度作为目标函数,通过粒子群优化算法,找出最优资源调度方案。在matlab实验平台进行了仿真,通过大量数据模拟实验表明,该模型可以快速找到最优调度方案,提高资源利用率,具有较好的实用性和可行性。     

基于加气站槽车调度的模型建立与算法研究

通过对CNG的发展形势介绍,深入到要研究的具体问题——槽车调度,槽车调度就是加气站母站向子站调度发送槽车。匈牙利算法是用到线性规划上解决最优化最优解的问题。考虑到槽车调度优化的问题的特殊性,因此在匈牙利算法的思想基础上,提出了最大差值法。此方法能更高效率地运算出最优解。     

Scheduling Algorithms and Throughput Maximization for the Downlink of Packet-Data Cellular Systems with Multiple Antennas at the Base Station

The capacity-achieving coding scheme for the multiple-input multiple-output (MIMO) broadcast channel is dirty-paper coding. With this type of transmission scheme the optimal number of active users that receive data and the optimal power allocation strategy are highly dependent on the structure of the channel matrix and on the total transmit power available. In the context of packet-data access with adaptive transmission where mobile users are equipped with a single receive antenna and the base station has multiple transmit antennas, we study the optimal number of active users and the optimal power allocation. In the particular case of two transmit antennas, we prove that the optimal number of active users can be a non-monotonic function of the total transmit power. Thus not only the number of users that should optimally be served simultaneously depends on the user channel vectors but also on the power available at the base station transmitter. The expected complexity of optimal scheduling algorithms is thus very high. Yet we then prove that at most as many users as the number of transmit antennas are allocated a large amount of power asymptotically in the high-power region in order to achieve the sum-capacity. Simulations confirm that constraining the number of active users to be no more than the number of transmit antennas incurs only a marginal loss in spectral efficiency. Based on these observations, we propose low-complexity scheduling algorithms with sub-optimal transmission schemes that can approach the sum-capacity of the MIMO broadcast channel by taking advantage of multiuser diversity. The suitability of known antenna selection algorithms is also demonstrated. We consider the cases of complete and partial channel knowledge at the transmitter. We provide simulation results to illustrate our conclusions.     

On the power efficiency of cooperative broadcast in dense wireless networks

A fundamental problem in large scale wireless networks is the energy efficient broadcast of source messages to the whole network. The energy consumption increases as the network size grows, and the optimization of broadcast efficiency becomes more important. In this paper, we study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In the considered cooperation protocol, a single source initiates the transmission and the rest of the nodes retransmit the source message if they have decoded it reliably. Each node is allocated an-orthogonal channel and the nodes improve their receive signal-to-noise ratio (SNR), hence the energy efficiency, by maximal-ratio combining the receptions of the same packet from different transmitters. We assume that the decoding of the source message is correct as long as the receive SNR exceeds a predetermined threshold. Under the optimal cooperative broadcasting, the transmission order (i.e., the schedule) and the transmission powers of the source and the relays are designed so that every node receives the source message reliably and the total power consumption is minimized. In general, finding the best scheduling in cooperative broadcast is known to be an NP-complete problem. In this paper, we show that the optimal scheduling problem can be solved for dense networks, which we approximate as a continuum of nodes. Under the continuum model, we derive the optimal scheduling and the optimal power density. Furthermore, we propose low-complexity, distributed and power efficient broadcasting schemes and compare their power consumptions with those-of-a traditional noncooperative multihop transmission     

非对称毫米波大规模MIMO系统信道特性研究

在大规模多输入多输出（multiple-input multiple-output,MIMO）系统中,合理的天线选择、用户调度以及用户功率分配方案,对提升系统能效、节省资源成本有着重要的作用. 针对大规模MIMO下行链路通信场景,基于能效最大化准则,提出了一种联合天线选择、用户调度以及功率分配的低复杂度优化算法. 首先,针对天线选择和用户调度问题,结合递增递减的选择思想,以最大化系统能效为目标,对天线和用户进行双向交替搜索;其次,对于搜索过程中的用户功率分配问题,采用分式规划理论和拉格朗日对偶算法得到最优能效功率的闭式解,三个参数进行迭代优化,从而得到系统最优能效. 仿真结果表明,本文所提算法不仅具有低复杂度而且具有较好性能,能够有效降低大规模MIMO系统的能耗.

     

Crow–penguin optimizer for multiobjective task scheduling strategy in cloud computing

Task scheduling in the cloud is the multiobjective optimization problem, and most of the task scheduling problems fail to offer an effective trade‐off between the load, resource utilization, makespan, and Quality of Service (QoS). To bring a balance in the trade‐off, this paper proposes a method, termed as crow–penguin optimizer for multiobjective task scheduling strategy in cloud computing (CPO‐MTS). The proposed algorithm decides the optimal execution of the available tasks in the available cloud resources in minimal time. The proposed algorithm is the fusion of the Crow Search optimization Algorithm (CSA) and the Penguin Search Optimization Algorithm (PeSOA), and the optimal allocation of the tasks depends on the newly designed optimization algorithm. The proposed algorithm exhibits a better convergence rate and converges to the global optimal solution rather than the local optima. The formulation of the multiobjectives aims at a maximum value through attaining the maximum QoS and resource utilization and minimum load and makespan, respectively. The experimentation is performed using three setups, and the analysis proves that the method attained a better QoS, makespan, Resource Utilization Cost (RUC), and load at a rate of 0.4729, 0.0432, 0.0394, and 0.0298, respectively.