一种适用于B3G移动通信系统下行共享信道的调度算法

本文针对后三代(B3G)移动通信系统中的宽带无线信道特性和流媒体业务特征,分析了可用于高速下行共享信道的各种传统分组调度算法,提出面向流媒体业务能够提高系统吞吐量的基于优先级公平调度(Priority-Based Fairness Scheduling,PBFS)算法.该算法根据各移动用户收发信道质量和业务传输的QoS要求动态调整各用户的业务传输优先级,确定下行共享信道的调度方案.并给出该算法的简化形式S-PBFS.仿真结果表明,与传统调度算法相比,S-PBFS算法在数据包传输时延受限的条件下具有无线信道利用率高、实现复杂度低等特点.     

IEEE 802．16中基于信道状态的改进分组调度算法

为适应IEEE802．16无线网路的特点,降低数据的分组超时率,提高数据的平滑性,在基于信道状态的分组调度算法（CSDPS算法）的基础上,提出了一种基于信道状态的改进分组调度算法。该算法把业务区分与信道状态结合起来,既考虑了不同业务的QoS需求,也考虑了无线网络的信道特点。在降低发送速率上,给出降低速率的具体计算公式。通过理论分析,用改进算法与原有CSDPS算法进行了对比。可以发现,改进算法在分组超时率和数据平滑性上都有较大改善。     

高级在轨系统中的虚拟信道混合调度算法研究

为高效传输业务类型多样化的空间数据,该文基于高级在轨系统(AOS)虚拟信道复用技术,建立了AOS虚拟信道(VC)混合调度模型。在混合调度模型中,对异步虚拟信道提出了基于遗传-粒子群排序的调度算法,业务优先级、调度时延紧迫度及帧剩余量紧迫度是影响虚拟信道调度先后顺序的关键约束,该算法根据约束建立了遗传-粒子群适应度函数模型,进一步使粒子群体内的粒子根据遗传算法的进化算子进行位置更新,从而找到最优的异步虚拟信道调度顺序。同时,对同步虚拟信道设计了动态加权轮询调度算法,使各同步虚拟信道按照加权因子和分配的时隙数,轮流占用物理信道。仿真结果表明,该文的虚拟信道混合调度算法兼顾了异步数据的优先性、同步数据的等时性和VIP数据的紧迫性,具有更小的平均调度时延和更少的帧剩余量,满足不同业务的传输要求。     

高级在轨系统中的虚拟信道混合调度算法研究

为高效传输业务类型多样化的空间数据,该文基于高级在轨系统(AOS)虚拟信道复用技术,建立了AOS虚拟信道(VC)混合调度模型.在混合调度模型中,对异步虚拟信道提出了基于遗传-粒子群排序的调度算法,业务优先级、调度时延紧迫度及帧剩余量紧迫度是影响虚拟信道调度先后顺序的关键约束,该算法根据约束建立了遗传-粒子群适应度函数模型,进一步使粒子群体内的粒子根据遗传算法的进化算子进行位置更新,从而找到最优的异步虚拟信道调度顺序.同时,对同步虚拟信道设计了动态加权轮询调度算法,使各同步虚拟信道按照加权因子和分配的时隙数,轮流占用物理信道.仿真结果表明,该文的虚拟信道混合调度算法兼顾了异步数据的优先性、同步数据的等时性和VIP数据的紧迫性,具有更小的平均调度时延和更少的帧剩余量,满足不同业务的传输要求.     

激光传感节点通信中的低能耗调度算法

在路由冲突下的激光传感节点通信中,低能耗调度传输信道受到多径效应的影响,导致调度的负载均衡性欠佳,信息传输的误码率较高。为了提高调度算法信道资源均衡调度能力,提出基于自适应反馈均衡控制技术的低能耗调度算法。首先,构建路由冲突下的激光传感节点通信低能耗调度算法传输信道模型,分析激光传感节点通信低能耗调度算法信道的多径特性;其次,采用线性随机化检测方法进行激光传感节点通信低能耗调度算法的信道码间干扰抑制;最后,结合自适应反馈均衡技术进行信道均衡设计,进行激光传感节点通信传输低能耗调度算法信道的多径抑制,实现激光传感节点通信低能耗调度算法信道资源均衡调度。测试结果表明,采用该算法进行激光传感节点通信传输低能耗调度的均衡性较好,抗干扰能力较强,输出误码率较低。     

