On Maximizing Coverage in Gaussian Relay Channels
Authors:
- 19 May 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (6) , 2518-2536
Abstract
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay, and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode-and-forward (DF) and compress-and-forward (CF) strategies for the relay channel with respect to the new objective of maximizing coverage. When the objective is maximizing rate, different locations of the destination favor different strategies. When the objective is coverage for a given rate, and the relay is able to decode, DF is uniformly superior in that it provides coverage at any point served by CF. When the channel model is modified to include random fading, we show that the monotone ordering of coverage regions is not always maintained. While the coverage provided by DF is sensitive to changes in the location of the relay and the path loss exponent, CF exhibits a more graceful degradation with respect to such changes. The techniques used to approximate coverage regions are new and may be of independent interest.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- Capacity Bounds and Power Allocation for Wireless Relay ChannelsIEEE Transactions on Information Theory, 2005
- On capacity of gaussian 'cheap' relay channel2005
- Wyner-Ziv Coding for the Half-Duplex Relay Channel2005
- Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage BehaviorIEEE Transactions on Information Theory, 2004
- Convex Optimization2004
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- On the Continuous Dependence of the Roots of a Polynomial on its CoefficientsThe American Mathematical Monthly, 1977
- A survey of multi-way channels in information theory: 1961-1976IEEE Transactions on Information Theory, 1977
- Three-terminal communication channelsAdvances in Applied Probability, 1971