QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Call admission control with opportunistic scheduling scheme

In this paper, a rate‐based admission control scheme for a single shared wireless base station with opportunistic scheduling and adaptive modulation and coding (AMC) is proposed. The proposed admission scheme maintains minimum average rates of the admitted users, i.e., new users will be admitted if the base station has enough resources to support the required minimum average transmission rates of all users. The proposed scheme relies on an analytical model for the average per‐user rates of an opportunistic scheduling in an unsaturated scenario, where some queues may be empty for certain periods of time. We provide extensive simulation results to demonstrate the accuracy of the base analytical model on which our admission scheme relies. Copyright © 2009 John Wiley & Sons, Ltd.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

Throughput enhanced scheduling (TES) scheme for ultra‐dense networks

This paper proposes two novel packet scheduling schemes, called as throughput enhanced scheduling (TES) and TES plus (TES+), for future ultra‐dense networks. These schemes introduce two novel parameters to the scheduling decision making and reformulate the parameters used by the state‐of‐the‐art schemes. The aim is to have a more balanced weight distribution between delay and throughput‐related parameters at scheduling decisions. Also include a new telecommunications related parameter into scheduling decision making that has not been studied by popular schedulers. The performance of novel schemes is compared with well‐known schemes—proportional fairness (PF), exponential/proportional fairness (EXP/PF), and M‐LWDF. For performance evaluation, five performance metrics—average spectral efficiency and delay, quality of service (QoS) violation ratio, jitter, and Jain's fairness index—are investigated. The simulation results show that proposed schemes can outperform all the compared scheduling schemes.     

输入排队结构交换机分组调度研究

以决定分组调度算法的交换结构为基础,从协调,减少和隔离输入排队交换结构中输入输出竞争裁决冲突的角度,分别讨论了VOQ,CIOQ,CICQ结构中的分组调度问题,并以当前最新的调度算法为例加以说明,进行了定性分析和定量对比,指出了具体有待研究的问题。随后讨论了最近才开始研究的光电混合结构中的分组调度问题。最后从交换结构和算法两个方面探讨了今后的研究方向和发展趋势。     

一种适用于异步无线传感器网络的机会路由机制

无线传感器网络通常使用低占空比的异步睡眠调度来降低节点能耗。由于发送节点在接收节点醒来后才能向其发送数据,这将引入额外的等待时延。在最近的一些任播路由机制中,发送节点动态地选择最先醒来的候选节点转发数据,以最小化等待时延。但是,由于从最先醒来的候选节点到基站的时延可能并不低,任播路由机制并不一定能最小化端到端总时延。为此,提出了一种适用于异步无线传感器网络的机会路由机制,将路由决策建模为强马尔科夫过程,并根据最优停止理论推导出该过程一种简化的停止规则。仿真结果表明,节点到基站的最大端到端时延仅为基于地理位置的机会路由的68.5%。     

Joint packet scheduling and dynamic base station assignment for CDMA data networks

In current code division multiple access (CDMA) based wireless systems, a base station (BS) schedules packets independently of its neighbours, which may lead to resource wastage and the degradation of the system's performance. In wireless networks, in order to achieve an efficient packet scheduling, there are two conflicting performance metrics that have to be optimized: throughput and fairness. Their maximization is a key goal, particularly in next-generation wireless networks. This paper proposes joint packet scheduling and BS assignment schemes for a cluster of interdependent neighbouring BSs in CDMA-based wireless networks, in order to enhance the system performance through dynamic load balancing. The proposed schemes are based on sector subdivision in terms of average required resource per mobile station and utility function approach. The fairness is achieved by minimizing the variance of the delay for the remaining head-of-queue packets. Inter-cell and intra-cell interferences from scheduled packets are also minimized in order to increase the system capacity and performance. The simulation results show that our proposed schemes perform better than existing schemes available in the open literature. Copyright © 2007 John Wiley & Sons, Ltd.     

一种基于帧的快速包调度算法

本文提出了基于帧的近似排序包调度新算法（FASFQ），该算法用帧排序代替传统的包排序来处理G连接（预约带宽的连接）数据，并在帧与帧之间的空隙传送E型（best offort型）数据。理论分析和实验结果都表明，FASFQ算法与传统算法相比，在大大降低了排序复杂的同时，还能为G连接提供预约带宽，保证连接的独立性和公平性，避免E连接对G连接的冲击。     

