准静止状态下的高空平台实时业务信道分配

受平台准静止状态的影响,高空平台（ HAPS)通信网络内存在大量的切换呼叫,且业务量动态变化。 HAPS网络可传输多种业务,其中实时业务在切换过程中具有较高的时延要求。通过为切换呼叫预留信道可降低平台不稳定对服务质量（ QoS)造成的影响。在基于服务优先级的多业务信道分配算法基础上,重点对实时业务的信道分配算法进行改进,提出了一种基于概率的预留信道借用策略。该算法可根据网络内业务量的实时统计数据控制新呼叫业务的准入。仿真结果表明：与固定预留信道算法和门限预留信道算法相比,该算法能够适应网络内业务量的动态变化,在保证切换呼叫掉线率满足期望值的条件下提升系统的整体性能,降低平台不稳定造成的性能损失。     

Scheduling with base station diversity and fairness analysis for the downlink of CDMA cellular networks

Efficient packet scheduling in CDMA cellular networks is a challenging problem due to the time variant and stochastic nature of the channel fading process. Selection diversity is one of the most effective techniques utilizing random and independent variations of diverse channels to improve the performance of communication over fading channels. In this paper, we propose two packet scheduling schemes exploiting base station selection diversity in the downlink of CDMA cellular networks. The proposed schemes rely on the limited instantaneous channel state information (CSI) to select the best user from the best serving base station at each time slot. This technique increases the system throughput by increasing multiuser diversity gain and reducing the effective interference among adjacent base stations. Results of Monte Carlo simulations are given to demonstrate the improvement of system throughput using the proposed scheduling schemes. In addition, we investigate fairness issue of wireless scheduling schemes. Due to different characteristics of wireless scheduling schemes, the existing fairness indexes may result in misleading comparison among different schemes. We propose a new fairness index to compare the overall satisfaction of the network users for different scheduling schemes. Copyright © 2006 John Wiley & Sons, Ltd.     

A two stage approach for channel transmission rate aware scheduling in directional mmWave WPANs

Millimeter wave (mmWave) communications in 60 GHz band have become a hot topic in wireless communications. New medium access control (MAC) protocols are needed because of the fundamental differences between mmWave communications and existing other communication systems. In mmWave wireless personal area networks, the channel transmission rates of links vary significantly because of the difference in the distance between nodes, the accuracy of beamforming, and the existence of obstructions. Owning to the directivity of mmWave links, spatial reuse should be exploited to improve network capacity. In this paper, we develop a channel transmission rate aware directional MAC protocol, termed RDMAC, in which both the multirate capability of links and spatial reuse are exploited to improve network performance. RDMAC has two stages. The first stage measures the channel transmission rates of links, and a heuristic algorithm is proposed to compute near‐optimal measurement schedules with respect to the total number of measurements. The second stage accommodates the traffic demand of links, and a heuristic transmission scheduling algorithm is proposed to compute near‐optimal transmission schedules with respect to the total transmission time. Simulations under various traffic modes show that compared with existing protocols, RDMAC has lower network latency, higher network throughput, and also a good fairness performance. Copyright © 2014 John Wiley & Sons, Ltd.     

码分多址反向链路调度算法与处理时延的关系

研究了码分多址反向链路数据传输采用不同的调度算法受系统处理时延影响的程度，这种影响与信道估计误差有关，也与传输速率的更新时间有关。通过对CDMA2000的动态系统级仿真，其结果显示反向链路上的最大速率与轮询结合的算法、最小路径损耗算法、以及轮询算法在有处理时延时吞吐量性能都会降低，其中最大速率与轮询结合的算法降低的程度最小，轮询算法降低程度最大，最小路径损耗算法介于中间。性能降低也与快衰信道类型相关，信道变化越快算法性能受到的影响越大。提出了一种对调度算法的改进方法，即根据移动台处理时延的变化，为近期处理时延较小的移动台分配更多的资源，结果表明该方法改善了系统吞吐量。     

Temporal fairness guarantee in multi-rate wireless LANs for per-flow protection

Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases. This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research Laboratory project of Ministry of Science and Technology, 2004, Korea.     

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.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

基于HSDPA的信道相关分组调度算法研究

针对HSDPA(高速下行分组接入)系统中几种支持非实时业务的经典分组调度算法Max C/I(最大载干比)和PF(正比公平)算法缺乏系统公平性的问题,提出一种基于HSDPA的快速公平分组调度算法。此算法在保证信道瞬时条件和系统吞吐量的前提下,旨在为那些平均吞吐量低于某一阈值的用户提供优先被服务的机会。仿真结果表明,此算法较之Max C/I和PF算法能够保证用户间的长期公平性。     

