Joint Opportunistic Spectrum Sharing and Dynamic Full Frequency Reuse in OFDMA Cellular Relay Networks

This paper considers the problem of spectrum sharing in orthogonal frequency division multiple access cellular relay networks. Firstly, a novel dynamic full frequency reuse scheme is proposed to improve the spectral efficiency. Different from the conventional full frequency reuse scheme which only allows the base station (BS) reusing the subcarriers in the specific regions, an improved full frequency reuse scheme is proposed to allow the BS reusing all the subcarriers in the whole BS coverage region to exploit additional multiuser diversity gain. In order to dynamically reuse the frequency resource among the BS and relay stations (RSs) to further improve the spectral efficiency, the adaptive subcarrier scheduling is introduced into the improved full frequency reuse scheme to obtain more multi-user diversity gain, which forms the proposed novel dynamic full frequency reuse scheme. Secondly, in order to further increase the system throughput, the opportunistic spectrum sharing scheme is introduced to allow the RSs selectively reusing the subcarriers among each other, which joint with the proposed dynamic full frequency reuse scheme to intelligently allocates the subcarriers originally reused by the BS and a RS to another suitable RS which can best improve the system performance after considering the additional interference. Thirdly, in order to select The optimal reusing combination scheme of BS and RSs to exploit more potential system performance, a heuristic approach based on genetic algorithm is proposed to search the optimal BS and RSs combination to opportunistically share the frequency resource. Simulation results show that the proposed dynamic full frequency reuse scheme can obtain high spectral efficiency, fine fairness and low outage probability compared to the conventional full frequency reuse scheme. Furthermore, the system performance can be improved when considering the opportunistic spectrum sharing among RSs. Finally, after adopting the genetic algorithm, the system performance can be greatly improved by the frequency reusing among the optimal BS and RSs combination.     

Orthogonal frequency division multiple access resource allocation in mobile multihop relay networks using an adaptive frame structure

For wireless mobile multihop relay (MMR) networks, we have chosen orthogonal frequency division multiple access (OFDMA) and time division duplex as a multiple access scheme and a duplex communication technique, respectively. We have also selected nontransparent relay stations (nt‐RSs) as relay nodes to extend the MMR network coverage. Through the nt‐RSs, far‐off subscriber stations (SSs) or hidden SSs can communicate with a base station (BS) that is connected to backhaul networks. In these MMR networks, the way in which a BS and nt‐RSs use OFDMA resources (e.g., OFDMA symbols and subcarriers) and share them might reduce system capacity and network throughput. Therefore, we proposed a new adaptive OFDMA frame structure for both the BS and the nt‐RSs. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. Based on the proposed adaptive OFDMA frame structure, an adaptive OFDMA resource allocation for SSs within a BS as well as nt‐RSs was proposed. To derive the maximum OFDMA resource that nt‐RSs can be assigned and to synchronize access zones and relay zones between a superior station and its subordinate nt‐RSs, three properties are introduced: a data relay property, a maximum balance property, and a relay zone limitation property. In addition, we propose max‐min and proportional fairness schemes of the proposed adaptive frame structure. Our numerical analysis and simulations show that the proposed OFDMA allocation scheme performs better than the nonadaptive allocation scheme in terms of network throughput and fairness especially in the asymmetric distribution of subscriber stations between access zones and relay zones in the MMR networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Optimal Resource Allocation for Two-Way Relay-Assisted OFDMA

This paper studies the resource allocation problem for the relay-assisted orthogonal frequency-division multiple-access (OFDMA)-based multiuser system. A new transmission protocol, named hierarchical OFDMA, is proposed to support two-way communications between the base station (BS) and each mobile user (MU) with or without an assisting relay station (RS) in “relay” or “direct” mode, respectively. In particular, the recently discovered two-way relaying technology, based on the principle of network coding, is applied to MUs in relay mode with two possible relay-operations, namely, decode-and-forward (DF) and amplify-and-forward (AF). By applying convex optimization techniques, efficient algorithms are developed for optimal allocation of transmit resources such as power levels, bit rates, and OFDM subcarriers at the BS, RSs, and MUs. Simulation results show that substantial system throughput gains are achievable by the proposed two-way relaying and optimal resource allocation schemes over the traditional one-way relaying and fixed resource allocation schemes for relay-assisted OFDMA-based wireless networks.      