Adaptive packet scheduling for the uplink traffic in IEEE 802.16e networks

IEEE 802.16e is a telecommunication standard technology designed to support a wide variety of multimedia applications. It defines five service classes, each one with its respective QoS requirements, but does not define the scheduling algorithm for these service classes. In this paper, an adaptive packet scheduling algorithm for the uplink traffic in IEEE 802.16e networks is proposed. This algorithm is designed to be completely dynamic, mainly in networks that use various modulation and coding schemes (MCSs). The algorithm is applied directly to the bandwidth request queues in the base station (BS) and aims at supporting the real‐time and non‐real‐time applications. Using a cross‐layer approach and the states of the bandwidth request queues in the BS, a new deadlines based scheme was defined, aiming at limiting the maximum delay to the real‐time applications. Moreover, this algorithm interacts with the polling management mechanisms of the BS and controls the periodicity of sending unicast polling to the real‐time and non‐real‐time service connections, in accordance with the QoS requirements of the applications. The proposed algorithm was evaluated by means of modeling and simulation in environments where various MCSs were used and also in environments where only one type of modulation was used. The simulations showed satisfactory results in both environments. Copyright © 2012 John Wiley & Sons, Ltd.     

无线网络中的分组调度算法

探讨了将有线网络的分组调度算法引入无线网络需要改进的事项,分析了公平排队算法,建立了一个基本的无线分组调度模型,并综述了一些目前存在的无线分组调度算法。     

Analysis of M-LWDF fairness and an enhanced M-LWDF packet scheduling mechanism

Modified largest weighted delay first(M-LWDF)is a typical packet scheduling algorithm for supporting hybrid real-time services over wireless networks.However,so far,there is little literature available regarding the theoretic analysis of M-LWDF fairness.This paper gives a theoretic analysis of M-LWDF fairness,which shows that M-LWDF fairness is related to channel condition,packet’s arrival process and the ratio of quality of service(QoS)requirements of different service queues.Given service QoS requirements and other parameters related to channel model and packet’s arrival process,the fairness is merely related to the ratio of the number of users in the service queues.Based on the analysis,an enhanced M-LWDF algorithm(EM-LWDF)is proposed and demonstrated in this paper.EM-LWDF is strictly designed in light of the fairness criteria of QoS requirements,so its fairness is almost not related to the ratio of the number of users in the service queues,and the theoretical value of fairness index is equal to 1.Simulation results validate the theoretic analysis and show the effectiveness of EM-LWDF in improving fairness.     

GPRS中分组调度算法

主要讨论通用无线分组业务（GPRS）调度算法。首先介绍了一些常用分组调度算法，给出了GPRS中服务质量（QoS)定义和GPRS中选择分组调度算法原则，并根据对GPRS特性和三种算法性能的分析与比较，提出了一种新的基于延迟约束分组调度算法。通过仿真发现，新算法可在满足延迟要求基础上以较小复杂度获得比其余算法更高的资源利用率。     

数据分组网中自相似业务模型的研究进展

本文介绍了数据分组网络中业务模型的研究进展。数据分组网络中，传统的泊松或马尔科夫模型在描述网络业务的精确性方面有很大的不足，近年来发展的自相似（单元形）业务模型效果较好。最近，研究人员在实测网络业务数据的基础上提出的多分形模型，不但能很好地模拟网络业务的长相关性，还能表现其在小的时间尺度下的特性。本文简单介绍了单分形业务模型，然后对多分形业务模型进行了重点的阐述，对业务模型的研究进展做出了分析。     

Performance analyses of serial-mode multicasting scheme in optical packet switched networks

The serial-mode multicasting scheme (SM), which can achieve duplication, buffering, and serial export of optical multicast packets in Optical Packet Switched (OPS) networks, is experimentally studied in this paper. Based on the experimental results, several limitations of this scheme, such as the multicast latency and signal impairment, are discussed. In addition, its performance in OPS networks is investigated by computer simulations. From the simulation results, a conclusion can be drawn that compared with the parallel-mode multicasting scheme (PM) producing multiple simultaneous copies of the optical packets by an optical power splitter or other devices, the SM scheme can increase the multicast success ratio and reduce the multicast retransmission times at the costs of some signal impairments and some extra transmission latency.

Distributed opportunistic scheduling for MIMO underlay cognitive radio networks

