Power allocation and temporal fair user group scheduling for downlink NOMA

Non-Orthogonal Multiple Access (NOMA) has been proposed as a new radio access technique for cellular networks as an alternative to OMA (Orthogonal Multiple Access) in which the users of a group (pairs or triples of users in a group are considered in this paper) are allowed to use the wireless channel simultaneously. In this paper, for downlink single-input single-output SISO-NOMA, a heuristic power allocation algorithm within a group is first proposed which attempts to ensure that the users of a group benefit from simultaneous transmission equally in terms of achievable throughput. Moreover, a user group scheduling algorithm is proposed for downlink NOMA systems by which a user group is to be dynamically selected for transmission while satisfying long term temporal fairness among the individual contending users. The effectiveness of the proposed power allocation method along with the temporal fair scheduling algorithm for downlink NOMA is validated with simulations and the performance impact of the transmit power and the coverage radius of the base station as well as the number of users are thoroughly studied.

     

Adaptive Fair Subcarrier/Rate Allocation in Multirate OFDMA Networks: Radio Link Level Queuing Performance Analysis

This paper presents a semi-analytical methodology for radio link level performance analysis in a multirate "orthogonal frequency-division multiple-access" (OFDMA) network with adaptive fair rate allocation. Multirate transmission is assumed to be achieved through adaptive modulation, and fair rate allocation is based on the principle of generalized processor sharing to allocate the subcarriers adaptively among the users. The fair rate allocation problem is formulated as an optimization problem with the objective of maximizing system throughput while maintaining fairness (in terms of transmission rate) among the users. The "optimal" fair rate allocation is obtained by using the "Hungarian method." A heuristic-based approach, namely the "iterative approach," that is more implementation friendly is also presented. The throughput performance of the iterative fair rate allocation is observed to be as good as that of optimal fair rate allocation and is better than that of the static subcarrier allocation scheme. Also, the iterative fair allocation provides better fairness compared to that for each of the optimal and the static subcarrier allocation schemes. To this end, a queuing model is formulated to analyze radio link level performance measures such as packet dropping probability and packet transmission delay under the above rate allocation schemes. In this formulation, packet arrivals are modeled by the discrete Markov modulated Poisson process, which is flexible to model different types of traffic arrival patterns. The proposed framework for radio link level performance analysis of multirate OFDMA networks is validated by extensive simulations. Also, examples on the application of the proposed model for connection admission control and quality-of-service provisioning are illustrated     

A buffer management algorithm for improving up/down transmission congestion protocol fairness in IEEE 802.11 wireless local area networks

The fair allocation of the resources is an important issue in wireless local area network (WLAN) because all wireless nodes compete for the same wireless radio channel. When uplink and downlink transmission congestion protocol (TCP) flows coexist in WLAN, the network service is biased toward the uplink TCP flows, and the downlink TCP flows tend to starve. In this article, we investigate the special up/down TCP unfairness problem and point out that the direct cause is the uplink acknowledgement (ACK) packets occupy most buffer space of access point. We thus propose a buffer management algorithm to ensure the fairness among uplink and downlink TCP flows. In order to limit the greedy behavior of ACK packets, the proposed algorithm adjusts the maximum size of buffer allocated for the ACK packets. Analysis and simulation results show that the proposed solution not only provides the fairness but also achieves 10–20% lower queue delay and higher network goodput than the other solutions. Copyright © 2012 John Wiley & Sons, Ltd.     

无线自组网中基于多速率传输调度问题

为了研究无线自组网中多速率调度问题,首先将它模型化为一个优化问题,然后根据是否考虑节点缓冲区因素提出了两个多速率条件下的调度算法--HRFWICB和HRFWCB,它们的基本思想是在保证数据流基本公平性的前提下,优先调度高速率数据流来降低包的传输时间和延迟.实验结果证明,同Luo算法和GPPF算法相比,HRFWICB算法和HRFWCB算法能够明显地降低包的传输时间和延迟.     

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.     

Cross-Layer Radio Resource Allocation for Multicarrier Air Interfaces in Multicell Multiuser Environments