Joint resource allocation,routing and CAC for uplink OFDMA networks with cooperative relaying

In this paper, we propose a joint resource allocation, routing, and connection admission control (CAC) scheme for uplink transmission in orthogonal frequency division multiple access (OFDMA) relay networks with cooperative relaying. For cooperative relaying, relay station can relay uplink data from mobile station (MS) to base station with cooperation of the MS using transmit diversity. Transmit diversity can be achieved by virtual MISO via distributed space–time coding. The proposed scheme jointly allocates OFDMA resources and selects path for each user with CAC to maximize the upink throughput of cooperative OFDMA relay networks. The basic OFDMA resource unit is considered as a resource element which is one subcarrier over one OFDMA symbol. An efficient multi-choice multi-dimensional knapsack (MMKP) algorithm is presented for the proposed scheme. The proposed MMKP algorithm provides a unified framework which is applicable to OFDMA networks with and without cooperative relaying. We evaluate the performance of the proposed scheme with and without cooperative relaying in a hilly terrain with heavy tree density by using OPNET-based simulation. We show that the cooperative relaying improve the uplink system throughput compared with non-cooperative relaying, and the proposed scheme outperforms the conventional link quality-based scheme in both cooperative and non-cooperative relay networks.     

Joint power,subcarrier and subframe allocation in Multihop relay networks

In this paper we study the problem of subframe, subchannel and power allocation in OFDMA‐based multihop relay networks. The system consists of a base station (BS), a number of relay stations (RS) and mobile stations (MS). We consider frame by frame scheduling, where the frame is divided into two subframes such as BS‐RS and RS‐MS subframes. We study two different problems, satisfying link rate requirements with minimum‐weighted total power and maximizing proportional fairness. For the first problem, we find the optimal solution and also propose a less complex subframe and bandwidth allocation scheme with good performance. For the second problem, we propose an algorithm that outperforms an existing scheme with less feedback. Copyright © 2009 John Wiley & Sons, Ltd.     

多天线系统中多中继传输的时间分配和功率分配优化方法

本文考虑单小区内的两个中继使用解码转发的方法为两个用户提供下行数据的场景,基站和中继配置多根天线,用户配置单天线。两中继使用相同的频率资源同时为两个用户提供服务。为减小两中继同时向两用户传输时产生的干扰,中继到用户的传输采用协作干扰避免的策略;相应的基站到中继的传输采用多用户空分复用的传输策略。本文在时间分配和功率分配两个方面对上述两跳传输过程进行了优化,提出了两跳传输最优的时间分配策略。由于功率分配最优化问题难以求解,本文提出了一种匹配链路容量的次优功率分配方法,并对其进行简化以降低复杂度。通过仿真可以看出,简化的功率分配方法与匹配链路容量的功率分配性能很接近;所提出的时间分配和功率分配方案可以获得有效的性能提升。      

Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations

Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheless, due to the inherent drawbacks of multihop relaying, e.g., the requirement for extra radio resources for relaying hops, and the sensitivity to the quality of relaying routes, multihop cellular networks (MCNs) require a well-designed radio resource allocation strategy in order to secure performance gains. In this paper, the optimal radio resource allocation problem in MCNs, with the objective of throughput maximization, is formulated mathematically and proven to be NP-hard. Considering the prohibitive complexity of finding the optimal solution for such an NP-hard problem, we propose an efficient heuristic algorithm, named integrated radio resource allocation (IRRA), to find suboptimal solutions. The IRRA is featured as a low-complexity algorithm that involves not only base station (BS) resource scheduling, but also routing and relay station (RS) load balancing. Specifically, a load-based scheme is developed for routing. A mode-aware BS resource-scheduling scheme is proposed for handling links in different transmission modes, i.e., direct or multihop. Moreover, a priority-based RS load balancing approach is presented for the prevention of the overloading of RSs. Within the framework of the IRRA, the above three functions operate periodically with coordinated interactions. To prove the effectiveness of the proposed IRRA algorithm, a case study was carried out based on enhanced uplink UMTS terrestrial radio access/frequency-division duplex with fixed RSs. The IRRA is evaluated through system level simulations, and compared with two other cases: 1) nonrelaying and 2) relaying with a benchmark approach. The results show that the proposed algorithm can ensure significant gains in terms of cell throughput     

