Dynamic Random Access Channel Allocation Scheme Based on the Pseudo-Bayesian Algorithm in OFDMA System

Random Access Channel （RACH） is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless corrnunication systel In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access （OFDMA） systen. Based on the PseudoBayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to irrprove the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.

Cross-Layer Adaptive Resource Allocation Algorithm with Diverse QoS Requirements for Single-Cell OFDMA Systems

The orthogonal frequency division multiple access( OFDMA) based communication system has been considered as the main trend of next-Generation communication system. But the existing resource allocation algorithm designed for such system is always with high complexity thus hard to be realized. To solve such problem with the constraints of spectrum efficiency and buffer state,a novel cross-layer resource allocation algorithm( RAA) is proposed in this paper. The goal of our RAA is to maximize the system throughput while satisfying several practical constraints,such as fairness among services,head of line( Ho L) delay and diverse quality of service( Qo S) requirements. Due to these constraints,finding the optimal solution becomes a NPhard problem. Therefore in this paper a novel method to solve such problem with acceptable complexity is proposed within following steps: firstly,based on the link state we formulate the ideal subchannel allocation strategy as a convex optimization problem,which can be efficiently solved by our proposed lagrange multiplier technique subchannel allocation( LMTSA) algorithm; secondly,according to the obtained channel allocation matrix,a power allocation algorithm based on the water-filling power allocation( WPA) idea is deployed to get the optimal power allocation matrix combining with adaptive modulation and coding( AMC); finally,through a greedy algorithm,the ultimate subchannel and power allocation matrix can be obtained based on iterative method. The simulation results illustrate that we can achieve the higher throughput and better Qo S performance than the widely-used maximum throughput( MT) algorithm and round robin( RR) algorithm.

Low-Complexity Joint Channel Estimation and Symbol Detection for OFDMA Systems

In this paper,we propose a joint channel estimation and symbol detection(JCESD)algorithm relying on message-passing algorithms(MPA)for orthogonal frequency division multiple access(OFDMA)systems.The channel estimation and symbol detection leverage the framework of expectation propagation(EP)and belief propagation(BP)with the aid of Gaussian approximation,respectively.Furthermore,to reduce the computation complexity involved in channel estimation,the matrix inversion is transformed into a series of diagonal matrix inversions through the Sherman-Morrison formula.Simulation experiments show that the proposed algorithm can reduce the pilot overhead by about 50%,compared with the traditional linear minimum mean square error(LMMSE)algorithm,and can approach to the bit error rate(BER)performance bound of perfectly known channel state information within 0.1 dB.

Energy efficient resource allocation in non-cooperative multi-cell OFDMA systems

A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access（OFDMA） system.The objective is to raise the spectral efficiency of the system and prolong the life time of user nodes.This paper defines a game player as a cell formed by the unique base station and the served users.The utility function considered here measures the user＇s achieved utility per power.Each individual cell＇s goal is to maximize the total utility of its users.To search the Nash equilibrium（NE） of the game,an iterative and distributed algorithm is presented.Since the NE is inefficient,the pricing of user＇s transmission power is introduced to improve the NE in the Pareto sense.Simulation results show the proposed game outperforms the water-filling algorithm in terms of fairness and energy efficiency.Moreover,through employing a liner pricing function,the energy efficiency could be further improved.

Noisy Chaotic Neural Network for Resource Allocation in High-Speed Train OFDMA System

High-speed train communication system is a typical high-mobility wireless communication network. Resource allocation problem has a great impact on the system performance. However, conventional resource allocation approaches in cellular network cannot be directly applied to this kind of special communication environment. A multidomain resource allocation strategy was proposed in the orthogonal frequency-division multiple access(OFDMA) of high-speed. By analyzing the effect of Doppler shift, sub-channels, antennas, time slots and power were jointly considered to maximize the energy efficiency under the constraint of total transmission power. For the purpose of reducing the computational complexity, noisy chaotic neural network algorithm was used to solve the above optimization problem. Simulation results showed that the proposed resource allocation method had a better performance than the traditional strategy.

