Skip to content

Heinrich-Hertz-Lehrstuhl

für Informationstheorie und theoretische

Informationstechnik

Sections
Personal tools
You are here: Home » Publications » Objekte » 2008 » Bidirectional Regenerative Half-duplex Relaying using Relay Selection

Bidirectional Regenerative Half-duplex Relaying using Relay Selection

Document Actions

Authors

Reference
IEEE Transactions on Wireless Communications, vol. 7, no. 5, pp. 1879-1888 , May 2008.

Abstract

We consider the problem of relay selection in a network with N relay nodes. A half-duplex relay node enables bidirectional communication between two nodes with a spectrally efficient two-phase protocol. In the first phase both nodes transmit their messages to a relay node, which decodes the messages and broadcasts a composition using superposition encoding in the succeeding phase. The probability that the achievable rate region of one relay node contains all other rate regions decreases with the number of relay nodes N. Therefore, we propose a relay selection criterion that decides according to the weighted rate sum for any bidirectional rate pair on the boundary of the achievable rate region individually. If we allow time-sharing between the usage of different relay nodes, we can enlarge the achievable rate region. In an iid Rayleigh fading scenario relay selection realizes multi-user space diversity so that the sum-rate of any rate pair on the boundary of the ergodic rate region asymptotically grows with theta(log(log(N))).

Subject areas
  • Network / QoS Optimization
  • Signal Processing
 
IEEEtran BibTeX-Entry
@article{OB08brru,
   author          = "Tobias J. Oechtering and Holger Boche", 
   title           = "{Bidirectional Regenerative Half-duplex Relaying using Relay Selection}", 
   journal         = "IEEE Transactions on Wireless Communications", 
   volume          = "7", 
   number          = "5", 
   pages           = "1879--1888 ", 
   month           = may, 
   year            = "2008", 
}

Last modified 26.05.2008 14:23
« May 2013 »
Mo Tu We Th Fr Sa Su
    1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31    
 
 

Powered by Plone