53 research outputs found

    Energy-efficiency for MISO-OFDMA based user-relay assisted cellular networks

    Get PDF
    The concept of improving energy-efficiency (EE) without sacrificing the service quality has become important nowadays. The combination of orthogonal frequency-division multiple-access (OFDMA) multi-antenna transmission technology and relaying is one of the key technologies to deliver the promise of reliable and high-data-rate coverage in the most cost-effective manner. In this paper, EE is studied for the downlink multiple-input single-output (MISO)-OFDMA based user-relay assisted cellular networks. EE maximization is formulated for decode and forward (DF) relaying scheme with the consideration of both transmit and circuit power consumption as well as the data rate requirements for the mobile users. The quality of-service (QoS)-constrained EE maximization, which is defined for multi-carrier, multi-user, multi-relay and multi-antenna networks, is a non-convex and combinatorial problem so it is hard to tackle. To solve this difficult problem, a radio resource management (RRM) algorithm that solves the subcarrier allocation, mode selection and power allocation separately is proposed. The efficiency of the proposed algorithm is demonstrated by numerical results for different system parameter

    Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying

    Full text link
    We study the problem of channel pairing and power allocation in a multichannel multihop relay network to enhance the end-to-end data rate. Both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are considered. Given fixed power allocation to the channels, we show that channel pairing over multiple hops can be decomposed into independent pairing problems at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal, where each relay pairs its incoming and outgoing channels by their SNR order. For the joint optimization of channel pairing and power allocation under both total and individual power constraints, we show that the problem can be decoupled into two subproblems solved separately. This separation principle is established by observing the equivalence between sorting SNRs and sorting channel gains in the jointly optimal solution. It significantly reduces the computational complexity in finding the jointly optimal solution. It follows that the channel pairing problem in joint optimization can be again decomposed into independent pairing problems at each relay based on sorted channel gains. The solution for optimizing power allocation for DF relaying is also provided, as well as an asymptotically optimal solution for AF relaying. Numerical results are provided to demonstrate substantial performance gain of the jointly optimal solution over some suboptimal alternatives. It is also observed that more gain is obtained from optimal channel pairing than optimal power allocation through judiciously exploiting the variation among multiple channels. Impact of the variation of channel gain, the number of channels, and the number of hops on the performance gain is also studied through numerical examples.Comment: 15 pages. IEEE Transactions on Signal Processin

    Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying

    Full text link
    This paper addresses a weighted sum rate (WSR) maximization problem for downlink OFDMA aided by a decode-and-forward (DF) relay under a total power constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is proposed. Specifically, user message bits are transmitted in two time slots. A subcarrier in the first slot can be paired with a subcarrier in the second slot for the DF relay-aided transmission to a user. In particular, the source and the relay can transmit simultaneously to implement beamforming at the subcarrier in the second slot. Each unpaired subcarrier in either the first or second slot is used for the source's direct transmission to a user. A benchmark protocol, same as the proposed one except that the transmit beamforming is not used for the relay-aided transmission, is also considered. For each protocol, a polynomial-complexity algorithm is developed to find at least an approximately optimum resource allocation (RA), by using continuous relaxation, the dual method, and Hungarian algorithm. Instrumental to the algorithm design is an elegant definition of optimization variables, motivated by the idea of regarding the unpaired subcarriers as virtual subcarrier pairs in the direct transmission mode. The effectiveness of the RA algorithm and the impact of relay position and total power on the protocols' performance are illustrated by numerical experiments. The proposed protocol always leads to a maximum WSR equal to or greater than that for the benchmark one, and the performance gain of using the proposed one is significant especially when the relay is in close proximity to the source and the total power is low. Theoretical analysis is presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on Signal Processing. arXiv admin note: text overlap with arXiv:1301.293

    Joint Subcarrier Pairing and Power Allocation for OFDM Transmission with Decode-and-Forward Relaying

    Full text link
    In this paper, a point-to-point Orthogonal Frequency Division Multiplexing (OFDM) system with a decode-and-forward (DF) relay is considered. The transmission consists of two hops. The source transmits in the first hop, and the relay transmits in the second hop. Each hop occupies one time slot. The relay is half-duplex, and capable of decoding the message on a particular subcarrier in one time slot, and re-encoding and forwarding it on a different subcarrier in the next time slot. Thus each message is transmitted on a pair of subcarriers in two hops. It is assumed that the destination is capable of combining the signals from the source and the relay pertaining to the same message. The goal is to maximize the weighted sum rate of the system by jointly optimizing subcarrier pairing and power allocation on each subcarrier in each hop. The weighting of the rates is to take into account the fact that different subcarriers may carry signals for different services. Both total and individual power constraints for the source and the relay are investigated. For the situations where the relay does not transmit on some subcarriers because doing so does not improve the weighted sum rate, we further allow the source to transmit new messages on these idle subcarriers. To the best of our knowledge, such a joint optimization inclusive of the destination combining has not been discussed in the literature. The problem is first formulated as a mixed integer programming problem. It is then transformed to a convex optimization problem by continuous relaxation, and solved in the dual domain. Based on the optimization results, algorithms to achieve feasible solutions are also proposed. Simulation results show that the proposed algorithms almost achieve the optimal weighted sum rate, and outperform the existing methods in various channel conditions.Comment: 33 pages, 11 figure

    Adaptive relay techniques for OFDM-based cooperative communication systems

    Get PDF
    Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes

    Resource Allocation in OFDM-Based Cognitive Two-Way Relay Networks

    Get PDF
    Cognitive radio (CR), nowadays, is considered as one of the most promising techniques which introduce the flexible usage of radio spectrum and improve the spectral efficiency by enabling unlicensed users to exploit the licensed spectrum in an opportunistic manner. Moreover, the two-way relay communication has attracted a great attention as it introduces a relaying scheme with a bidirectional transmission to exchange information between two nodes. This strategy assumed to improve the overall capacity, since less time slots are needed than the one-way strategy, besides extending the radio coverage range of networks. Another common technique that improves the bandwidth efficiency and spectrum utilization is the orthogonal frequency division multiplexing (OFDM) technique which exhibits a distinctive efficiency in mitigating inter-symbol interference (ISI) and combating frequency selective fading. Therefore, two-way relay CR communication among OFDM terminals can take advantage of these three techniques to boost up the capacity together with the networks quality. In this thesis, an OFDM-based amplify and forward (AF), cognitive two-way multiple-relay network is considered where two transceiver nodes exchange information via relay nodes. The full transmission happens in two time slots. In the first time slot, multiple access phase (MA), the transceiver nodes send their signals to the relay nodes while in the second time slot, broadcast phase (BC), the relay nodes broadcast the received signals to the transceivers. In this dissertation, the problem to jointly optimize the network resources is considered. The first is the transmission power of transceivers and relay nodes to ensure suitable allocated power for best signals transmission besides ensuring no harmful interference is caused to the primary system. The other important resource to be optimized is the subcarrier pairing where the first and second time slots subcarriers have to be matched such that the subcarriers with the best conditions is reserved. The final tuned resource, in this work, is the relay selection where the relay node that assures the best transition of the received signal is selected. The dual decomposition technique is applied to get the optimal resource allocation. Moreover, suboptimal algorithms are proposed to perform the resource allocation reducing, significantly, the computational complexity compared with the optimal solution with small performance degradation. Finally, simulation results of the suggested AF OFDM cognitive relaying network are shown to compare the performance gain of the different algorithms which reveals that the proposed suboptimal algorithm achieves good performance with much less computational complexity than the optimal one

    Base station cooperation in multiple input multiple output orthogonal frequency division multiple access systems

    Get PDF
    Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2009.Thesis (Master's) -- Bilkent University, 2009.Includes bibliographical references leaves 60-62.Newly emerging advancements such as multiple input multiple output (MIMO) and orthogonal frequency division multiple access (OFDMA) techniques become indispensable parts of today’s wireless systems such as WiMAX (IEEE 802.16 standard) since they can increase the supportable data rates significantly. However, achieving the maximum spectral efficiency in a MIMO system requires perfect channel state information (CSI) at the transmitter side and multicarrier nature of OFDMA systems increase the necessary CSI feedback from users to base stations remarkably. To further increase the supportable data rates, using frequency reuse factor of 1 in the system is also mandatory. Unfortunately, this results in significant cochannel interference (CCI) observed especially by the users near cell edges, which can severely degrade the system spectral efficiency. To cope with this problem, base station cooperation may play an important role. In this thesis, the problem of cooperative data transmission from base stations to users in multicellular MIMO-OFDMA systems is considered. An efficient cooperative scheduling and data transmission scheme, requiring limited CSI feedback from users to base stations and also limited information exchange between the base stations, is proposed. The numerical results demonstrate that, the proposed algorithm offers considerable spectral efficiency gains compared to conventional frequency reuse and noncooperative schemes, under severe CCI conditionsTokel, Turgut BarışM.S
    corecore