Skip to main content

On maximizing coverage in Gaussian relay channels

Publication ,  Journal Article
Aggarwal, V; Bennatan, A; Calderbank, AR
Published in: IEEE Transactions on Information Theory
June 17, 2009

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. © 2009 IEEE.

Duke Scholars

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

June 17, 2009

Volume

55

Issue

6

Start / End Page

2518 / 2536

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Aggarwal, V., Bennatan, A., & Calderbank, A. R. (2009). On maximizing coverage in Gaussian relay channels. IEEE Transactions on Information Theory, 55(6), 2518–2536. https://doi.org/10.1109/TIT.2009.2018337
Aggarwal, V., A. Bennatan, and A. R. Calderbank. “On maximizing coverage in Gaussian relay channels.” IEEE Transactions on Information Theory 55, no. 6 (June 17, 2009): 2518–36. https://doi.org/10.1109/TIT.2009.2018337.
Aggarwal V, Bennatan A, Calderbank AR. On maximizing coverage in Gaussian relay channels. IEEE Transactions on Information Theory. 2009 Jun 17;55(6):2518–36.
Aggarwal, V., et al. “On maximizing coverage in Gaussian relay channels.” IEEE Transactions on Information Theory, vol. 55, no. 6, June 2009, pp. 2518–36. Scopus, doi:10.1109/TIT.2009.2018337.
Aggarwal V, Bennatan A, Calderbank AR. On maximizing coverage in Gaussian relay channels. IEEE Transactions on Information Theory. 2009 Jun 17;55(6):2518–2536.

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

June 17, 2009

Volume

55

Issue

6

Start / End Page

2518 / 2536

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing