Three-terminal communication channels

Meulen, Edward C. van der

doi:10.1017/s0001867800037605

Cited by 456 publications

(700 citation statements)

References 2 publications

Supporting

Mentioning

691

Contrasting

Unclassified

Order By: Relevance

“…The general relay channel model was introduced in 1971 by van der Meulen in [1,2]. In 1979, Cover and Gamal analysed 'Capacity theorems for the relay channel' [3] in great detail.…”

Section: Related Workmentioning

confidence: 99%

Resource allocation for the multiple-access relay channels and OFDMA

Schedler

Kühn

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Within this article, the resource allocation problem for the multiple-access relay channel with orthogonal channel access is analysed. We propose a centralised optimisation framework that maximises the achievable sum rate of the network and that can be applied to a wide range of scenarios. We analyse different approaches to tackle the problem with individual transmit power constraints such as relaxing of constraints and splitting of the joint problem into a carrier allocation and individual power allocations. The carrier allocation deals with the exclusive assignment of subcarriers to different users, and the power allocation addresses the distribution of available power over assigned subcarriers. Several approaches are proposed for amplify and forward, decode and forward, and compress and forward strategies, and the performance as well as computational effort is evaluated by simulations. The obtained results suggest that the proposed algorithms can perform close to optimal.

show abstract

“…The general relay channel model was introduced in 1971 by van der Meulen in [1,2]. In 1979, Cover and Gamal analysed 'Capacity theorems for the relay channel' [3] in great detail.…”

Section: Related Workmentioning

confidence: 99%

Resource allocation for the multiple-access relay channels and OFDMA

Schedler

Kühn

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…From information theory research, the relay channel capacity was studied more than three decades ago in [18], and later considered by [19]. However, this capacity, which was intended for wired network, was derived based on the assumption that all nodes can transmit and receive simultaneously.…”

Section: Related Workmentioning

confidence: 99%

Efficient Wireless Extension Point Placement Algorithm in Urban Rectilineal WLANs

Liang

2008

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-With a small amount of software modification, wireless Extension Points (EPs), which are now commercially available, can be used to improve the throughput capacity of a Wireless Local Area Network (WLAN). An EP is an immobile device that has access to the power supply or is equipped with a high capacity battery but does not have direct access to the Internet. They relay data wirelessly between the Access Point (AP) and the mobile hosts. In this paper, we investigate the optimal placement of EPs such that the throughput capacity of an urban rectilineal WLAN can be maximized. Two channel models are studied, based on the Shannon capacity bound and IEEE 802.11 specifications. We first formulate a solution for the optimal EP placement problem in a general network scenario as a non-linear programming problem, then we propose an efficient algorithm that determines the optimal locations of a fixed number of EPs in a rectilineal network. Our results show that, for a wide range of system parameters, the optimally placed EPs can significantly increase the network throughput capacity. Moreover, we study how the number of EPs, transmission power, path loss exponent, channel models and traffic characteristics affect the optimal EP placement and expected throughput capacity of the network.Index Terms-wireless local area networks, access point, extension point, optimal placement, capacity improvement, mathematical programming/optimization.

show abstract

“…This is based on the truth that the source always need to spend much more power at Step 1 1 . Therefore, we can have the following description…”

Section: Step 2: Compensation Processmentioning

confidence: 99%

“…Since 1971, van der Mulen introduced the three-terminal relay channel [1], there has been already a significant research activity towards what is called cooperative communications. These have included the work on capacity theorem (e.g., [2]- [3]), relaying or cooperation protocols (e.g., [4]- [5]), diversity and multiplexing gain (e.g., [6]- [7]), etc.…”

Section: Introductionmentioning

confidence: 99%

Bit and power loading for OFDM with an amplify-and-forward cooperative relay

Tafazolli

2008

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Abstract-In this paper, we propose a rate-adaptive bit and power loading approach for the OFDM-based relaying communications. The cooperative relay operates in the half-duplex amplify-and-forward mode. The source and the relay has the separate power constraints. The maximum-ratio combining is employed at the destination for maximizing the received SNR. Assuming the perfect channel knowledge available at all nodes, the proposed approach is to maximize the throughput (the number of bits/symbol) at the given power constraint and the target link performance. Unlike the water-filling method, the proposed approach does not need the iterative loading process, and can offer the sub-optimum performance. Computer simulations are used to test the proposed approach for various scenarios with respect to the relay location or the distributed power allocation.

show abstract

Three-terminal communication channels

Cited by 456 publications

References 2 publications

Resource allocation for the multiple-access relay channels and OFDMA

Resource allocation for the multiple-access relay channels and OFDMA

Efficient Wireless Extension Point Placement Algorithm in Urban Rectilineal WLANs

Bit and power loading for OFDM with an amplify-and-forward cooperative relay

Contact Info

Product

Resources

About