Optimal subchannel assignment in a two-hop OFDM relay

Hottinen, A.; Heikkinen, Tiina

doi:10.1109/spawc.2007.4401425

Cited by 53 publications

(58 citation statements)

References 10 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the absence of the direct source-destination link, for the practical case of noisy-relay, by using the property of L-superadditivity of the rate function, the authors of [7] proved that the sorted-SNR CP still remains optimal for sum-rate maximization in dual-hop AF relaying OFDM system. Subsequently, it was further proved in [8], through a different approach, that the sorted-SNR CP scheme is optimal for both AF and DF relaying in the same setup.…”

Section: B Related Workmentioning

confidence: 99%

“…Therefore, Proposition 2 is necessary as the basis to prove the general M -hop case. In addition, in [7], the L-superadditivity property [22] is used to show that the sorted-SNR CP is optimal in dual-hop AF relaying for sum-rate maximization. That is, if the source-destination rate over each path can be shown to be L-superadditive, it follows that sorted-SNR pairing is optimal.…”

Section: Proofmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks

Hajiaghayi

Dong

Liang

2012

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

We study the problem of channel pairing and power allocation in a multi-channel multi-hop 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.

show abstract

Section: B Related Workmentioning

confidence: 99%

Section: Proofmentioning

confidence: 99%

Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks

Hajiaghayi

Dong

Liang

2012

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…To avoid the complex search in Step 3, we implement the proposed algorithm with M + 1 sorted lists containing SNRs of first-hop and the second-hops. Our sorting approach for exploiting the structure of Step 3 is similar to [7]. Due to space limitation we omitted the detail of implementation.…”

Section: Mixed Time-scale γ-Fair Af Relay Schedulingmentioning

confidence: 99%

“…In this case there is no interdependency between frames. For γ = 0, the algorithm is independent of ǫ and the algorithm reduces to a similar algorithm in [7] where no fairness is considered. Indeed, this non-obvious extension of [5] combines both approaches neatly and with a smooth transition.…”

Section: Mixed Time-scale γ-Fair Af Relay Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Mixed Time-Scale Generalized Fair Scheduling for Amplify-and-Forward Relay Networks

Sharifian

Djukic

Yanıkömeroğlu

et al. 2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

Abstract-We devise an optimization framework for generalized proportional fairness (GPF) under different time scales for amplify-and-forward (AF) relay networks. In GPF scheduling, a single input parameter is used to change the fairness from throughput optimal, to proportionally fair and asymptotically to max-min fair. We extend the GPF scheduling to include a new input parameter, which determines the time-scale of fairness from short-term GPF to long-term GPF. We devise a low-complexity near-optimal algorithm to find schedules satisfying the given fairness criteria in a given time-scale. Simulations show that the proposed algorithm indeed allows the flexibility to change the fairness and its time-scale. To the best of our knowledge, this paper is the first to provide a multi-user scheduling framework for AF relays with both flexible fairness and flexible time-scales.Index Terms-Long-term fairness, generalized fairness, amplify-and-forward relays.

show abstract

A Novel Solution for OFDM Based Relay Systems

Kočan

Pejanović-Djurišić

2015

Wireless Pers Commun

View full text Add to dashboard Cite

Optimal subchannel assignment in a two-hop OFDM relay

Cited by 53 publications

References 10 publications

Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks

Optimal Channel Pairing and Power Allocation for Multi-channel Multi-hop Relay Networks

Mixed Time-Scale Generalized Fair Scheduling for Amplify-and-Forward Relay Networks

A Novel Solution for OFDM Based Relay Systems

Contact Info

Product

Resources

About