Cognitive radio networks have emerged to improve the utilization of the scarce spectrum. In this paper, we propose a distributed resource allocation algorithm that allocates resources opportunistically to the secondary users in a multiple‐input multiple‐output environment. In order to reduce the complexity and cost, antenna selection schemes are employed to allow the secondary communication using a single radio frequency chain. The proposed algorithm is proved theoretically and using simulations, to give a performance very close to that of a centralized one with lower delay and overhead. Furthermore, we introduce two techniques for the proposed algorithm based on the allowable data rates referred to as limited and maximum rates. We derive closed‐form expression for the consumed power and tight upper bounds for the average throughput achieved by each technique. A comparison between the proposed techniques is also provided. Both simulations and analytical results show that the proposed algorithm achieves high throughput with low complexity. Moreover, the results show that the tightness of the bounds improves with the diversity order. Finally, the proposed techniques are compared with two suggested random schemes to investigate their effectiveness. Copyright © 2016 John Wiley & Sons, Ltd.     

异步光分组交换网的流量建模

研究了异步光分组交换网的流量特性，提出了网络流量的解析模型和近似模型。研究表明，在采用计时门限光分组组装算法的情况下，如输入IP流具有短程相关特性(ShortRangeDependent)，则光分组的到达间隔时间呈负指数分布，光分组的长度趋于高斯分布。     

An optimized scheduling scheme in OFDMA WiMax networks

This paper proposes an optimized scheduling scheme in OFDMA‐based WiMax networks to achieve both optimized system throughput and a complete QoS implementation for various types of traffic flows. Our scheduling scheme includes two components, one is the resource allocation for each user; the other is the QoS scheduling for various traffic sessions. Specifically an optimization problem is formulated to distribute all OFDMA channel resource among different competing users by exploiting the transmission adaption and multiuser diversity on each traffic channel. The optimized resource allocation can also be processed under different constraints to achieve different performance metrics. To ensure the WiMax QoS performance, we perform the resource allocation in a priority manner with respect to the different types of QoS requirements and get a desired transmission bandwidth for each user. Based on it we further schedule different traffic sessions at each user with respect to a proper admission control mechanism. The relevant solution and algorithms for our proposed scheduling scheme are presented in detail. Both the theoretical analysis and simulation results show that our scheme can achieve the key performance objectives such as complete QoS requirements, high channel transmission efficiency and optimal throughput over the whole OFDMA WiMax system. Copyright © 2009 John Wiley & Sons, Ltd.     

双服务器分组调度算法

分组调度算法对于确保分组交换系统的QoS具有重要意义。时延,公平性,计算复杂度是微量分组度算法的主要指标。本文提出了一种双服务器分组调度算法,该算法在两种不同的工作状态下分别采用两种服务规则决定分组的服务次序。其中一种服务规则用来确保分组的时延,另一种服务规则在时延得到保障的情况下对系统的公平性进行改善,这两种规则计算都不复杂。因此本文提出的算法具有时延低,公平性较好,计算复杂度低的特点。     

TD-HSUPA的自适应调度算法

提出了自适应分组调度的策略,使TD-HSUPA(high speed uplink packet access,高速上行分组接入)可以更加灵活地进行分组调度。在自适应调度算法中,系统进行调度算法的同时,在后台运用遗传算法找出更适合当前无线网络环境的权值。系统仿真表明,该算法可以灵活地处理各种网络环境。     

A preemption‐based scheduling algorithm for WiMAX networks

Several scheduling techniques were designed for the base station (BS) of IEEE 802.16e wireless interoperability of microwave access networks. However, depending on the BS scheduler alone to determine the servicing order of each connection might affect the accuracy of the scheduling process because the BS does not necessarily have enough up‐to‐date information about the current state of the connections at the subscriber station. In this paper, we propose a preemption‐based scheduling algorithm that focuses on improving the quality of service requirements of real‐time service flow classes. The proposed algorithm incorporates two schedulers, one at the BS and another one at the subscriber station. We have implemented and integrated the proposed algorithm with the network simulator NS2 using the Network and Distributed Systems Laboratory wireless interoperability of microwave access module. Simulation results have shown that the proposed approach outperforms other scheduling algorithms in terms of enhancing the throughput and the average delay of real‐time quality of service classes. Copyright © 2013 John Wiley & Sons, Ltd.