Performance evaluation of the fixed relay in OFDMA systems

Performance of fixed relays in orthogonal frequency division multiple access （0FDMA） systems, especially the coverage and capacity performance at the cell edge, is evaluated in this paper. Two methods, theoretical analysis and calculation and Monte Carlo simulation, are used for the evaluations. By theoreti- cal analysis and calculation, frequency efficiency equation of a relay is introduced and numerical results are calculated. Monte Carlo simulation results also verify that the calculation method is reasonable. The evaluation shows that a relay can increase system performance to a certain level if it is designed appropriately, otherwise it will be harmful for the system performance, even to reduce it.

MODELING MULTI-TRAFFIC ADMISSION CONTROL IN OFDMA SYSTEM USING COLORED PETRI NET

Call Admission Control (CAC) is one of the key traffic management mechanisms that must be deployed in order to meet the strict requirements for dependability imposed on the services provided by modern wireless networks. In this paper, we develop an executable top-down hierarchical Colored Petri Net (CPN) model for multi-traffic CAC in Orthogonal Frequency Division Multiple Access (OFDMA) system. By theoretic analysis and CPN simulation, it is demonstrated that the CPN model is isomorphic to Markov Chain (MC) assuming that each data stream follows Poisson distribution and the corresponding arrival time interval is an exponential random variable, and it breaks through MC's explicit limitation, which includes MC's memoryless property and proneness to state space explosion in evaluating CAC process. Moreover, we present four CAC schemes based on CPN model taking into account call-level and packet-level Quality of Service (QoS). The simulation results show that CPN offers significant advantages over MC in modeling CAC strategies and evaluating their performance with less computational complexity in addition to its flexibility and adaptability to different scenarios.

A Novel Radio Resource Management for Interference Mitigation in OFDMA System

In Orthogonal Frequency Division Multiple Access (OFDMA) systems, such as Long Term Evolution (LTE) and so on, the resources used by each user are orthogonal, and the OFDMA systems performances are mainly affected by the inter-cell interference. Therefore, the inter-cell interference mitigation technology becomes a hotspot. The objective of interference mitigation technologies used in OFDMA systems are to increase cell-edge throughput and average cell throughput. In this paper, the Resource Block Planning (BRBP) based scheme is proposed to mitigate the inter-cell interference and improve the cell-edge throughput. Comparison between the simulation results of BRBP and Round Robin (RR) illustrates that the enhanced performance of BRBP.

Downlink Resource Allocation with Multi-Objective Optimization in OFDMA Systems

A downlink radio resource allocation algorithm is proposed for orthogonal frequency division multiple access( OFDMA) systems. The resource allocation problem about system throughput and user fairness is formulated based on the multi-objective optimization theory. Then the optimality conditions are derived,according to which a joint subcarrier and power allocation algorithm is proposed. The simulation results show that the proposed algorithm can dynamically achieve arbitrary levels of compromise between throughput and fairness by adjusting the weighting coefficient,outperforming some static algorithms. In comparison,the classic maximum rate algorithm( MRA),max-min algorithm and proportional fairness( PF) algorithm can only achieve tradeoff in a certain level and are all special cases of the proposed algorithm.

Fast Convergence Resource Allocation in IEEE 802.16 OFDMA Systems with Minimum Rate Guarantee

Resource allocation in the context of OFDMA-based systems is challenging, given a combinatorial nature of the problem. In the context of IEEE 802.16 systems this problem is further exacerbated by additional constraints that are faced with its two dimensional frame nature. The main challenges associated with resource allocation in these systems are: mapping the allocated bandwidth resources to users in this two dimensional frame, power and frequency allocation, and Qo S guarantee. This optimization problem can usually be solved by an iterative algorithm. The solutions proposed have a constant step size in iterations which causes a long convergence time. For this reason, the solutions proposed are not applicable in IEEE 802.16 systems. In this paper we propose a novel resource allocation algorithm in IEEE 802.16 systems which has an adaptive step size in iterations while taking into account the minimum rate guarantee for users.

