Optimal and near-optimal partner selection algorithms in cooperative OFDMA
Citation
Bakşi, S., Kaya, O. & Bıyıkoğlu, T. (2012). Optimal and near-optimal partner selection algorithms in cooperative OFDMA. Paper presented at the 2012 IEEE Wireless Communications and Networking Conference (WCNC), 475-479. doi:10.1109/WCNC.2012.6214413Abstract
We obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner selection steps can be performed sequentially, and the latter step can be formulated as a maximum weighted matching problem on an undirected graph, which can be solved in polynomial time. We further propose practical algorithms, and compare their performances to the optimal matching algorithm, and demonstrate that very simple and low complexity algorithms based on user-user and user-receiver distances may provide near-optimum rate performance. Moreover, we observe that algorithms that achieve superior sum-rate performance, surprisingly pair the cell edge users, with the strong users near the base station.
Source
2012 IEEE Wireless Communications and Networking Conference (WCNC)Related items
Showing items related by title, author, creator and subject.
-
Improving the calibration time of traffic simulation models using parallel computing technique
Dadashzadeh, Nima; Ergün, Murat; Kesten, Ali Sercan; Zura, Marijan (Institute of Electrical and Electronics Engineers Inc., 2019-06)The calibration procedure for traffic simulation models can be a very time-consuming process in the case of a large-scale and complex network. In the application of Evolutionary Algorithms (EA) such as Genetic Algorithms ... -
BinBRO: Binary Battle Royale Optimizer algorithm
(Rahkar Farshi), Taymaz Akan; Agahian, Saeid; Dehkharghani, Rahim (Elsevier Ltd, 2022-02-04)Stochastic methods attempt to solve problems that cannot be solved by deterministic methods with reasonable time complexity. Optimization algorithms benefit from stochastic methods; however, they do not guarantee to obtain ... -
Searching for the optimal ordering of classes in rule induction
Ata, Sezin; Yıldız, Olcay Taner (IEEE, 2012-11-15)Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...