Packet scheduling over shared channels is one of the most attractive issues for researchers dealing with radio resource allocation in wireless networks as modern systems' different traffic types, with different application requirements, need to coexist over the air interface. Recently, attention has been attracted to multicarrier techniques and the application of cross-layer approaches to the design of wireless systems. In this paper, a radio access network using a multicarrier air interface is considered in a multicell multiuser context. We propose a new cross-layer scheduling algorithm that manages channel, physical layer, and application-related information; we compare its performance with a previously published cross-layer strategy and with simpler well-known channel-aware or channel-unaware techniques and then discuss its optimization. We investigate the performance in terms of perceived user quality and fairness in the presence of mixed realistic traffic composed of H.264 video streaming with tight bounds on the delay jitter and file transfer protocol (FTP) data. To support video traffic, application-suited buffer-management techniques are also considered in conjunction with scheduling, and link adaptation is implemented at the physical layer to better exploit channel fluctuations. The role of scheduling and resource-allocation functionalities are discussed. It is shown that the cross-layer strategy proposed guarantees the same performance obtained by the previously published algorithm while reducing complexity. Moreover, under heavily loaded conditions, the cross-layer scheduling strategy provides a significant gain with respect to simple channel-aware or channel-unaware techniques.     

Making transmission schedules immune to topology changes inmulti-hop packet radio networks

Transmissions scheduling is a key design problem in packet radio networks, relevant to TDMA and CDMA systems. A large number of topology-dependent scheduling algorithms are available, in which changes of topology inevitably require recomputation of transmission schedules. The need for constant adaptation of schedules to mobile topologies entails significant, sometime insurmountable, problems. These are the protocol overhead due to schedule recomputation, performance penalty due to suspension of transmissions during schedule reorganization, exchange of control message and new schedule broadcast. Furthermore, if topology changes faster than the rate at which new schedules can be recomputed and distributed, the network can suffer a catastrophic failure. The authors propose a robust scheduling protocol which is unique in providing a topology transparent solution to scheduled access in multi-hop mobile radio networks. The proposed solution adds the main advantages of random access protocols to scheduled access. Similarly to random access it is robust in the presence of mobile nodes. Unlike random access, however, it does not suffer from inherent instability, and performance deterioration due to packet collisions. Unlike current scheduled access protocols, the transmission schedules of the proposed solution are independent of topology changes, and channel access is inherently fair and traffic adaptive     

Cognitive radio network with coordinated multipoint joint transmission

Cognitive radio (CR) is considered to be a promising technology for future wireless networks to make opportunistic utilization of the unused or underused licensed spectrum. Meanwhile, coordinated multipoint joint transmission (CoMP JT) is another promising technique to improve the performance of cellular networks. In this paper, we propose a CR system with CoMP JT technique. We develop an analytical model of the received signal‐to‐noise ratio at a CR to determine the energy detection threshold and the minimum number of required samples for energy detection–based spectrum sensing in a CR network (CRN) with CoMP JT technique. The performance of energy detection–based spectrum sensing under the developed analytical model is evaluated by simulation and found to be reliable. We formulate an optimization problem for a CRN with CoMP JT technique to configure the channel allocation and user scheduling for maximizing the minimum throughput of the users. The problem is found to be a complex mixed integer linear programming. We solve the problem using an optimization tool for several CRN instances by limiting the number of slots in frames. Further, we propose a heuristic‐based simple channel allocation and user scheduling algorithm to maximize the minimum throughput of the users in CRNs with CoMP JT technique. The proposed algorithm is evaluated via simulation and found to be very efficient.     

A cross-layer framework for multi-layer-video multicast with QoS requirements in multirate wireless networks

We propose a cross-layer framework for efficient multi-layer-video multicast with rate adaptation and quality-of-service (QoS) requirements in multirate wireless networks. We employ time division multiple access at the physical layer to transmit different video layers' data. The multicast sender then dynamically regulates the transmission rate and time-slot allocation based on the channel state information (CSI) and loss QoS requirements imposed by upper protocol layers. Under our proposed cross-layer framework, we first design a rate adaptation algorithm to fulfill the diverse loss QoS requirements for all video layers while achieving high multicast throughput. We then develop a time-slot allocation scheme which synchronizes data transmission across different video layers. Also conducted are simulation results to validate and evaluate our designed adaptive multicasting schemes under the proposed cross-layer framework.     

