Interference management using basestation coordination in broadband wireless access networks

This paper proposes a transmission‐scheduling algorithm for interference management in broadband wireless access networks. The algorithm aims to minimize the cochannel interference using basestation coordination while still maintaining the other quality of service (QoS) requirements such as packet delay, throughput and packet loss. The interference reduction is achieved by avoiding (or minimizing) concurrent transmission of potential dominant interferers. Dynamic slot allocation based on traffic information in other cells/sectors is employed. In order to implement the algorithm in a distributed manner, basestations (BSs) have to exchange traffic information. Both real‐time and non‐real‐time services are considered in this work. Results show that significant reduction in the packet error rate can be achieved without increasing the packet delay at low to medium loading values and with a higher but acceptable packet delay at high loading values. Since ARQ schemes can also be used for packet error rate reduction, we compare the performance of the proposed scheme with that of ARQ. Results indicate that although ARQ is more effective in reducing packet error rate, the proposed algorithm incurs much less packet delay particularly at medium to high loading. Copyright © 2006 John Wiley & Sons, Ltd.     

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.     

Network queue scheduling algorithm based on self-similar traffic level grading prediction

Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network.In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst,improve the transmission capacity of different priority services,and guarantee the service quality requirements,a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed.A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed,and the service order of the queue according was determined to the service priority and queue waiting time,so as to reduce the queuing delay and packet loss rate.The simulation results show that the P-DWRR algorithm can reduce the queueing delay,delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network,and its performance is better than that of DWRR and VDWRR.     

终端通信接入网网络资源分配策略研究

论文在不改变现有国家电网通信网中各种体制网络结构的前提下,通过增加网络融合网关和终端接入网关两种功能实体,提出了一种双通信代理机制的异构网协同融合传输方案,并由此设计实现了基于时延的负载感知的异构网络资源分配算法,实现了多业务综合接入及多网络动态协同环境下的网络资源分配技术。数据分析表明该算法在平均时延、网络开销及丢包率等方面优于均匀分配算法、定时反馈的负载感知流量分配算法。     

Minimizing the Number of Multicast Transmissions in Single-Hop WDM Networks

The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources.     

Low latency handover scheme for 5G dual-connectivity scenario

A novel handover scheme was proposed for the secondary node (SN) unchanged 5G dual-connectivity scenarios.In the proposed novel scheme,the SN connection was maintained for data packet transmission during the handover,however,both the main node (MN) and the SN were completely disconnected in the legacy scheme.The transmission delay during handover was decreased greatly by the proposed scheme.Firstly,the legacy handover scheme was analyzed and its deficiency was figured out.Then,the novel mechanism’s signaling interaction was elaborated and the time sequence models for the novel scheme and the legacy scheme were further established.Finally,based on the time sequence model,the performance evaluation processes were carried out in terms of mathematical modeling and experimental simulations.The analysis results demonstrate that the proposed novel scheme reduces the single packet transmission delay,the average transmission delay and the total transmission delay,and has good performance advantages.     

Ordered Packet Length Based Groupwise Transmission Scheme for Rate Scheduling in Burst Switching DS/CDMA System

This paper proposes a new packet rate scheduling scheme for a non-real time data services over the uplink of a burst switching based direct sequence code division multiple access (DS/CDMA) system to support integrated voice/data services. We consider the most general form of optimization problem formulation to determine the optimal number of transmission time groups along with their data rates, which minimizes the average packet transmission delay. An ordered packet length based groupwise transmission (OLGT) scheme is proposed as a simple heuristic solution to this problem, and we present some analytical results for performance comparison with other possible schemes.     

Power allocation and transmission scheduling for a network with bidirectional relaying links

In this paper, we study packet transmission scheduling for a network with bidirectional relaying links, where the relay station can use network coding to combine packets to multiple receivers and opportunistically decide the number of packets to be combined in each transmission. Two cases are considered, depending on whether nodes are allowed to overhear transmissions of each other. A constrained Markov decision process is first formulated with an objective to minimize the average delay of packet transmissions, subject to the maximum and average transmission power limits of the relay node. The complexity for solving the constrained Markov decision process (MDP) is prohibitively high, although the computational complexity for the no‐overhearing case can be greatly reduced. Heuristic schemes are then proposed, one applies to the general case, and another applies to only the no‐overhearing case. Numerical results demonstrate that the heuristic schemes can achieve close‐to‐optimum average packet transmission delay, and furthermore, the second scheme achieves lower maximum delay while keeping the same average packet transmission delay and relay node power consumption as the first one. Copyright © 2015 John Wiley & Sons, Ltd.     

MIMO广播信道中联合多用户速率和延迟约束调度的研究

该文给出了一种多入多出高斯广播信道中具有延迟约束的多用户无线数据包的传输方案。首先,在信道的QR分解及脏纸编码基础上,通过贪婪算法获取多用户分集与包延迟约束之间的有效结合。其次,将包到达速率、可达服务速率、用户数以及传输天线数构成一优化问题,得到最佳的用户组合及调度周期。最后,在不同用户数及发射天线数情况下对该方案进行了性能仿真,仿真结果表明:在满足包传递最小延迟等待要求的同时,得到了传输容量的最大化。     

Performance improvements of HCCA scheduling in V2R environments

