Optimal and Near-Optimal Partner Selection Algorithms in Cooperative
MetadataTüm öğe kaydını göster
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.
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
Ata, Sezin; Yıldız, Olcay Taner (IEEE, 2012)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 ...
Su, Nuğman; Kaya, Onur; Ulukuş, Şennur; Koca, Mutlu (Institute of Electrical and Electronics Engineers Inc., 2016-02-23)We consider a cooperative multiple access channel (MAC) with two energy harvesting transmitters. The transmitters perform delay constrained transmission, i.e., every information block is encoded, transmitted and decoded ...
Dinçmen, Erkin; Altınel, Tunç (Institute of Electrical and Electronics Engineers Inc., 2015-07-07)A self optimizing control algorithm is applied to the ABS control problem where the algorithm accomplishes to maximize friction potential of the tires during braking in unknown road conditions. Simulation studies are ...