An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

Prioritized channel assignment in a cellular radio network

Dimensioning procedures for prioritized channel assignment in a cellular radio network are considered. Under the cutoff priority discipline, the prioritized channel assignment procedures for a single cell and multicell system are formulated as nonlinear discrete capacity allocation problems. Exact incremental algorithms which efficiently solve the proposed problems are devised. They are based on the properties of the blocking probabilities of new calls and handoff calls. Given the number of available frequency channels together with the arrival rates and the grade of service (GOS) for both types of calls in each cell, algorithm SP1 generates an optimal channel assignment which ensures priority for handoff calls. Given the arrival rates and distinct GOSs for new and handoff calls, algorithm SP2 finds the minimum number of channels required in each cell. Algorithm MP extends algorithm SP1 to a multicell system and provides the prioritized channel assignment for all calls in the system. The algorithms are very fast and are appropriate for the fair allocation of frequency channels among cells     

A Novel Optimal Channel Partitioning Algorithm for Integrated Wireless and Mobile Networks

How to efficiently support multi-class services is a very important issue in integrated wireless and mobile networks because each type of services has distinct characteristics and quality of service (QoS) requirements. This paper presents an efficient algorithm for near optimal channel allocation when different types of services are to be provided in the next generation integrated wireless and mobile networks. We specifically propose a preemptive priority scheme for an integrated wireless and mobile network by first dividing channels into three independent groups and classifying traffic into four different types. The proposed system is modeled by a multi-dimension Markov chain model. Then such a model is used to obtain a set of relations that correlate performances with various system parameters. A novel recursive algorithm is developed to determine the minimal number of channels in each channel group that would be necessary to satisfy the QoS requirements. We also investigate the impact of load ratio for different types of traffic on channel assignment. Finally, we discuss some limitations of our approach and indicate possible future work. We believe that the partitioning scheme proposed in this paper can become a starting point for analysis of future integrated wireless and mobile networks.     