Radio resource allocation in fixed broadband wireless networks

We consider use of fixed broadband wireless networks to provide packet services for telecommuting and Internet access. Each cell is divided into multiple sectors, each of them served by a sector antenna colocated with the base station (BS), and user terminals also use directional antennas mounted on the rooftops of homes or small offices and pointed to their respective BS antennas. To support a target data rate of 10 Mb/s, a bandwidth of several MHz is required. Since radio spectrum is expensive, the bandwidth needs to be reused very aggressively. Thus, efficient strategies for frequency reuse and managing cochannel interference are critically important. We propose several algorithms for dynamic radio-resource allocation in the fixed wireless networks. In particular, a method to be referred to as the staggered resource allocation (SRA) method uses a distributed scheduling algorithm to avoid major sources of interference while allowing concurrent packet transmission and meeting signal-to-interference objectives. The performance of the method is studied by analytic approximations and detailed simulation. Our results show that the combination of directional antennas plus the SRA method is highly effective in controlling cochannel interference. For reasonable system parameters, the SRA method delivers a throughput in excess of 30% per sector while permitting a given frequency band to be reused in every sector of every cell. It also provides satisfactory probability of successful packet transmission. In addition, a simple control mechanism can be applied in the method to improve performance for harsh radio environments     

Scheduling and Resource Allocation Strategy for OFDMA Systems Over Time-Varying Channels

A cross-layer scheduling and resource allocation (SRA) strategy for an adaptive modulation and coding (AMC) based orthogonal frequency multiple access (OFDMA) system is proposed. The objective of this paper is to maximize the system throughput as a function of the bit error rate (BER) and the spectral efficiency based on the selected modulation and coding schemes (MCSs). The proposed strategy contains two main algorithms. Firstly, the scheduling algorithm that aims to maximize the average system throughput by arranging the users in distinct queues according to their priorities and selecting the best user of each queue individually in order to guarantee a fair user service amongst different priority levels. Secondly, the resource allocation algorithm that allocates the user, bit and power based on the channel conditions of the scheduling users and the transmission power constraints. The transmitter of the investigated AMC-OFDMA system at the assigned base station (BS) divides the transmitted OFDMA frame into sub-channels and assigns each sub-channel to a scheduled user. In this paper, we compare the performance of the proposed SRA with the conventional first in first out (FIFO) queuing based scheduling and resource allocation strategies used for an AMC-OFDMA system. The simulation results show that the investigated AMC-OFDMA system based on the proposed SRA strategy outperforms the conventional approaches.     

Optimized BS assignment and resource allocation in cooperative OFDM networks

Cooperative transmission (CT) and orthogonal frequency division multiple (OFDM) are promising technologies for extending coverage and increasing throughput in broadband wireless access (BWA) networks. Therefore, we propose a novel BWA network architecture, that can set up inter-cell collaboration using physical layer cooperative transmissions among distributed wired access networks with a powerful coordination capability at the central office. However, conventional base station (BS) assignment and resource allocation schemes cannot be used directly because a user can be serviced by more than one BS with cooperative transmission technology. This study proposes a novel framework of BS assignment and resource allocation in a cooperative OFDM network. We provide three approaches of resource allocation for minimizing bandwidth usage, minimizing transmission power consumption, and balancing resource costs respectively. An optimized resource allocation scheme can be implemented by flexibly choosing one of these approaches based on network load. The simulation results show the efficiency of the proposed mathematical formulations and linearization approach of our scheme. The performance benefit of CT technology on the bandwidth saving is demonstrated by comparing the new BS assignment and resource allocation scheme with conventional non-cooperative transmission.     

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper,we present a non-transferable utility coalition graph game(NTU-CGG) based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing(OFDMA) based cognitive radio networks to maximize both system throughput and system fairness.In this algorithm,with the assistance of others SUs,SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs.So this scheme can effectively exploit both space and frequency diversity of the system.Performance results show that,NTU-CGG significantly improves system fairness level while not reducing the throughput comparing with other existing algorithms.     

