Optimal and near-optimal partner selection algorithms in cooperative OFDMA
Yükleniyor...
Dosyalar
Tarih
2012
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Power allocation, Systems, Uplink, Subcarrier, Diversity, Fading, Heuristic algorithms, Receivers, Resource management, Signal to noise ratio, Wireless networks, Complexity algorithms, Cooperative OFDMA system, Jointly optimal power allocation, Maximum weighted matching problem, Near-optimal partner selection, Optimal matching algorithm, Partner selection policies, Polynomial time, Undirected graph, User-receiver distance, User-user distance, Computational complexity, Frequency division multiple access, Graph theory
Kaynak
2012 IEEE Wireless Communications and Networking Conference (WCNC)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
Sayı
Künye
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.6214413