Efficient and fair resource allocation in downlink OFDMA systems

A resource allocation problem considering both efficiency and fairness in orthogonal frequency division multiple access （OFDMA） systems is studied. According to the optimality conditions, a downlink resource allocation algorithm consisting of subcarrier assignment and power alloca- tion is proposed. By adjusting the tradeoff coefficient, the proposed algorithm can achieve different levels of compromise between efficiency and fairness. The well-known classic resource allocation policies such as sum-rate maximization algorithm, proportional fairness algorithm and max-rain algorithm are all special cases of the proposed algorithm. Simulation results show that the compromise between efficiency and fairness can be continuously adjusted according to system requirements.

A Resource Allocation Algorithm of Physical-Layer Security for OFDMA System under Non-ideal Condition

In this paper, a resource allocation scheme based on physical layer security under non-ideal condition for OFDMA system is introduced. Firstly, the program uses the information security constructing an OFDMA system Wiretap Channel Model under non-ideal condition. Based on this model, arti?cial noise is generated for secure communications combatting passive multiple eavesdroppers. In order to maximize the average secrecy outage capacity without channel state information of eavesdroppers, we use dual decomposition method to implement subcarriers and power allocation in joint optimization. Simulation results show that the average secrecy outage capacity can achieve 7.81 bit/s/Hz while secrecy outage probability is 0.05 with 50 dB mtransmitpower and 64 sub-carrier for 8 authorized users.

Priority-Based Resource Allocation for Downlink OFDMA Systems Supporting RT and NRT Traffics

Efficient radio resource management is essential in Quality-of-Service (QoS) provisioning for wireless communication networks. In this paper, we propose a novel priority-based packet scheduling algorithm for downlink OFDMA systems. The proposed algorithm is designed to support heterogeneous applications consisting of both real-time (RT) and non-real-time (NRT) traffics with the objective to increase the spectrum efficiency while satisfying diverse QoS requirements. It tightly couples the subchannel allocation and packet scheduling together through an integrated cross-layer approach in which each packet is assigned a priority value based on both the instantaneous channel conditions as well as the QoS constraints. An efficient suboptimal heuristic algorithm is proposed to reduce the computational complexity with marginal performance degradation compared to the optimal solution. Simulation results show that the proposed algorithm can significantly improve the system performance in terms of high spectral efficiency and low outage probability compared to conventional packet scheduling algorithms, thus is very suitable for the downlink of current OFDMA systems.

Particle Swarm Optimization Based Approach for Resource Allocation and Scheduling in OFDMA Systems

Orthogonal Frequency-Division Multiple Access (OFDMA) systems have attracted considerable attention through technologies such as 3GPP Long Term Evolution (LTE) and Worldwide Interoperability for Microwave Access (WiMAX). OFDMA is a flexible multiple-access technique that can accommodate many users with widely varying applications, data rates, and Quality of Service (QoS) requirements. OFDMA has the advantages of handling lower data rates and bursty traffic at a reduced power compared to single-user OFDM or its Time Division Multiple Access (TDMA) or Carrier Sense Multiple Access (CSMA) counterparts. In our work, we propose a Particle Swarm Optimization based resource allocation and scheduling scheme (PSORAS) with improved quality of service for OFDMA Systems. Simulation results indicate a clear reduction in delay compared to the Frequency Division Multiple Access (FDMA) scheme for resource allocation, at almost the same throughput and fairness. This makes our scheme absolutely suitable for handling real time traffic such real time video-on demand.

Cross-layer resource allocation based on equivalent bandwidth in OFDMA systems

