CTH17-2: Energy-efficient cooperative relaying over fading channels with simple relay selection
Author
Summary, in English
We consider a cooperative wireless network where the source broadcasts data to relays, some or all of which cooperatively beamform to forward the data to the destination. The network is subject to an overall outage constraint. We generalize the standard approaches for cooperative communications in two respects: (i) we explicitly model and factor in the cost of acquiring
channel state information (CSI), and (ii) we consider more general, yet simple, selection rules for the relays and compute the optimal one among them. These rules include as special cases several relay selection criteria proposed in the literature. We present analytical results for the
homogeneous case, where the links have identical mean channel gains. For this case, we show that the optimal transmission scheme is simple and can be computed efficiently. Numerical results show that while the cost of training and feedback of CSI is significant, relay cooperation is still beneficial.
channel state information (CSI), and (ii) we consider more general, yet simple, selection rules for the relays and compute the optimal one among them. These rules include as special cases several relay selection criteria proposed in the literature. We present analytical results for the
homogeneous case, where the links have identical mean channel gains. For this case, we show that the optimal transmission scheme is simple and can be computed efficiently. Numerical results show that while the cost of training and feedback of CSI is significant, relay cooperation is still beneficial.
Publishing year
2006
Language
English
Publication/Series
IEEE
Document type
Conference paper
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
IEEE Global Telecommunications Conference, 2006
Conference date
2006-11-27 - 2006-12-01
Conference place
San Francisco, CA, United States
Status
Published
Research group
- Radio Systems
ISBN/ISSN/Other
- ISSN: 1930-529X
- ISBN: 1-4244-0356-1