On the peak-to-average power ratio reduction in mobile WiMAX: A discrete cosine transform matrix precoding based random-interleaved orthogonal frequency division multiple access uplink system

Mobile worldwide interoperability for microwave access (Mobile WiMAX) is a broadband wireless solution that enables the convergence of mobile and fixed broadband networks through a common wide area radio-access (RA) technology and flexible network architecture. Since January 2007, the IEEE 802.16 working group (WG) has been developing a new amendment of the IEEE 802.16 standard i.e. IEEE 802.16 m as an advanced air interface to meet the requirements of ITU-R/IMT-Advanced for 4 G systems. The mobile WiMAX air interface adopts orthogonal frequency division multiple access (OFDMA) as multiple access technique for its uplink (UL) and downlink (DL) to improve the multipath performance. All OFDMA based networks, including mobile WiMAX experiences the problem of high peak-to-average power ratio (PAPR). This paper presents: Discrete-Cosine transform matrix (DCTM) precoding based random-interleaved OFDMA uplink system and selecting mapping (SLM) based DCTM precoded random-interleaved OFDMA uplink system respectively, for PAPR reduction in mobile WiMAX systems. PAPR of the proposed systems is analyzed with the root-raised-cosine (RRC) pulse shaping to keep out of band radiation low and to meet the transmission spectrum mask requirement. Simulation results show that, the proposed systems have low PAPR than the Walsh-Hadamard transform (WHT) precoded random-interleaved OFDMA uplink systems and the conventional random-interleaved OFDMA uplink systems. Symbol-error-rate (SER) performance of the proposed system is also better than the conventional random-interleaved OFDMA uplink systems and at par with WHT based random-interleaved OFDMA uplink systems. Good improvement in PAPR and SER offered by the proposed systems can notably reduce the cost and complexity of the transmitter.     

Joint subcarrier,code, and power allocation for parallel multi-radio access in heterogeneous wireless networks

In the heterogeneous wireless networks, it has been proved that the joint spectrum and power allocation can achieve network diversity gains for parallel multi-radio access in theory. This article aims to develop an effective and practical algorithm of joint subearrier, code, and power allocation for parallel multi- radio access of the downlink in heterogeneous wireless networks （e.g., CDMA and OFDMA）. Firstly, we propose a unified framework to formulate the subcarrier, code, and power allocation as an optimization problem. Secondly, we propose a resource element （subcarrier and code） scheme based on the threshold type. Simulation results show that the proposed scheme outperforms the existing algorithm for considered wireless scenarios.     

A Priority-aware Frequency Domain Polling MAC Protocol for OFDMA-based Networks in Cyber-physical Systems

Wireless networking in cyber-physical systems (CPSs) is characteristically different from traditional wireless systems due to the harsh radio frequency environment and applications that impose high real-time and reliability constraints. One of the fundamental considerations for enabling CPS networks is the medium access control protocol. To this end, this paper proposes a novel priority-aware frequency domain polling medium access control (MAC) protocol, which takes advantage of an orthogonal frequency-division multiple access (OFDMA) physical layer to achieve instantaneous priority-aware polling. Based on the polling result, the proposed work then optimizes the resource allocation of the OFDMA network to further improve the data reliability. Due to the Non-polynomial-complete nature of the OFDMA resource allocation, we propose two heuristic rules, based on which an efficient solution algorithm to the OFDMA resource allocation problem is designed. Simulation results show that the reliability performance of CPS networks is significantly improved because of this work.      

Game Theoretic subcarrier and power allocation for wireless OFDMA networks

This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.     

Analysis and scheduling of practical network coding in OFDMA relay networks

Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization. Specifically, we aim to explore the following questions: (1) When and how can wireless nodes select relay paths in the presence of network coding? (2) How can an OFDMA relay system assign network resource such as subcarrier and power for all the transmitting nodes? (3) What are the impacts of OFDMA system parameters on the network coding gain? To answer these questions, two efficient coding-aware relay strategies are presented to select forwarding paths with fixed and dynamic power allocation. In order to exploit the network capacity in slow frequency selective fading channels, we formulate optimization frameworks and propose channel-aware coding-aware resource allocation algorithms for an arbitrary traffic pattern. Our studies show that the network coding (i.e. XOR) gain depends on the nodes’ powers, traffic patterns etc. Especially, OFDMA relay network with dynamic power possesses both coding gain and power gain. Extensive simulations are performed to verify our analysis and demonstrate the throughput improvement of our proposals in the presence of XOR coding.     