面向电网业务质量保障的5G高可靠低时延通信资源调度方法

该文研究面向电网业务质量保障的5G 高可靠低时延通信(URLLC)的资源调度机制,以高效利用低频段蜂窝通信系统内有限的频谱和功率资源来兼顾电力终端传输速率和调度时延、调度公平性,保障不同电力业务的通信质量（QoS）。首先,基于URLLC的高可靠低时延传输特性,建立电力终端多小区下行传输模型。然后,提出面向系统下行吞吐量最大化的资源分配问题模型并对其进行分步求解,分别提出基于定价机制与非合作博弈的功率分配算法和基于调度时延要求的改进比例公平算法（DPF）动态调度信道资源。仿真结果表明,提出的资源调度方法能在保证一定传输可靠性和公平性的条件下降低电力终端调度时延,满足不同业务等级的QoS需求,与已知算法对比有一定的优越性。     

1x EVDO系统支持Best-effort业务前向链路调度算法

针对Best-effort业务在对现有1x EVDO系统的无线分组调度算法研究的基础上,提出一种自适应正比公平(APF)算法,仿真结果也验证了该算法在各用户信道特性差别很大时比已有的PF和DRC指数算法具有更好的公平性.     

多态OBS网络中基于信道整理的调度算法

多态光突发交换(POBS)网络能够有效地支持多种同步和异步业务的传输,但是其异步突发业务的丢失率较相同网络环境下的传统OBS丢失率要高。如何有效地对多态OBS中异步突发进行合理调度,是降低异步突发丢失率的关键所在。提出了一种基于信道整理的调度算法,将已经成功调度的突发重新调度到最合适的数据信道,使得信道资源得到充分的利用,从而降低了异步突发的丢失率。仿真结果表明,该算法能很好地降低多态OBS网络中异步突发的丢失率。     

APON系统中一种具有多优先级业务的动态带宽分配算法

基于ＡＴＭ的无源光网络（ＡＰＯＮ）上行信道的传输是采用时分多址接入（ＴＤＭＡ）方式来共享光纤的,根据光线路终端（ＯＬＴ）的指示,各光网络单元（ＯＮＵ）发出的信号占据不同的时隙。为了有效利用带宽,给出了一种具有多优先级业务的动态带宽分配算法—最少业务量损失算法,它通过分级允许控制为各优先级业务分配相应的带宽。当有一新的连接要求时,计算损失业务目标函数Ｑ来高速带宽分配。     

WCDMA系统中区分业务类型的动态公平分组调度算法研究

在WCDMA系统中设计分组调度算法不仅需要关注信道条件,还需要关注功率问题.由此,提出了基于功率指数和名义容量概念的WCDMA系统区分业务类型码分通用处理器共享调度算法（SD-CDGPS）,通过引入业务区分模型、动态名义容量分配模型和补偿模型,在提供时延上限的同时确保了各类型业务流之间的短期和长期公平性,并有较高的系统吞吐量.     

Efficient delay based scheduling with fairness in multi-hop wireless mesh networks

Some scheduling algorithms have been designed to improve the performance of multi-hop wireless mesh networks (WMNs) recently. However the end-to-end delay is seldom considered as the complexity of multi-hop topology and open wireless shared channel. This article proposes an efficient delay based scheduling algorithm with the concept of buffer-data- hops. Considering the demand satisfaction factor (DSF), the proposed algorithm can also achieve a good fairness performance. Moreover, with the interference-based network model, the scheduling algorithm can maximize the spatial reuse, compared to those graph-based scheduling algorithms. Detailed theoretical analysis shows that the algorithm can minimize the end-to-end delay and make a fair scheduling to all the links.     

Meta‐heuristic algorithms for channel scheduling problem in wireless sensor networks