Channel and queue aware joint relay selection and resource allocation for MISO-OFDMA based user-relay assisted cellular networks

User-relay assisted orthogonal frequency division multiple access (OFDMA) networks are cost-effective solutions to meet the growing capacity and coverage demands of the next generation cellular networks. These networks can be used with multiple antennas technology in order to obtain a diversity gain to combat signal fading and to obtain more capacity gain without increasing the bandwidth or transmit power. Efficient relay selection and resource allocation are crucial in such a multi-user, multi-relay and multi-antenna environment to fully exploit the benefits of the combination of user-relaying and multiple antennas technology. Thus, we propose a channel and queue aware joint relay selection and resource allocation algorithm for multiple-input single-output (MISO)-OFDMA based user-relay assisted downlink cellular networks. Since, the proposed algorithm is not only channel but also queue-aware, the system resources are allocated efficiently among the users. The proposed algorithm for the MISO-OFDMA based user-relay assisted scheme is compared to existing MISO-OFDMA based non-relaying and fixed relay assisted schemes and it is also compared with the existing single-input single-output (SISO)-OFDMA based user-relay assisted scheme. Simulation results revealed that the proposed scheme outperforms the existing schemes in terms of cell-edge users’ total data rate, average backlog and average delay.     

Subcarrier Wise Scheduling Methods for Multi-antenna and Multi-carrier Systems

In this paper, multiuser scheduling algorithms are evaluated for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) networks. These scheduling schemes allocate M [number of transmit antennas at base station (BS)] number of independent data streams from BS to the M most favourable users experiencing the highest signal-to-interference-plus-noise-ratio (SINR). Here, SINR is used to convey the channel state information (CSI) to the BS. We have investigated the system throughput and feedback overhead attained by these scheduling schemes for different scenarios as: (a) the maximum CSI is sent to the BS by every user and (b) the maximum CSI sent to the BS corresponding to every BS antenna. The overall feedback overhead incurred by MIMO-OFDM system increases linearly with number of users, number of subcarriers and number of transmit antennas. Hence, to reduce the feedback overhead, a scheme is proposed where users with SINR values greater than or equal to a predefined threshold value are only allowed to feedback the channel state information to BS. The relation between system throughput and various thresholds is also studied. The achievable system throughput results are validated by comparing the probability density function of achieved SINR values by different scheduling schemes.

     

Resource Allocation for Decode-and-Forward Relaying Assisted Multi-cell Orthogonal Frequency Division Multiplexing Systems with Frequency Planning

In this paper we apply frequency planning to the resource allocation of multi-cell and multi-user relay enhanced orthogonal frequency division multiplexing systems and propose a low-complexity algorithm taking into account of interference coordination, subcarrier and power allocation. We divide each cell into three sectors and allow different subcarrier set that can be used by the users of one sector. Such a method can help to increase the distance among users that use the same subcarriers of adjacent cells, which can reduce the impact of co-channel interference to a certain extent. Therefore, the original problem can be decoupled into three independent sub-problems by means of frequency dividing and adaptive power allocation at base station nodes which can reduce the computing complexity greatly. In the process of resource allocation for single sector, the relationship of transmission power between base station and relay node is used to transform the max-min problem into standard closed expression. With the help of dual decomposition approach, water-filling theorem and iterative power allocation algorithm, the suboptimal solution of the primal problem can be achieved finally. Simulation results illustrate that our proposed algorithm achieves almost the same performance as the optimal resource allocation and reduce the computing complexity greatly. In addition, the proposed algorithm can ensure the users fairness of different sectors.     

放大转发OFDM协同中继系统多业务资源分配机制

提出了点到点多载波协同中继系统多业务资源分配框架,并给出了一种最优化自适应功率、载波和比特分配算法;为了降低算法复杂度,又提出了一种次优搜索算法,该算法依据信道特性,在满足业务QoS基础上使业务占用资源最小.仿真结果表明:提出的最优算法在保障多媒体业务QoS的基础上能够有效改善频谱效率,对比于传统算法有1～2bit/(s·Hz)的性能提升;而提出的次优搜索能够取得接近最优算法的性能(差别在0.6 bit/(s·Hz)左右),并且实现复杂度由指数级别降至线性.     