Energy-efficient dynamic resource allocation with opportunistic network coding in OFDMA relay networks

Network coding is significantly able to save system resources for wireless networks, and has been widely studied for the 802.11 wireless local area network and traditional cellular networks. The relay technology was introduced in 802.16j, 802.16m, and Long Term Evolution-Advanced (LTE-A) standards. Recently, the application of network coding to multi-hop wireless relay networks has been taken into consideration. Although the introduction of relay stations (RSs) may bring more energy consumption, it provides opportunities for network coding to save spectrum resources. Nevertheless, the benefits of network coding are diminished by high multiuser diversity based on orthogonal frequency division multiple access (OFDMA). For ensuring the superiority, network coding is performed opportunistically according to the channel state. Hence dynamic resource allocation (DRA) subject to rate constraints is combined with the idea of opportunistic network coding to minimize the total transmission power in a frame. A fixed set of discrete modulation levels in an OFDMA relay system is also considered. By taking the characteristic of a half-duplex decode-and-forward (DF) mode relay, a solution is proposed for the optimal problem of each subframe after separating power-aware relay selection. Simulation results show that DRA with opportunistic network coding can improve system energy efficiency. Further, it is more efficient for saving energy than DRA with static network coding compared solely to DRA.     

Interference aware resource allocation for hybrid hierarchical wireless networks

This paper addresses the problem of interference aware resource allocation for OFDMA based hybrid hierarchical wireless networks. We develop two resource allocation algorithms considering the impact of wireless interference constraints using a weighted SINR conflict graph to quantify the interference among the various nodes: (1) interference aware routing using maximum concurrent flow optimization; and (2) rate adaptive joint subcarrier and power allocation algorithm under interference and QoS constraints. We exploit spatial reuse to allocate subcarriers in the network and show that an intelligent reuse of resources can improve throughput while mitigating interference. We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.     

Using traffic asymmetry to enhance TCP performance

A wealth of recent work has gone into optimizing the performance of Transmission Control Protocol (TCP) on the downlink channel of wireless networks such as for example, honing its congestion awareness mechanism so that it is minimally affected by random wireless losses, and optimizing achieved fairness of the end-to-end TCP rates. Other work has gone into balancing the allocation of a shared resource between the downlink and uplink in order to optimize TCP performance. We build on such previous research by proposing a cross-layer algorithm for resource allocation in OFDMA systems aiming not only to achieve optimal throughput for competing TCP flows but also to allocate resources appropriately between the downlink and uplink. This is important due to the increasing number of Internet applications where the mobile terminal is the TCP sender (social networking, peer-to-peer, etc.). Therefore, our scheme makes use of the asymmetry in the traffic and by defining the boundary between downlink and uplink capacity dynamically, enhance the TCP performance. Through numerical investigations we show the performance of the proposed scheme in terms of achieved fairness to the receivers and efficient allocation of downlink to uplink ratios based on the TCP traffic.     

A survey on resource allocation techniques in OFDM(A) networks

In this contribution, we present a survey on the radio resource allocation techniques in orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. This problem goes back to 1960s and that is related to properly and efficiently allocate the radio resources, namely subcarriers and power. We start by overviewing the main open issues in OFDM. Then, we describe the problem formulation in OFDMA, and we review the existing solutions to allocate the radio resources. The goal is to discuss the fundamental concepts and relevant features of different radio resource management criteria, including water-filling, max–min fairness, proportional fairness, cross-layer optimization, utility maximization, and game theory, also including a toy example with two terminals to compare the performance of the different schemes. We conclude the survey with a review of the state-of-the-art in resource allocation for next-generation wireless networks, including multicellular systems, cognitive radio, and relay-assisted communications, and we summarize advantages and common problems of the existing solutions available in the literature. The distinguishing feature of this contribution is a tutorial-style introduction to the fundamental problems in this area of research, intended for beginners on this topic.     

Competitive scheduling for OFDMA systems with guaranteed transmission rate

