基于时延和速率效用函数的LTE无线资源调度算法研究

为了提高LTE实时业务调度的公平性,首先在M-LWDF资源调度算法的优先级判断机制中引入了平均传输速率和保证比特速率,然后将经济学中的效用思想和效用函数引入到M-LWDF调度算法中,提出了一种基于时延效用函数和速率效用函数的M-LWDF改进算法,以便更好地体现调度算法的时延特性和速率特性。     

基于非合作博弈论的多小区OFDMA系统动态资源分配算法研究

该文采用非合作博弈论的方法研究了多小区OFDMA系统中的动态资源分配问题,首先将各基站的发射功率平均分配给各子载波,然后由所有小区在每个子载波上独立地进行资源分配博弈,给出了用户调度与功率分配联合博弈框架。为了进一步简化,将用户调度和资源分配分开完成,通过将信道增益引入到定价函数中,提出了一种新的定价机制,建立了用户确定时的非合作功率分配博弈模型,分析了其纳什均衡的存在性和唯一性,并设计了具体的博弈算法。仿真结果表明,所提算法在保证吞吐量性能的同时,进一步提升了系统的公平性。     

基于实时业务挤占的OFDMA系统的无线资源分配方案

为了在实时业务和非实时业务共享无线资源的场景中增加系统吞吐量,该文提出了一种基于实时业务挤占的无线资源分配方法,该方案首先实施统一调度,然后进行实时业务挤占过程。在保证对实时业务服务的情况下,实时业务挤占的无线资源分配方案提高了多用户分集效果,增加了系统的吞吐量。理论和仿真分析表明,与已有的传统的实时业务和非实时业务共享无线资源的调度方案相比,该方案能够提供更高的系统吞吐量和频谱效率。在实际应用中,该方案具有一定的可行性和可操作性。     

Virtual time reference system: a unifying scheduling framework forscalable support of guaranteed services

We propose and develop a novel virtual time reference system as a unifying scheduling framework to provide scalable support for guaranteed services. This virtual time reference system is designed as a conceptual framework upon which guaranteed services can be implemented in a scalable manner using the DiffServ paradigm. The key construct in the proposed virtual time reference system is the notion of packet virtual time stamps, whose computation is core stateless, i.e., no per-flow states are required for its computation. We lay the theoretical foundation for the definition and construction of packet virtual time stamps. We describe how per-hop behavior of a core router (or rather its scheduling mechanism) can be characterized via packet virtual time stamps, and based on this characterization establish end-to-end per-flow delay bounds. Consequently, we demonstrate that, in terms of its ability to support guaranteed services, the proposed virtual time reference system has the same expressive power and generality as the IntServ model. Furthermore, we show that the notion of packet virtual time stamps leads to the design of new core stateless scheduling algorithms, especially work-conserving ones. In addition, our framework does not exclude the use of existing scheduling algorithms such as stateful fair queuing algorithms to support guaranteed services     

LTE系统上行链路无线资源分配算法

LTE系统上行链路中采用SC-FDMA技术,要求为用户分配的资源块（RU）在频域上连续分布,同时位于扇区边缘的用户因为收到较为严重的外扇区干扰性能有很大恶化。文中主要针对这两个问题,在传统算法的基础上,分别提出一种改进的PF频域分组调度算法和一种改进的部分功率控制算法。仿真结果表明,二者结合能较好地改善系统性能,特别是边缘用户的性能。     

GEO卫星LTE跨层资源调度算法

地球同步轨道(GEO)卫星通信系统具有通信时延长的特点,适用于GEO卫星长期演进(LTE)通信的资源调度算法非常重要。为提升星上资源分配的高效性,基于可变最大加权时延优先(M-LWDF)算法,提出了一种综合考虑媒体接入控制(MAC)层参数和应用层参数的跨层调度算法。该算法在MAC层从数学角度推导,提出权重更大的时延判决因子及在应用层根据业务优先级不同引入Q因子。仿真结果表明,与M-LWDF算法相比,不同业务情况下,跨层资源调度算法减小了通信时延,提高了系统吞吐量,但公平性能略有下降并增加了复杂度。     

A Resource Allocation Framework for Scalable Video Broadcast in Cellular Networks

Video streaming is one of the most important applications that will make use of the high data rates offered by 4G networks. The current video transport techniques are already very advanced, and the more immediate problems lie in the joint optimization of video coding, AL-FEC, and PHY rate selection with the goal of enhancing the user perceived quality. In this work we provide an analysis of video broadcast streaming services for different combinations of layered coding and AL-FEC, using a realistic LTE PHY layer. Our simulation results show that the scalable content adaptation given by Scalable Video Coding (SVC) and the scheduling flexibility offered by the 3G-LTE MAC-layer provide a good match for enhanced video broadcast services for next generation cellular networks. Our proposed solution is compared to baseline algorithms and broadcast systems based on H.264/AVC streaming solutions. We emphasize the system quality improvement brought by our solution and discuss implications for a wide-scale practical deployment.     