Prediction‐based MAC‐layer sensing in cognitive radio networks

We consider a cognitive radio network which coexists with multiple primary users (PUs) and secondary users (SUs) transmit over time‐varying channels. In this scenario, one problem of the existing work is the poor performances of throughput and fairness due to variances of SUs' channel conditions and PUs' traffic patterns. To solve this problem, we propose a novel prediction‐based MAC‐layer sensing algorithm. In the proposed algorithm, the SUs' channel quality information and the probability of the licensed channel being idle are predicted. Through the earlier predicted information, we schedule the SUs to sense and transmit on different licensed channels. Specifically, multiple significant factors, including network throughput and fairness, are jointly considered in the proposed algorithm. Then, we formulate the prediction‐based sensing scheduling problem as an optimization problem and solve it with the Hungarian algorithm in polynomial time. Simulation results show that the proposed prediction‐based sensing scheduling algorithm could achieve a good tradeoff between network throughput and fairness among SUs. Copyright © 2014 John Wiley & Sons, Ltd.     

按需轮循的蓝牙微微网调度算法与性能评估

提出了一种低时延、高信道利用率与公平性好的按需轮循的蓝牙微微网调度算法.首先通过速率估计过程计算出上行链路分组到达率的估计值,然后在主调度过程中分别计算各链路对自上次轮循时刻到当前时刻的分组到达数量的估计值与等待时间,根据提出的动态轮循选择规则选出优先度最高的链路对进行轮循,再根据自适应轮循间隙规则计算出下次轮循应该进行的时间.分别在混合、下行与上行三种传输模型的仿真中进行了与其他经典算法的性能比较.结果表明:算法在前两种传输模型中具有最佳的整体性能,尤其是时延分别降低了24.1%与41.4%以上,在第三种传输模型中也具有较佳的整体性能.该算法效率高、实现复杂度低,可应用于蓝牙与其他无线网络.     

The Effect of On-Off Scheduling to the Required Transmit Power in Systems with Fast Power Control

Physical layer channel-aware scheduling may significantly improve coverage and throughput of IP based services in wireless cellular networks, and the feasibility of such schedulers is actively studied within 3G and 4G systems. A channel-aware scheduler requires access to instantaneous channel state information in order to direct transmission to users with favorable channel conditions. In frequency division duplex (FDD) systems, this requires a fast feedback channel between mobile and base stations, and the overhead of the feedback control channel should be kept as low as possible.In this paper, we study the effect of control channel overhead to on-off scheduling (OOS) when fast transmit power control is applied in data and control channels. On-off scheduling is a simple channel-aware scheduling algorithm, where transmission to a user is suspended if the transmit power exceeds a given threshold. On-off scheduling is applied on the data channel while control channel is always on so that the scheduler is able to obtain channel state information from active users. The gain of OOS strongly depends on the power ratio between control and data channels, and increased interference due to control signaling and decreased interference due to channel-aware scheduling should be jointly considered in system design. Gains in the required transmit power are translated into gains in coverage and capacity assuming WCDMA parameters, and the results can be applied, e.g., when designing scheduling algorithms and corresponding signaling formats for WCDMA uplink.     

Joint optimal channel base station and power assignment forwireless access

The provision of personal communication services is the goal of the evolution of integrated communication systems. The fundamental problem underlying any phase (hand-off, new connection, etc.) of a dynamic resource allocation algorithm in a wireless network is to assign transmission powers, forward (downstream) and reverse (upstream) channels, and base stations such that every mobile of the system can establish a connection. Each one of these problems separately has been studied extensively. We consider the joint problem in a system with two base stations. An algorithm that achieves the optimal assignment is provided. It involves the computation of a maximum matching in a graph that captures the topological characteristics of the mobile locations. The traffic capacities, in terms of expected number of connections per channel, of the forward and reverse channel are obtained and compared, for both cases of power control and nonpower control. It turns out that when the transmission power is fixed, the capacities of the forward and reverse channel are different, while when power control is allowed they are the same. For systems with two mobiles the capacities of the forward and reverse channels are studied analytically. Finally, several versions of the two-way channel assignment problem are studied     

Optimal backpressure routing for wireless networks with multi-receiver diversity

