Research Article
Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis
408 downloads
@INPROCEEDINGS{10.1007/978-3-642-29222-4_28, author={Erwu Liu and Qinqing Zhang and Kin Leung}, title={Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis}, proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers}, proceedings_a={QSHINE}, year={2012}, month={10}, keywords={Cooperative communications proportional fairness}, doi={10.1007/978-3-642-29222-4_28} }- Erwu Liu
Qinqing Zhang
Kin Leung
Year: 2012
Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis
QSHINE
Springer
DOI: 10.1007/978-3-642-29222-4_28
Abstract
We consider the problem of 2-node cooperation for cellular networks. In the considered system, a node and a cooperative relay are selected in a proportionally fair (PF) manner to transmit to the base station (BS), which uses the maximal ratio combining (MRC) for reception. The proposed scheme integrates the PF criterion in selective cooperation to maximize the overall utility of all 2-node cooperative transmissions, and is called (PFSC). This technique does not require distributed space-time coding algorithms and its simplicity allows for immediate implementation in existing hardware.
Copyright © 2010–2024 ICST