车路通信环境下TD-LTE无线资源调度建模与仿真

为了改善现有车路通信方式覆盖范围小、交付时延大和传输速率低的现状,将TD-LTE技术引入车路通信接入系统。提出了基于TD-LTE的车路通信接入系统无线资源调度模型;构建了车路通信仿真场景,对比例公平算法、指数比例公平算法和改进的最大权重时延优先算法进行性能分析。仿真结果表明:车辆低速移动场景下,系统负载较低时指数比例公平算法性能较好,系统负载较高时改进的最大权重时延优先算法表现更优,比例公平算法不适合车路通信多媒体业务流调度;车辆高速移动场景下,三者都不适合车路通信多媒体业务流调度。     

一种适用于宽带无线城域网实时业务的分组调度算法

对宽带无线城域网（WMAN）而言,分组调度算法是保证用户服务质量（QoS）、平衡用户间公平性的关键。在研究比例公平调度算法（PF）算法与修正的最大加权时延优先算法（M-LWDF）的基础上,一种新的适用于宽带无线城域网实时业务的分组调度算法被提出,此算法引入了新的衡量服务队列负载的信息,能够实时地更新状态参数,提高了系统性能。仿真结果表明,此算法在保证系统吞吐量的同时,比M-LWDF算法具有更好的时延特性和公平性。     

NEST: novel eMBMS scheduling technique

In order to meet the growing demand for mobile multimedia broadcast services 3GPP includes evolved multimedia broadcast and multicast (eMBMS) services in LTE systems. The high data rates, low latency and QoS provisioning makes LTE systems more suitable for mobile broadcast and multicast services than legacy wireless networks. However, the 3GPP standards has not specified any scheduling strategy for this broadcast and multicast services. In this paper, we propose a novel eMBMS scheduling technique (NEST) which focuses on reducing the average waiting time (latency) of the broadcast services offered by LTE system. This paper has twofold contributions. We proffer NEST considering two types of impatience that is user equipment (UE) departure and UE request repetition. Our proposed scheduling strategy estimates the effects originating from the departure of the mobile UEs and UE request repetition case. It intelligently combines the advantages of both flat scheduling and on-demand scheduling in such a way that the overall latency of the system is reduced. We design a suitable modeling framework to analyze the performance of the system. Simulation experiments on typical LTE systems support the performance analysis and demonstrates 10 % gains while comparing with existing eMBMS scheduling available in present LTE systems.     

业务优先级感知的网络流量调度机制

针对网络中业务数据流过大、分布不均匀所造成的网络拥塞,提出一种优先级感知的动态网络流量调度机制.利用令牌桶算法,根据业务优先级的不同为不同业务分配不同速率的令牌,以实现业务优先级的划分;综合考虑业务的优先级及用户节点剩余缓存空间,对不同的业务采取不同的处理方式;同时,以流量到达因素、服务因素及节点缓存为指标定义了一种网络流量调度机制性能指标——分组丢失率.数值结果表明,所提机制可以对网络中业务优先级进行合理的划分,从而有效利用网络资源,预防网络拥塞,提升网络性能,为用户提供更加稳定可靠的网络服务.     

一种下行OFDM-SDMA系统资源分配算法

研究了OFDM-SDMA系统中的资源分配算法问题,针对已有算法的不足,提出了一种新的多用户调度指标,并在此基础上提出了次优多用户调度算法。针对整数比特约束,采用了两种合适的资源分配方案。由于新指标充分考虑了被调度用户之间的空间兼容性和信道质量,仿真结果证明所提算法可以获得较好的性能增益,且资源分配算法的收敛速度较快。     

Resource Allocation Scheme for Millimeter Wave–Based WPANs Using Directional Antennas

In this paper, we consider a resource allocation scheme for millimeter wave–based wireless personal area networks using directional antennas. This scheme involves scheduling the reservation period of medium access control for IEEE 802.15.3c. Objective functions are considered to minimize the average delay and maximize throughput; and two scheduling algorithms—namely, MInMax concurrent transmission and MAxMin concurrent transmission—are proposed to provide a suboptimal solution to each objective function. These are based on an exclusive region and two decision rules that determine the length of reservation times and the transmission order of groups. Each group consists of flows that are concurrently transmittable via spatial reuse. The algorithms appropriately apply two decision rules according to their objectives. A real video trace is used for the numerical results, which show that the proposed algorithms satisfy their objectives. They outperform other schemes on a range of measures, showing the effect of using a directional antenna. The proposed scheme efficiently supports variable bit rate traffic during the reservation period, reducing resource waste.     

Distributed Resource Allocation in Two‐Hierarchy Networks

In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross‐tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non‐cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two‐hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross‐tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.     

Using Incompletely Cooperative Game Theory in Wireless Mesh Networks