Rate-Distortion Optimized Video Transmission Over DS-CDMA Channels with Auxiliary Vector Filter Single-User Multirate Detection

In this paper, we consider the rate-distortion optimized resource allocation for video transmission over multi-rate wireless direct-sequence code-division-multiple-access (DS-CDMA) channels. We consider the performance of transmitting scalable video over a multipath Rayleigh fading channel via a combination of multi-code multirate CDMA and variable sequence length multirate CDMA channel system. At the receiver, despreading is done using adaptive space-time auxiliary-vector (AV) filters. We propose a new interference cancelling design that uses just a single AV filter for single-user mutirate despreading. Our experimental results show that the proposed interference cancelling design has excellent performance in scalable video transmission over DS-CDMA systems that use a combination of multicode multirate and variable processing gain multirate CDMA. The proposed design takes advantage of the fact that single user's video data is transmitted using two spreading codes, one for the base layer and one for the enhancement layers, and of the fact that these spreading codes can have different processing gains. The proposed interference cancelling design is compared with two conventional single-user multirate CDMA receiver configurations, however now we use an AV filter rather than a simple matched filter. We also propose a resource allocation algorithm for the optimal determination of source coding rate, channel coding rate and processing gain for each scalable layer, in order to minimize the expected distortion at the receiver.     

一种提高802.11无线Ad Hoc网络公平性的新机制-FFMA

实现多个数据流对无线信道的公平共享是802.11无线Ad Hoc网络中的一个重要议题,但802.11DCF机制在无线Ad Hoc网络中存在严重的公平性问题,甚至有可能出现单个节点或数据流独占信道而其他节点和数据流处于"饥饿"状态的情况.论文提出了一种新颖的保证数据流间公平性的MAC层接入机制FFMA(Flow rate-based Fair Medium Access),通过公平调度和公平竞争的方式,FFMA能够在数据流间公平地分配信道带宽资源.仿真结果表明,在无线Ad Hoc网络中,FFMA可以在保证信道吞吐量的前提下取得远优于802.11 DCF的数据流间的公平性.     

Physical layer capture aware MAC for WLANs

The physical layer capture (PLC) effect occurs frequently in the real wireless deployment; when two or more nodes transmit simultaneously, a receiver can successfully decode the collided frame if the signal strength of one frame is sufficiently high enough. Although the PLC effect increases the channel utilization, it results in an unfair channel access among the wireless nodes. In this paper, we propose a PLC-aware media access control (MAC) algorithm that employs the average waiting time as a common control reference. It enables the nodes to converge to a fair channel access by changing one of the IEEE 802.11 enhanced distributed channel access parameters: contention window, arbitration interframe space, or transmission opportunity. We then find multiple control references that meet the fair channel access constraint and obtain the near-optimal reference that maximizes the overall throughput. Through ns-2 simulations and real in-door experiments using the universal software radio peripheral platform, we evaluate the fairness and throughput performance of the PLC-aware MAC algorithm.     

On the interference management in wireless multi-user networks

A study on interference management schemes in wireless multi-user networks is presented. We analyze the interference management problem in cellular networks and show that interference management is an optimization problem, for which we propose a general formulation. Using this general formulations we show that different interference management approaches are either exact or approximated solutions to this optimization problem. For each radio resource management technique, we provide a general overview and discuss its relation vis-a-vie other interference management techniques. As a case study, we then apply the proposed general formulation on the interference management in OFDM wireless networks and show that it results in a joint transmit scheduling and dynamic sub-carrier and power allocation scheme. A polynomial-time heuristic algorithm is also proposed to solve the formulated optimization problem. The distinguishing feature of the proposed scheme is that it gives in one shot, the transmission scheduling, the sub-carriers assigned to each user, and the power allocated to each sub-carrier, based on a fair and efficient framework while satisfying the delay requirements of real-time users.     

Self-coordinating localized fair queueing in wireless ad hoc networks

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose maximize-local-minimum fair queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.     

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.     

Optimized in-band control channel with channel selection scheduling and network coding in distributed cognitive radio networks