This paper addresses the issue of real‐time data transmission in vehicles to roadside environment by the hybrid coordination function controlled channel access (HCCA) scheme with Institute of Electrical and Electronics Engineers 802.11p protocol. The HCCA is one of the medium access protocols specified in 802.11p standard, which uses a polling scheme similar to the point coordination function to provide a reliable QoS. In this paper, we improve the HCCA polling scheme and design a new data transmission scheduling method. We also prepared a mathematical model to systematically evaluate the performance of the HCCA in terms of average delay. Moreover, we analyze the factors that could impact the average delay, throughput, and packet loss rate as well. The simulation results are compared with the original scheme specified in the standard. The simulation results demonstrate that the proposed delay model could estimate the average delay of the HCCA with a high precision, whereas the proposal of the enhancement of the HCCA has lower delay, lower loss rate, and higher throughput than the one specified in the standard. Copyright © 2013 John Wiley & Sons, Ltd.     

An Improved Maximum C/I Scheduling Algorithm Combined with HARQ

1　IntroductionAsisknown ,theasymmetryinuplinkanddownlinktrafficisbecomingakeyproblemin 3Gandthatbeyond .InWWWbrowsingorFTPdown loadingservice ,trafficindownlinkisusuallymuchgreaterthanthatinuplink .Soitisincreasinglypop ulartoresorttoHSDPA ,whichisbasedontheDownlinkShareChannelandaimstoimprovethespectralefficiencybysharingthephysicalchannelamongusers.Howtoschedulemanyuserswithdi verseserviceswillhaveanimportanteffectonthesystem performance[1 - 5] .Althoughmanyschedul ingalgorithmshaveb…     

EPON和WiMAX融合架构下带宽分配和调度机制的研究

以太网无源光网络(EPON)和IEEE 802.16(WiMAX)的融合网络在固定移动混合接入网中被认为是很有前景的接入方式.文中提出了3种WiMAX无线网络与EPON网络系统融合架构,融合系统同时具有光网络的高带宽和无线网络的灵活性.为了在接入网中支持QoS,本文为融合结构提出了一种动态带宽分配算法(DBA)和调度机...     

A Cross-Layer Delay Differentiation Packet Scheduling Scheme for Multimedia Content Delivery in 3G Satellite Multimedia Systems

The design of efficient packet scheduling algorithms, which play a key role in the radio resource management (RRM), is crucial for the multimedia delivery in the satellite digital multimedia broadcasting (SDMB) system. In this paper, a novel packet scheduling scheme, which uses the cross-layer approach in its design, is proposed. This scheme comprises a new service prioritization algorithm and a dynamic rate matching based resource allocation algorithm, aimed at utilizing both the applications' QoS attributes and the physical layer data rate information. The performance of the proposed scheme has been evaluated via simulation. In comparison with existing schemes, the proposed scheme achieves significant performance gain on delay, delay variation and physical channel utilization.      

无人机短包通信中基于NOMA传输的安全性能分析

针对物联网（IoT）通信的低延时需求,为了保证数据传输的灵活性,本文构建一种基于短包传输的无人机（UAV）通信网络。由于非正交多址接入（NOMA）技术能够增加可服务的地面用户数量,故将该技术应用到无人机短包通信（UAV-SPC）系统中可以解决多用户的安全传输问题。与正交多址（OMA）技术相比,NOMA可有效提高用户接入公平性和频谱利用率,因此被广泛用于下行链路的通信传输。为解决复杂的安全传输问题,首先证明在功率和译码错误率约束的条件下,分别存在最优的功率分配,数据传输包长和系统传输比特数使目标用户的平均安全吞吐量最大。在此基础上,通过本文所提算法得到安全传输问题的优化解。实验结果验证了该算法的稳定性和可行性。此外,与基准方案相比,本文所提方案可有效降低短包传输的通信时延,提高系统中目标用户的平均安全吞吐量。     

基于VirtualClock调度算法的接入允许控制算法

本文针对于Virtual Clock调度算法提出了一种基于生存期的接入允许控制算法.原有Virtual Clock的接入允许控制算法没有考虑到系统中在有连接建立和拆除的情况下如何动态分配带宽,致使分组的时延无法确保.本文从Virtual Clock算法的参考模型出发,对带宽释放和分配的时机作出规定.理论分析和仿真结果表明,本文的算法能够保证Virtual Clock算法的时延特性.本文的思路对于其他调度算法的接入允许算法也具有参考意义.     

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

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

四表集抄通信网络虚拟化方案及组网算法研究

为了实现四表(水,电,气,热)集抄行业之间的业务数据隔离,提升本地网络的稳定性和覆盖能力,该文提出四表集抄通信网络虚拟化方案。该方案采用虚拟接入点名称(APN)技术以及软件定义网络(SDN)切片技术构成端到端隔离的业务数据采集通道;采用微功率无线和低压电力线载波构成实时可靠的本地双模虚拟网络,进一步提出基于全局链路状态和分层迭代的组网算法。仿真及现场验证结果表明,该方案降低了采集数据的丢包率和传输时延,提高业务支撑能力,保障行业之间的业务数据隔离,提升通信网络基础设施复用能力。     

Hopfield neural‐network‐based dynamic resource allocation scheme for non‐real‐time traffic in wireless networks

Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non‐real‐time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The scheme exploits the fast response time of HNN for solving NP optimization problems and has been particularized for the downlink transmission in a UMTS system, although it could be easily extended to any other radio access technology. The new DRA scheme follows a delay‐centric approach, since it maximizes the overall system resource utilization while minimizing the packet delay. Simulation results confirm that the proposed HNN‐based DRA scheme is effective in supporting different types of NRT services, while achieving efficient utilization of radio resources. Copyright © 2008 John Wiley & Sons, Ltd.     

分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。     

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.