The channel scheduling problem is to decide how to commit channels for transmitting data between nodes in wireless networks. This problem is one of the most important problems in wireless sensor networks. In this problem, we aim to obtain a near‐optimal solution with the minimal energy consumption within a reasonable time. As the number of nodes increases in the network, however, the amount of calculation for finding the solution would be too high. It can be difficult to obtain an optimal solution in a reasonable execution time because this problem is NP‐hard. Therefore, most of the recent studies for such problems seem to focus on heuristic algorithms. In this paper, we propose efficient channel scheduling algorithms to obtain a near‐optimal solution on the basis of three meta‐heuristic algorithms; the genetic algorithm, the Tabu search, and the simulated annealing. In order to make a search more efficient, we propose some neighborhood generating methods for the proposed algorithms. We evaluate the performance of the proposed algorithms through some experiments in terms of energy consumption and algorithm execution time. The experimental results show that the proposed algorithms are efficient for solving the channel scheduling problem in wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Fair scheduling in wireless packet networks

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair-scheduling algorithms because of two unique characteristics of wireless media: (1) bursty channel errors and (2) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however, a base station has only a limited knowledge of the arrival processes of uplink flows. We propose a new model for wireless fair-scheduling based on an adaptation of fluid fair queueing (FFQ) to handle location-dependent error bursts. We describe an ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wireless scheduling algorithm which approximates the ideal algorithm. Through simulations, we show that the algorithm achieves the desirable properties identified in the wireless FFQ model     

Heuristic approach for broadcast scheduling,problem in wireless mesh networks

Disasters can be natural and human-initiated events that interrupt the usual functioning of people on a large scale. Region where disasters have occurred causes hazards to the public of that area and to the rescue teams. Disaster causes the damage to the communication network infrastructure also. Once the communication infrastructure is damaged, it is very difficult to the rescue teams to actively involve in relief operation. To handle these hazards, different wireless technologies can be initiated in the area of disaster. This paper discusses the innovative wireless technology for disaster management. Specifically, issues related to the broadcast scheduling problem in wireless mesh network is deployed efficiently during disaster relief are discussed. A domain specific memetic algorithm is proposed for solving the optimum time division multiple access broadcast scheduling problem in wireless mesh networks. The aim is to increase the total number of transmissions in optimized time slot with high channel utilization in a less computation time. Simulation results showed that our memetic algorithm approach to this problem achieves 100% convergence to solutions within reduced computation time while compared to recent efficient algorithms. The results were compared with several heuristic and non-heuristic algorithms for broadcast scheduling problem.     

Wireless Packet Scheduling Algorithm for OFDMA System Based on Time‐Utility and Channel State

In this paper, we propose an urgency‐ and efficiencybased wireless packet scheduling (UEPS) algorithm that is able to schedule real‐time (RT) and non‐real‐time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time‐utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality‐of‐service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modifiedlargest weighted delay first (M‐LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.     

Self-coordinating localized fair queueing in wireless ad hoc networks

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose maximize-local-minimum fair queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.     

HSDPA中支持实时业务的调度算法在吞吐量方面的仿真分析

随着移动通信技术的飞速发展,未来的移动通信系统将以数据业务为主,所以无线分组调度算法将成为影响系统性能和保证用户服务质量的关键所在。在HSDPA系统中无线资源管理是通过分组调度算法来实现的。理想的调度算法应满足各类业务的QoS要求和用户之间的公平性,使系统资源利用率达到最大。主要介绍了EXP算法和M-LWDF算法,并对两种算法在吞吐量方面进行了仿真分析,说明了M-LWDF算法具有更高的吞吐量。     

基于强化学习的802.11ax上行链路调度算法

随着物联网(IoT)时代的到来,无线网络饱和的问题已经越来越严重。为了克服终端密集接入问题,IEEE标准协会(IEEE-SA)制定了无线局域网的最新标准—IEEE 802.11ax。该标准使用正交频分多址(OFDMA)技术对无线信道资源进行了更细致的划分,划分出的子信道被称为资源单元(RU)。为解决密集用户环境下802.11ax 上行链路的信道资源调度问题,该文提出一种基于强化学习的RU调度算法。该算法使用演员-评论家(Actor-Critic)算法训练指针网络,解决了自适应RU调度问题,最终合理分配RU资源给各用户,兼具优先级和公平性的保障。仿真结果表明,该调度算法在IEEE 802.11ax上行链路中比传统的调度方式更有效,具有较强的泛化能力,适合应用在密集用户环境下的物联网场景中。