This article proposes an optimized in-band control channel scheme with channel selection scheduling algorithm and network coding based transmission paradigm in the distributed cognitive radio network (...     

A framework design for the next-generation radio access system

Extensive use of the Internet and huge demands for multimedia services via portable devices require the development of packet-based radio access systems with high transmission efficiency. Advanced radio transmission technologies have recently been proposed to achieve this challenging task. However, few researches have been reported on the design of an integrated system that can efficiently exploit the advantages of these transmission technologies. This paper considers the design of a packet-based cellular system for next-generation radio access. We propose a novel system framework that can incorporate various advanced transmission technologies such as link adaptation, opportunistic packet scheduling, channel coding, and multiantenna techniques. For efficient use of these technologies together, we first investigate the interoperability between these technologies by proposing a so-called cause and effect analysis. Based on this investigation, we design a differentiated-segments-based orthogonal frequency-division multiplexing system, called DiffSeg, to accommodate heterogeneous operating conditions in a seamless manner. Simulation results show that the proposed DiffSeg system can provide a nearly optimum performance with flexible configuration in a wide range of wireless channel conditions.     

A wireless ATM MAC protocol with combined hybrid ARQ and adaptive scheduling with analysis

A combined hybrid automatic repeat request (ARQ) error control and adaptive scheduling scheme is proposed for time-division multiple access/time-division duplex medium access control (MAC) protocols in wireless asynchronous transfer mode (ATM) networks. Specifically, with the aid of proper channel modeling, the performance of various error-control schemes is evaluated. Accordingly, type-II hybrid ARQ is chosen as the error recovery scheme to combat fading effects, while adaptive fair-queueing is designed to achieve a fair and efficient resource allocation in wireless channels. In particular, the weight of a connection used in the fair-queueing algorithm dynamically adapts in terms of varying channel conditions and the types of services. Various simulations are conducted in typical indoor wireless ATM networks. It is shown that the proposed scheme can achieve a high throughput and transfer reliability with minimized delay and cell loss rate when compared with the conventional MAC layer control.     

Adaptive opportunistic fair scheduling over multiuser spatial channels

We consider the problem of opportunistic fair scheduling (OFS) of multiple users in downlink time-division multiple-access (TDMA) systems employing multiple transmit antennas and beamforming. OFS is an important technique in wireless networks to achieve fair bandwidth usage among users, which is performed on a per-frame basis at the media access control layer. Multiple-transmit-antenna beamforming provides TDMA systems with the capability of supporting multiple concurrent transmissions, i.e., multiple spatial channels at the physical layer. Given a particular subset of users and their channel conditions, the optimal beamforming scheme can be calculated. The multiuser opportunistic scheduling problem then refers to the selection of the optimal subset of users for transmission at each time instant to maximize the total throughput of the system subject to a certain fairness constraint on each individual user's throughput. We propose discrete stochastic approximation algorithms to adaptively select a better subset of users. We also consider scenarios of time-varying channels for which the scheduling algorithm can track the time-varying optimal user subset. We present simulation results to demonstrate the performance of the proposed scheduling algorithms in terms of both throughput and fairness, their fast convergence, and the excellent tracking capability in time-varying environments.     

Radio resource metric estimation for a TDD‐CDMA system supporting wireless internet traffic

In this paper, the effect of wireless internet traffic on the functionality of a radio resource metric estimation (RME) applicable to a TDD‐CDMA system which incorporates a multirate transmission scheme (such as multicode and multislot) with simple call admission control algorithm is investigated. A solution for efficient inter‐working between the physical layer and the higher layers is proposed, a resource metric mapping function (RMMF) that can deliver information about the state of the current channel load condition by the monitoring of signal‐to‐interference ratio (SIR) bursts and also the availability of a code pool by estimating the mean and the standard deviation of SIR bursts. This function is defined and demonstrated by means of an average raw BER mapping diagram as a function of the mean and the standard deviation of SIR bursts according to the multirate transmission method. By using this kind of mapping function combined with throughput estimation, the radio resource allocation algorithm can successfully reflect the current interference and mobile radio channel characteristics. Copyright © 2004 John Wiley & Sons, Ltd.