Next-generation broadband wireless standards use orthogonal frequency division multiple access (OFDMA) as the preferred physical layer multiple access scheme, especially for the downlink. Due to limited resources available at the base station, multi-user resource allocation is crucial for delivering the applications with various quality-of-service (QoS) demands. We study the OFDMA resource allocation problem for the adaptive modulation and coding (AMC) mode of mobile WiMAX, in which resources in the form of allocation units (AU) are to be allocated and the channel knowledge of only some good sub-channels for the users is available to the scheduler. The objective is to maximize the sum-rate for all the users while maintaining guaranteed minimum and maximum traffic rates for certain users under a total transmission power constraint. Two novel factors, band selectivity factor (BSF) and competition factor (CF), are introduced. Based on the two factors, we propose a sub-optimal approach, rate-guaranteed competitive scheduling (RCS). It is suitable to be deployed in practical systems and exploits multi-user diversity with very low complexity. Simulation results show that RCS can achieve almost 75% of throughput of the optimal solution.     

A novel radio resource allocation scheme for IEEE 802.16e multicell networks

In this paper,we propose a new media access control (MAC) protocol,which is compatible with the IEEE 802.16e-2005 Orthogonal Frequency Division Multiple Access (OFDMA) wireless interface.In this protocol,the same radio resource can be shared by neighboring cells in the wireless mesh network (WMN) and collisions can be reduced in the overlapping areas.This protocol consists of two schemes: a downlink transmission and an uplink transmission.For downlink transmission we use a cross layer adaptive radio resourc...     

保证公平的最大化中继OFDMA系统容量策略

基于正交频分多址(OFDMA)解码-转发中继的系统资源分配方法不能兼顾系统容量与用户公平度。针对该问题,提出一种新的子载波与功率资源分配算法,其中包括子载波分配与配对以及功率分配2个过程。在子载波分配与配对过程中,设计新的同步子载波差值最小配对方法,以最大程度匹配两跳链路配对的子载波。在功率分配过程中,通过拉格朗日方法调整每个子载波对的功率,进一步提高系统传输速率。仿真结果表明,将该策略运用于不同的OFDMA子载波分配算法中能够较好地兼顾系统容量与用户间公平度。     

窄带蜂窝物联网终端上行资源调度的分析与设计

窄带蜂窝物联网（NB-IoT）技术发展迅猛,与原有的无线通信协议相比,NB-IoT的频谱带宽仅有180 kHz,因此,如何更有效地使用资源或频谱（即资源分配和调度）成为NB-IoT技术的关键问题。针对该问题,对NB-IoT上行链路资源调度的相关因素,其中包括资源分配、功率控制以及上行传输间隙进行了分析,并提供不同选择方案以选择出最优的方案;另外,针对调制与编码方案和重复传输次数的选择进行了重点分析,提出基于不同的覆盖等级联合功率余量报告的贪婪-稳定选择调制与编码策略以初步选择调制与编码级别,在选择重复传输次数时引入了一个补偿因子以衡量重传次数的大小以及对调制与编码等级更新;最后,对所提出方案进行了仿真分析。仿真结果表明,所提方案与直接传输方法相比,平均可节省超过56%的活动时间和46％的资源消耗。     

A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks

The next generation broadband wireless networks deploys OFDM/OFDMA as the enabling technologies for broadband data transmission with QoS capabilities. Many optimization problems have arisen in the conception of such a network. This article studies an optimization problem in resource allocation. By using mathematical modeling technique we formulate the considered problem as a pure integer linear program. This problem is reformulated as a DC (Difference of Convex functions) program via an exact penalty technique. We then propose a continuous approach for its resolution. Our approach is based on DC programming and DCA (DC Algorithm). It works in a continuous domain, but provides integer solutions. To check globality of computed solutions, a global method combining DCA with a well adapted Branch-and-Bound (B&B) algorithm is investigated. Preliminary numerical results are reported to show the efficiency of the proposed method with respect to the standard Branch-and-Bound algorithm.     

A novel resource optimization scheme for multi-cell OFDMA relay network

In cellular networks, users communicate with each other through their respective base stations (BSs). Conventionally, users are assumed to be in different cells. BSs serve as decode-and-forward (DF) relay nodes to users. In addition to this type of conventional user, we recognize that there are scenarios users who want to communicate with each other are located in the same cell. This gives rise to the scenario of intra-cell communication. In this case, a BS can behave as a two-way relay to achieve information exchange instead of using conventional DF relay. We consider a multi-cell orthogonal frequency division multiple access (OFDMA) network that comprises these two types of users. We are interested in resource allocation between them. Specifically, we jointly optimize subcarrier assignment, subcarrier pairing, and power allocation to maximize the weighted sum rate. We consider the resource allocation problem at BSs when the end users’ power is fixed. We solve the problem approximately through Lagrange dual decomposition. Simulation results show that the proposed schemes outperform other existing schemes.     

