Relay Architectures for 3GPP LTE-Advanced

Peters, Steven W.; Panah, Ali Yazdan; Truong, Kien T.; Heath, Robert W.

doi:10.1155/2009/618787

Cited by 237 publications

(171 citation statements)

References 27 publications

Supporting

Mentioning

166

Contrasting

Unclassified

Order By: Relevance

“…Long Term Evolution (LTE) [75]. There has been a great deal of research on the 3-node relay network over the past decades under different configurations, (e.g., with or without direct source-destination link) and relaying schemes, (e.g., decode-and-forward or amplifyand-forward relaying), for example, see [76], and references therein.…”

Section: Buffer-aided Relaying Communicationsmentioning

confidence: 99%

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Phan¹,

Le‐Ngoc²

2017

SpringerBriefs in Electrical and Computer Engineering

View full text Add to dashboard Cite

Wireless data transmission suffers from the fading nature of wireless channels, where the instantaneous channel conditions and hence transmission rates randomly fluctuate over time. Consequently, data arrivals at each transmitter might not be transmitted instantly. To cope with this situation, the transmitter employs buffer to store the data temporarily for later transmission. While data buffering enables more efficient radio resource allocation to opportunistically select the favorable fading conditions for transmission, it introduces queuing delay that needs to be controlled in order to meet the end-to-end delay quality-ofservice (QoS) requirements in supporting delay-sensitive communications. In this thesis, we study and develop radio resource allocation schemes for buffer-aided communications over wireless fading channels under statistical delay constraints. Using the buffering capability as a means to exploit the fading diversity, the nodes (source and relay) perform resource allocation, and adapt their transmissions to the channel state information (CSI) in order to enhance the system throughput while maintaining the statistical delay QoS requirements in terms of upper-bounded average delay or delay-outage probability.The thesis starts by considering a source-destination communications link over a fading channel with data arriving at the source transmission buffer. In the first scenario, the source is assumed to have a maximum power constraint and an average delay constraint. We consider admission control applied on random data arrivals to the source buffer in order to avoid constraint violation, and study the joint optimal data admission control and power allocation (AC-PA) problem for throughput maximization. In the second scenario, we consider an energy-harvesting (EH) source, where random amounts of energy are harvested from renewable energy sources, and stored in a battery during the course of data transmission. In every transmission time slot, the source is constrained to use at most the amount of energy currently stored. We then explore optimal power allocation problems for such EH systems under average delay or delay-outage constraints. We formulate the problems as infinite horizon constrained Markov decision process (MDP) problems, which incorporate the random variations of the fading channel, data arrival, and EH processes. A novel solution approach based on post-decision state-value function is proposed to study the properties of the optimal solutions. We also propose online allocation algorithms when the statistical knowledge of the random processes is unknown, which is typical in real-life communications. Illustrative results demonstrate the effectiveness of the proposed algorithms over existing approaches iii under similar power and delay constraints.The thesis continues with a source-relay-destination communications link over fading channels with buffers available at both source and relay, as part of a multi-hop network. We investigate and develop optimal resource allocation schemes ...

show abstract

Section: Buffer-aided Relaying Communicationsmentioning

confidence: 99%

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Phan¹,

Le‐Ngoc²

2017

SpringerBriefs in Electrical and Computer Engineering

View full text Add to dashboard Cite

show abstract

Section: A Related Workmentioning

confidence: 99%

“…Most notably, [6] shows that shared relaying can approach the gains of local base-station coordination at reduced complexity. In [6], multiple-input multiple-output (MIMO) multiple-access and broadcast techniques are used at the shared relay; the time durations of the two phases are optimally adjusted. The shared relay concept is further studied in [7], where practical zeroforcing (ZF) methods are used in combination with partial or full base-station coordination for both one-way and twoway shared relaying.…”

Section: A Related Workmentioning

confidence: 99%

“…The shared relay concept is further studied in [7], where practical zeroforcing (ZF) methods are used in combination with partial or full base-station coordination for both one-way and twoway shared relaying. In [8], a joint processing scheme that improves the shared relaying strategy of [6] is proposed by letting the base-station and the relay send the same message to the corresponding user in the second phase. However, none of these works consider the impact of scheduling: [6] and [7] assume arbitrary scheduling on a single subchannel, while round robin scheduling for cell-edge users is used in [8].…”

Section: A Related Workmentioning

confidence: 99%

“…In [8], a joint processing scheme that improves the shared relaying strategy of [6] is proposed by letting the base-station and the relay send the same message to the corresponding user in the second phase. However, none of these works consider the impact of scheduling: [6] and [7] assume arbitrary scheduling on a single subchannel, while round robin scheduling for cell-edge users is used in [8]. In [9], a Hungarian-based scheduling scheme is proposed for shared relaying under static orthogonal subchannel segmentation among neighboring sectors.…”

Section: A Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Fair scheduling and resource allocation for wireless cellular network with shared relays

Lin

2012

2012 46th Annual Conference on Information Sciences and Systems (CISS)

View full text Add to dashboard Cite

Abstract-This paper examines the shared relay architecture for the wireless cellular network, where instead of deploying multiple separate relays within each cell sector, a single relay with multiple antennas is placed at the cell edge and is shared by multiple sectors. The advantage of shared relaying is that the joint processing of signals at the relay enables the mitigation of intercell interference. To maximize the benefit of shared relaying, the resource allocation and the scheduling of users among adjacent cell sectors need to be optimized jointly. Based on this motivation, this paper formulates a network utility maximization problem for the shared relay system that considers the practical wireless backhaul constraint of matching the relay-to-user rate demand with the base-station-to-relay rate supply using a set of pricing variables. In addition, zero-forcing beamforming is used at the shared relay to separate users spatially; multiple users are scheduled in the frequency domain to maximize frequency reuse. A heuristic but efficient scheduling and resource allocation algorithm is proposed accordingly. System-level simulations quantify the effectiveness of the proposed approach, and show that the incorporation of the shared relay can improve the overall network performance and in particular significantly increase the throughput of cell edge users as compared to separate relaying.Index Terms-Cellular systems, shared relay, wireless backhaul, orthogonal frequency-division multiplex (OFDM), scheduling, proportional fairness, zero-forcing (ZF) beamforming.

show abstract

Cooperative power allocation with partial channel information in multi‐cell multi‐user dual‐hop MIMO relay systems

Cho

Lee

2010

Int J Communication

View full text Add to dashboard Cite

SUMMARYThis paper considers cooperative power allocation with the use of partial channel state information (CSI) in a multi-user dual-hop relay system with multiple antennas. The end-to-end capacity can be improved by dynamically allocating the transmit power of the base station and relay according to co-channel interference caused by the adjacent relays. The proposed scheme allocates the transmit power in association with the eigenvalues and angle difference between the eigenvectors of transmit correlation matrices of the desired and interference channel. It is shown by means of upper-bound analysis that the end-to-end capacity of the proposed scheme can be maximized in highly correlated channel environments when the principal eigenvectors of transmit correlation matrices of the desired and interference channel are orthogonal to each other. It is also shown that the proposed scheme is robust to the channel estimation error. Finally, the performance of the proposed scheme is verified by the computer simulation.

show abstract

Relay Architectures for 3GPP LTE-Advanced

Cited by 237 publications

References 27 publications

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Fair scheduling and resource allocation for wireless cellular network with shared relays

Cooperative power allocation with partial channel information in multi‐cell multi‐user dual‐hop MIMO relay systems

Contact Info

Product

Resources

About