We consider the problem of optimal scheduling and routing in an ad-hoc wireless network with multiple traffic streams and time varying channel reliability. Each packet transmission can be overheard by a subset of receiver nodes, with a transmission success probability that may vary from receiver to receiver and may also vary with time. We develop a simple backpressure routing algorithm that maximizes network throughput and expends an average power that can be pushed arbitrarily close to the minimum average power required for network stability, with a corresponding tradeoff in network delay. When channels are orthogonal, the algorithm can be implemented in a distributed manner using only local link error probability information, and supports a “blind transmission” mode (where error probabilities are not required) in special cases when the power metric is neglected and when there is only a single destination for all traffic streams. For networks with general inter-channel interference, we present a distributed algorithm with constant-factor optimality guarantees.     

HSDPA系统中一种感知用户终端缓存状态的QoE保障调度算法

针对HSDPA系统中现有调度算法无法满足实时业务QoE的缺点,提出一种保障实时业务QoE的调度算法。该算法根据用户反馈的信道质量信息和在基站获取到的用户终端缓存状况信息。确定用户的优先级并据此调度优先级最高的用户,进而保证实时业务的吞吐量和QoE需求。仿真结果表明,与轮询调度算法、比例公平调度算法相比,提出的调度算法不仅能够保证实时业务的QoE需求,而且能满足非实时业务基本的吞吐量需求。     

802.11ax系统中基于传输延迟的多用户调度与资源分配算法

IEEE 802.11ax系统中站点(Station,STA)数量众多和潜在的高数据包冲突率导致无线局域网通信效率显著降低,本文针对上行多用户传输中的无效帧填充问题,以每轮传输中用户组的传输延迟为优化目标,提出一种多用户调度和资源分配算法.基于OFDMA上行调度接入中动态传输时间的帧交互方案,接入点(Access Po...     

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long‐term quality of service (QoS) constraints for non‐realtime data users and short‐term QoS constraints for realtime multimedia users in multiclass service high‐speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi‐constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.     

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.     

URLM: Utilising reinforcement learning to schedule subflows in MPTCP

Parallel transmission in multiple access networks using MultiPath TCP (MPTCP) greatly enhances the throughput. However, critical packet disorder is commonly observed due to traffic fluctuation and path diversity. Although several predictive scheduling algorithms have been proposed to solve this problem, they cannot accommodate prediction accuracy and real-time adaptation simultaneously in a dynamic network environment. The time overhead in modifying scheduling parameters to adapt to network changes leads to performance degradation in throughput and packet disorder. In this study, we propose a scheduling algorithm called U tilising R einforcement L earning to Schedule Subflows in M PTCP (URLM). We apply reinforcement learning to select an optimal scheduling parameter in real time, which brings significant time benefits for modifying the parameters. The simulation comparison experiments show that URLM reduces the average number of out-of-order packets and the time overhead in adapting to network changes while improving global throughput.     

Wide-band TD-CDMA MAC with minimum-power allocation and rate- and BER-scheduling for wireless multimedia networks

A wide-band time-division-code-division multiple-access (TD-CDMA) medium access control (MAC) protocol is introduced in this paper. A new minimum-power allocation algorithm is developed to minimize the interference experienced by a code channel such that heterogeneous bit-error rate (BER) requirements of multimedia traffic are satisfied. Further, from analysis of the maximum capacity of a time slot, it is concluded that both rate and BER scheduling are necessary to reach a maximum capacity. Based on the new minimum-power allocation algorithm as well as on rate and BER scheduling concepts, a new scheduling scheme is proposed to serve packets with heterogeneous BER and quality of service (QoS) requirements in different time slots. To further enhance the performance of the MAC protocol, an effective connection admission control (CAC) algorithm is developed based on the new minimum-power allocation algorithm. Simulation results show that the new wide-band TD-CDMA MAC protocol satisfies the QoS requirements of multimedia traffic and achieves high overall system throughput.     

Ad hoc网络中基于多波束天线的集中式低时延调度算法

UxDMA算法是一种高效的集中式算法,是用于时分多址、频分多址和码分多址信道分配的统一算法。在UxDMA的基础上,利用多波束天线的多波束形成能力,针对低时延定向ad hoc网络提出了一种集中式调度算法——CLSM(Centralized Low-delay Scheduling Algorithm Based on Multi-beam Antennas)。CLSM通过不同时延等级限制的报文来比较着色后发送链路的优先级,优先选择高优先级链路传输。通过仿真验证了CLSM的性能：与UxDMA相比,该算法在多时延限制的发送端调度中表现出了更好的吞吐量和时延性能。