On the MAC-BC duality of multiuser non-regenerative MIMO relay systems

Multiple input multiple output(MIMO) relaying techniques can greatly improve the spectral efficiency and extend network coverage for future wireless systems.This article investigates a multiuser MIMO relay channel,where a base station(BS) with multiple antennas communicates with multiple mobile stations(MS) via a relay station(RS) with multiple antennas.The RS applies linear processing to the received signal and then forwards the processed signal.The dual channel conditions between MIMO relay multiple access channel(MAC) and broadcast channel(BC) are first developed for single-relay scenario with white Gaussian noise.Then the MAC-BC duality for MIMO relay systems is established by proving that the capacity region of MIMO relay MAC is equal to that of dual MIMO relay BC under the same total network transmit power constraint.In addition,the duality is also extended to multi-relay scenario with arbitrary noise.Finally,several simple general numerical examples are provided to better illustrate the effectiveness of the MIMO relay MAC-BC duality.     

Resource Allocation Schemes for the Heterogeneous OFDMA System with Multiple Ad Hoc Relays

In this paper, we present a heterogeneous network framework involved an orthogonal frequency division multiple access (OFDMA) network with an out-of-band Ad Hoc network, which maybe a promising architectural upgrade and has not been studied so far. In the heterogeneous system, the mobile stations (MSs) are dual-mode with both cellular OFDMA and Ad Hoc radios. And MSs communicate with the base station by cellular OFDMA mode, while they communicate with each other by Ad Hoc mode. An active MS can choose multiple inactive MSs as its relay stations (RSs). And each RS operates in a full duplex mode, that is, it can receive data through Ad Hoc network in the first hop and transmit data through the OFDMA network in the second hop, simultaneously. Based on this heterogeneous system, the problem of joint relay selection, subcarrier and power allocation with the objective of maximizing the system capacity under individual rate and transmit power constraints is addressed. We propose a dual-based resource allocation scheme to solve the problem fairly and efficiently, and then we propose a fully distributed resource allocation scheme to decrease the computational complexity. Simulation results show that the performance of the proposed dual-based resource allocation scheme, in terms of the system capacity and the outage probability, is better than that of the fully distributed resource allocation scheme. However, the performance improvement is at the expense of a high computational complexity.     

面向5G的缓存辅助多天线中继策略

缓存辅助多天线中继技术可以为5G通信系统提供广域覆盖范围,并且有效改善系统的吞吐率性能.研究了一个三节点多天线缓存辅助中继系统,提出了最大化系统平均吞吐率的最佳缓存辅助中继策略,即联合自适应链路选择以及功率分配方案.分析结果表明,最佳的链路选择方案仅依赖于当前的瞬时信道状态信息以及相关链路的信道统计信息,而最佳功率分配方案是对发送的数据流进行等功率分配.仿真结果表明,相对于无缓存辅助的MIMO中继系统,缓存的引入能够显著改善中继系统的吞吐率.此外,MIMO技术的引入还能够获得多天线所带来的复用增益,进一步改善缓存辅助中继系统的吞吐率.     

A simple linear multiuser precoding technique in cellular relay networks

In this paper, we propose a simple linear multiuser precoding scheme for downlink cellular systems with a decodeand forward (DF) based relay, where the available information at a base station (BS) and a relay station (RS) is asymmetric. The proposed scheme not only eliminates the interference from a RS for the mobile station (MS) served by a BS but also provides the MS supported by a RS with a macro diversity gain without any information exchange between a BS and a RS. Consequently, the proposed scheme outperforms a conventional scheme and approaches an ideal scheme using dirty paper coding (DPC) in the information asymmetric configuration.     

Efficient CQI feedback via network coding for wireless relay networks

For the efficacy of radio resource management in downlink wireless relay networks, the channel quality indicator (CQI) between a mobile station (MS) and a relay station (RS) should be fed back from the RS to its base station (BS), at the cost of additional feedback overhead. In this letter, we propose an efficient feedback scheme based on network coding between a pilot sequence and the CQI of MS-RS link, through which the BS can have both CQIs of MS-RS and RS-BS links without overhead. Numerical results reveal that the proposed CQI reporting scheme has as good feedback performance as conventional one which generally requires additional feedback burden.