QoS‐Guaranteed Slot Allocation Algorithm for Efficient Medium Access in HR‐WPAN

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high‐rate wireless personal area network (HR‐WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable‐service interval‐based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR‐WPAN compared to existing schemes.     

异构无线网络资源管理与切换控制技术

随着通信技术的发展,新型业务逐渐增多,传统的通信网络无法满足各种业务之间巨大的性能需求差异,未来的通信网络逐渐向异构网络进行发展。针对异构网络中资源调配与垂直切换的问题,利用虚拟网络技术与资源虚拟化技术设计了异构网络中的无线资源管理方法,并设计了子网间垂直切换算法。该算法利用层次分析法与熵权法得到各网络参数的综合权值,加权得到各网络的效用值并依此选择最优网络。通过搭建系统平台验证了设计的异构无线网络的有效性,为后续异构无线网络的研究提供了参考。     

Opportunistic delay‐margin‐based resource allocation for next‐generation wireless networks

This paper studies and develops efficient traffic management techniques for downlink transmission at the base station (BS) of multi‐service IP‐based networks by combining quality‐of‐service (QoS) provision and opportunistic wireless resource allocation. A delay‐margin‐based scheduling (DMS) for downlink traffic flows based on the delays that each packet has experienced up to the BS is proposed. The instantaneous delay margin, represented by the difference between the required and instantaneous delays, quantifies how urgent the packet is, and thus it can determine the queuing priority that should be given to the packet. The proposed DMS is further integrated with the opportunistic scheduling (OPS) to develop various queueing architectures to increase the wireless channel bandwidth efficiency. Different proposed integration approaches are investigated and compared in terms of delay outage probability and wireless channel bandwidth efficiency by simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.     

FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks

In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of hops, the lower becomes the throughput. In this paper, a fair end-to-end bandwidth allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the medium access control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share proportional to a specified weight to each end-to-end traffic flow. This way traffic flows are served in a differentiated manner, with higher priority traffic flows being allocated more bandwidth on the average than the lower priority traffic flows. In fact, a node requests/grants bandwidth from/to its neighbors in a round-robin fashion where the amount of service depends on both the load on its different links and the priority of currently active traffic flows. If multiple channels are available, they are all shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations. It is shown that wireless resources are shared fairly among best-effort traffic flows, while multimedia streams are provided with a differentiated service that enables quality of service.     

An Elastic Sub-carrier and Power Allocation Algorithm Enabling Wireless Network Virtualization

Wireless mobile network virtualization enables physical mobile network operators (PMNO) to partition their network resources into smaller slices and assign each slice to an individual virtual mobile network operator and then manages these virtual networks in a more dynamic and cost-effective fashion. How a PMNO allocates resources to individual slices while ensuring resource elasticity is a key issue. This paper presents a resource allocation algorithm in such a network virtualization scenario where resource considered here includes both sub-carriers and transmission power. The overall algorithm involves the following two major processes: firstly to virtualize a physical wireless network into multiple slices each representing a virtual network, where resources are allocated elastically based on traffic loads and channel state information during virtualization; secondly, to carry out physical resource allocation within each virtual network (or slice). In particular the paper adopts orthogonal frequency division multiplexing as its physical layer to achieve more efficient resource utilization. A multi-step dynamic optimization approach is proposed to achieve sub-carrier allocation using binary integer programming and power allocation using nonlinear programming. The aim is to achieve the following design goals: virtual network isolation, and resource efficiency. The simulation results show that the above goals have been achieved.     

网络间智能业务分担算法

In recent years, wireless communication sys-tems have experienced tremendous growth in data traf-fic. Many capacity-enhancing techniques are applied to elevate the gap between the amount of traffic and net-work capacity, and more solutions are required to mini-mize the gap. Traffic allocation among multiple net-works is regarded as one of the most effective methods to solve the problem. However, current studies are una-ble to derive the quantity of traffic that each network should carry. An intelligent traffic allocation algorithm for multiple networks is proposed to obtain the optimal traffic distribution. Multiple factors affecting traffic dis-tribution are considered in the proposed algorithm, such as network coverage, network cost, user habit, service types, network capacity and terminals. Using evalua-tions, we proved that the proposed algorithm enables a lower network cost than load balancing schemes. A case study of strategy making for a 2G system refarming is presented to further illustrate the applicability of the pro-posed algorithm. We demonstrated that the new algorithm could be applied in strategy making for telecommunica-tion operators.     

无线mesh网络中可信协同信道资源分配策略

为了有效提升无线mesh网络信道资源的利用率和网络服务质量,提出基于可信协同的信道资源分配策略.针对节点自适应特点,引入博弈理论、建立节点的信誉机制以实现节点可信协同并优化信道分配结果.仿真实验分别对节点服务等级、网络收益结果作相应评价.实验结果发现节点服务等级对节点网络收益有直接影响,当协同服务等级达到3时,网络收益状况最佳,此时节点跳数与服务等级呈协同关系;对比经典协同算法,在相同网络拓扑环境下,可信协同信道资源分配策略分别是UACRR算法、DMP-MBA算法的1.04倍、1.069倍,明显占优.     

DiffServ resource allocation for fast handoff in wireless mobileInternet

The next-generation wireless networks are evolving toward a versatile IP-based network that can provide various real-time multimedia services to mobile users. Two major challenges in establishing such a wireless mobile Internet are support of fast handoff and provision of quality of service (QoS) over IP-based wireless access networks. In this article, a DiffServ resource allocation architecture is proposed for the evolving wireless mobile Internet. The registration-domain-based scheme supports fast handoff by significantly reducing mobility management signaling. The registration domain is integrated with the DiffServ mechanism and provisions QoS guarantee for each service class by domain-based admission control. Furthermore, an adaptive assured service is presented for the stream class of traffic, where resource allocation is adjusted according to the network condition in order to minimize handoff call dropping and new call blocking probabilities     

宏微协同组网下基于小区分簇的联合传输与无线资源分配

针对宏微协同组网下小区间无线资源管理问题,文章提出一种大规模多入多出系统下基于微小区分簇的联合传输和动态频谱分配策略,该策略分两步执行以优化网络加权和速率.首先,所提算法根据各用户当前的信道状态执行微小区分簇,以尽可能地降低小区间干扰,提升系统容量.接着,宏基站和各微小区簇根据所服务用户当前的业务请求信息分别为其动态分配子载波,以最大化网络加权和速率,并提升资源利用率.仿真结果显示,该文提出的微小区分簇和动态频谱分配策略能在尽可能降低宏微协同组网中用户间干扰的同时,有效地提升系统吞吐量.     

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

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

Deep and robust resource allocation for random access network based with imperfect CSI

A deep and robust resource allocation framework was proposed for the random access based wireless networks,where both the communication channel state information (C-CSI) and the interference channel state information (I-CSI) were uncertain.The proposed resource allocation framework considered the optimization objective of wireless networks as a learning problem and employs deep neural network (DNN) to approximate optimal resource allocation policy through unsupervised manner.By modeling the uncertainties of CSI as ellipsoid sets,two concatenated DNN units were proposed,where the first was uncertain CSI processing unit and the second was the power control unit.Then,an alternating iterative training algorithm was developed to jointly train the two concatenated DNN units.Finally,the simulations verify the effectiveness of the proposed robust leaning approach over the nonrobust one.     

基于用户QoS的网络资源分配策略研究

针对5G网络在网络资源分配存在的问题,从用户业务QoS等级角度提出基于贝叶斯模型的网络资源优化分配策略模型。在对用户业务QoS等级划分的基础上采用优先节点自主控制策略进行网络资源分配,通过构建贝叶斯模型评价网络状态并进行动态学习推理,指导网络优先节点的控制决策,实现优先节点对最佳信道的优先选择。实验表明,与基于信道容量的信道资源分配策略相比,本文的策略在网络总体容量和网络公平性上具有更好的表现,能够更好满足异构网络的实际需求。     

A game-based algorithm for fair bandwidth allocation in Fibre-Wireless access networks

Fibre-Wireless (FiWi) access networks have been proposed as flexible and cost-effective solutions for future access networks. At the wireless mesh section, wireless routers have to forward both local traffic from directly connected users and foreign traffic from neighbour wireless routers. How to allocate resources to local and foreign traffic at each router in a balanced way, while avoiding starvation of routers requiring less resources, is a fundamental issue that must be solved so that new services emerge. Here, we develop a repeated game framework for bandwidth allocation and propose an algorithm that allocates bandwidth in a fair manner. The algorithm is able to detect over claiming routers and avoid possible denial of service that these may cause to others. Moreover, unfruitful use of resource is prevented, avoiding the forwarding of packets that would be dropped at some point later in the path, and queueing delay conditions are kept similar among local and foreign traffic. These fair network conditions open way for QoS support since it is easier to ensure the operationality of services.     

电力应急通信非合作博弈资源分配方法

电力应急通信Mesh网络承载单兵装备业务能力受到现场无线信道质量、节点通信资源抢占等影响,不合适的信道资源分配将降低Mesh网络整体服务质量。在构建Mesh拓扑网络的基础上,提出考虑单兵装备业务类型的非合作博弈资源分配方法,构建节点报价-业务通信-节点惩罚机制,实现无线信道资源合理分配。仿真结果表明,在明确接入单兵装备业务类型的前提下进行节点报价和信道资源分配,能够提升Mesh网络整体服务质量,为应急作业效率优化提升提供参考。     

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

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