认知网络中基于博弈论的联合功率控制与速率分配算法

针对认知无线网络上行链路中的资源分配问题,提出了一种适应于多小区认知无线网络的基于功率控制与速率分配的博弈算法。为了更加合理地控制用户的功率和速率,减小各次用户间的干扰,首先,在效用函数中分别给功率和速率设置了不同的代价因子,使其能够更加合理地控制用户,避免用户过度增加发射功率。其次,从理论上证明了该算法纳什均衡的存在性、唯一性以及算法的收敛性。最后,为了解决发射功率和传输速率的最优化问题,给出了联合功率控制和速率分配的迭代更新算法流程图。理论分析及仿真结果表明,与同类博弈算法相比,在保证通信质量的前提下,所提算法可以使得用户以较小的发射功率获得较大的传输速率和较高的信干噪比（SINR）,并且减小了用户间的干扰,提高了次用户系统容量。     

Subcarrier allocation in multi-hop orthogonal frequency division multiple access wireless networks

Orthogonal frequency division multiplexing (OFDM) has been widely considered as a key technique for next generation mobile communication systems. Meanwhile, relaying technologies can improve users’ quality of service, increase network capacity and enlarge cellular coverage at a low cost. In this paper, we focus on subcarrier allocation and utilization in multi-hop OFDM access (OFDMA) wireless networks, and propose two efficient subcarrier allocation schemes aiming to increase network throughput and subcarrier utilization. The first scheme selects suitable links for data transmission from base stations to terminals at the beginning. Then, interference-free links are included into the same group for network resource reuse. For the purpose of global optimization, we propose a Tabu-based searching algorithm as the second subcarrier allocation scheme. Simulation results demonstrate that our proposed algorithms outperform other schemes in both network throughput and subcarrier utilization.     

C-V2X无线资源管理算法研究

在蜂窝车联网（C-V2X）的underlay模式下,蜂窝用户（C-UEs）与车载用户（V-UEs）共享上行频谱。为解决C-V2X中的同频干扰问题,并确定不同数据包优先级（PPPP）用户的传输优先度,在保障V-UEs与C-UEs通信可靠性的同时,以最大化所有用户的信息值为目标,提出一种新的无线资源管理（RRM）算法。通过引入子用户的概念将RRM问题转换为功率分配问题与频率资源选择问题,在功率分配结果的基础上采用启发式算法实现低复杂度的频率资源选择,并对频率选择结果进行再分配得到最终发射功率。仿真结果表明,该算法相比正交分配算法能够有效提升所有用户的信息值,并保障系统可靠性。     

基于非合作博弈的变电站无线网络资源研究

无线资源管理对实现资源的有效利用起着至关重要的作用.针对变电站中无线网络资源分配问题,提出了基于非合作博弈的变电站无线网络资源的优化管理算法,解决了全双工系统的无线电资源分配问题.将下行链路与上行链路的联合速率最大化问题建模成为上下行链路信道之间的非合作博弈,提出了基于非合作博弈的迭代算法.该算法有效的实现最佳上行链路与下行链路的资源分配,直到达到纳什均衡.仿真结果表明,该算法实现了快速收敛,与同等资源分配方法相比,可以显著提高全双工的性能.     

多小区OFDMA系统一种跨层资源分配方法

正交频分多址(OFDMA)作为一种新的多址接入方式受到了极大关注.多小区系统由于采用频率复用技术会不可避免的产生小区间干扰,严重影响了多小区无线通信系统的性能,针对多小区OFDMA,提出了一种准分布式跨层资源分配方法.分配方法包括无线网络控制器(RNC)的跨层资源分配算法和基站收发系统(BTS)的跨层资源分配算法.RNC将子信道分配给各个小区的BTS,BTS将分配给该小区的子信道分配给该小区的用户.仿真结果表明,相对于传统的资源分配方法,跨层资源分配方法能有效提高多小区OFDMA系统给定服务质量(QoS)下的吞吐率.