Recently, game theory has become a useful and powerful tool in research on wireless mesh networks. In this article the authors present a novel concept of incompletely cooperative game theory and use it to improve the performance of MAC protocols in WMNs. In this game, first, each node estimates the current game state (e.g., the number of competing nodes). Second, the node adjusts its equilibrium strategy by tuning its local contention parameters (e.g., the minimum contention window) to the estimated game state. Finally, the game is repeated several times to get the optimal performance. To use the game effectively in WMNs, the authors present a hybrid CSMA/CA protocol by integrating a proposed virtual CSMA/CA and the standard CSMA/CA protocol. When a node has no packet to send, it contends for the channel in virtual CSMA/CA mode. In this way the node can estimate the game state and obtain the optimal strategy. When a node has packets to send, it contends for the channel in standard CSMA/CA mode with the optimal strategy obtained in virtual CSMA/CA mode, switching smoothly from virtual to standard CSMA/CA mode. At the same time, the node keeps adjusting its strategy to the variable game state. In addition, the authors propose a simplified game-theoretic MAC protocol (G-CSMA/CA) by designing an auto degressive backoff mechanism based on the incompletely cooperative game. G-CSMA/CA can easily be implemented in mesh nodes. Finally, simulation results show that the incompletely cooperative game can increase system throughput, decrease delay, jitter, and packet loss rate, and support the game effectively.     

Analysis of Radio Resource Allocation in LTE Uplink

Long term evolution (LTE) uses orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA) as the downlink and uplink transmission schemes respectively. The Quality of Service (QoS) provision to users is one of the key objectives of the wireless network operators. This paper analyses an uplink LTE radio scheduler, called bandwidth and QoS aware (BQA) scheduler and evaluates its QoS performance. The BQA uplink scheduler is designed to provide efficient and fair allocation of the radio resources to users according to: the QoS of various traffic classes and the instantaneous channel conditions. The scheduler functionality is divided into time domain packet scheduling (TDPS) and frequency domain packet scheduling (FDPS). In this paper, an innovative feature, that is user QoS provisioning with dynamic QoS weights, is employed for the BQA scheduler along with multi-bearer users support. The QoS performance of the BQA scheduler is analyzed in several simulation scenarios using heterogeneous traffic environment. The results show that the BQA scheduler guarantees provision of QoS to users.     

Comparative Performance Study of LTE Downlink Schedulers

Long time evolution (LTE) represents an emerging and promising technology for providing broadband, mobile Internet access. Because of the limitation of available spectrum resource, high spectrum efficiency technologies such as channel-aware scheduling need to be explored. In this work, we evaluate the performance of three scheduling algorithms proposed for LTE downlink transmission. The evaluation takes place in mixed traffic scenarios and aims at exploring strengths and weaknesses of the proposed algorithms. Simulation results illustrate the importance of real-time traffic awareness by schedulers when a specified level of quality of service is required. The research shows that lack of prioritisation of multimedia traffic will lead to severe degradation of video and VoIP services even with a relatively low network load.     

Traffic scheduling in a photonic packet switching system with QoSguarantee

The main challenge in the design of future broadband networks is to efficiently support high-bandwidth multimedia services. Recent advances in the optical networking reveal that all optical networks offering multigigabit rate per wavelength may soon become economical as the underlying backbone in wide area networks, in which photonic switch plays a central role. Two issues are the essential in the design of photonic packet switching, the support of end-to-end virtual connections and the support of diverse quality-of-service (QoS) services. Existing work in wide-area optical networks has largely focused on the former, relatively less attention has been given to support heterogeneous traffic types and to satisfy the potentially different QoS requirements of different types of traffic. In this paper, we introduce a novel hierarchical scheduling framework to use in a class of photonic packet switching systems based on WDM, in which we separate the flow scheduling from the transmission scheduling. We show such separation is essential for achieving scalability such that large input-output ports can be accommodated, and also for offering flexibility in that optimal scheduling algorithms can be derived in different level that can be best tuned to the specific system requirements. The salient feature of the proposed scheduling mechanism is that it takes into account potentially different QoS requirements from different traffic flows. A number of interesting findings are observed from the results obtained by both analysis and simulation: (1) QoS requirements can be satisfied for both real-time and nonreal-time flows; (2) the impact Of the real-time traffic head-of-line (HoL) blocking on the system throughput can be effectively alleviated with the prevailing number of traffic flows. In addition, we investigate a variety of performance measures under different system configurations     

Resource scheduling in downlink LTE-advanced system with carrier aggregation

In this paper,we focus on the resource scheduling in the downlink of long term evolution advanced (LTE-A) assuming equal power allocation among subcarriers.Considering the backward compatibility,the LT...     

基于双层分级的无线城域网资源分配方案

未来移动通信系统,诸如IEEE802.16旨在能够传送多种具有不同QoS要求的多媒体业务。为了保证业务的QoS,需合理设计调度器的结构和相应的调度算法。针对IEEE802.16宽带无线接入系统中的双层分级带宽分配体系结构,结合总调度器分配算法优点,采用了更适用于分类调度器且不同于参考文献的分配算法,旨在能够针对不同QoS等级的业务提供不同的调度方案,更好地满足用户的QoS要求。