A quality of service（QoS） guaranteed cross-layer resource allocation algorithm with physical layer, medium access control（MAC） layer and call admission control（CAC） considered simultaneously is proposed for the full IP orthogonal frequency division multiple access（OFDMA） communication system, which can ensure the quality of multimedia services in full IP networks.The algorithm converts the physical layer resources such as subcarriers, transmission power, and the QoS metrics into equivalent bandwidth which can be distributed by the base station in all three layers. By this means, the QoS requirements in terms of bit error rate（BER）, transmission delay and dropping probability can be guaranteed by the cross-layer optimal equivalent bandwidth allocation. The numerical results show that the proposed algorithm has higher spectrum efficiency compared to the existing systems.

A Low-Complexity Resource Allocation Scheme for OFDMA Multicast Systems with Proportional Fairness

A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm(CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm(MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.

Resource scheduling scheme with QoS support in two-hop relay-enhanced OFDMA systems

As the system performance is obviously improved by introducing the concept of relay into the traditional orthogonal frequency division multiple access （OFDMA） systems, resource scheduling in relay-enhanced OFDMA systems is worthy of being studied carefully. To solve the optimization problem of achieving the maximum throughput while satisfying the quality of service （QoS） and guaranteeing the fairness of users, a novel resource scheduling scheme with QoS support for the downlink of two-hop relay-enhanced OFDMA systems is proposed. The proposed scheme, which is considered both in the first time sub-slot between direct link users and relay stations, and the second time sub-slot among relay link users, takes QoS support into consideration, as well as the system throughput and the fairness for users. Simulation results show that the proposed scheme has good performance in maximizing system throughput and guaranteeing the performance in the service delay and the data loss rate.

Handover with resource pre-allocation in the OFDMA systems

This article proposed a new handover algorithm for beyond the third generation （B3G） systems with an orthogonal frequency division multiple access （OFDMA） downlink. In the proposed algorithm, handover mobile termination （MT） chooses a subchannel set in the candidate cells by a subchannel booking rule, based on the terminal speed and the subchannel＇s channel state information （CSI）. Moreover, the handover decision is made after analyzing if at least one candidate cell can reserve the subchannel set for the handover user. Simulation results show that the algorithm reduces the number of handovers and guarantees the quality of service （QoS） for the handover users. It yields better system performance in the OFDMA systems.

Multi-cell uplink power allocation game for user minimum performance guarantee in OFDMA systems

The multi-cell uplink power allocation problem for orthogonal frequency division multiplexing access （OFDMA） cellular networks is investigated with the uplink transmission power allocation on each co-frequency subchannel being defined as a multi-cell non-cooperative power allocation game （MNPG）.The principle of the design of the utility function is given and a novel utility function is proposed for MNPG.By using this utility function,the minimum signal to interference plus noise ratio （SINR） requirement of a user can be guaranteed.It can be shown that MNPG will converge to the Nash equilibrium and that this Nash equilibrium is unique.In considering the simulation results,the effect of the algorithm parameters on the system performance is discussed,and the convergence of the MNPG is verified.The performance of MNPG is compared with that of traditional power allocation schemes,the simulation results showing that the proposed algorithm increases the cell-edge user throughput greatly with only a small decrease in cell total throughput; this gives a good tradeoff between the throughput of cell-edge users and the system spectrum efficiency.

Loading Schemes for Downlink OFDMA Systems

In this paper we study the subcarrier and bit allocation strategies for downlink OFDMA system.Our opti-mization objective is to find optimum subcarrier and bit assignment minimizing the total transmitted power with the con-straints on BER and data rate for all users.We divide this problem into three steps:resource allocation,subcarrier assign-ment and single-user power and bit allocation.For the first two steps we propose new algorithms.Various loading schemesconstitute by combining these algorithms as well as algorithms proposed in Ref.[6].Simulation results demonstrate thatour proposed suboptimal loading scheme can achieve performance closer to the near optimal algorithm in Ref.[8]withmuch lower complexity than schemes in Ref.[6].