An Effective Hungarian Algorithm-Based Pairing Strategy for RAMA

In this paper, a close upper bound of the sum rate of a relay-aided multiple access (RAMA) model is deduced and a method is proposed to solve the user pairing problem of RAMA. In our concerned model, some users (UEs) is exploited as relays in order to improve the transmit rate of other UEs that are in bad channel condition. The ideal sum rate of the model is deduced according to Shannon's theorem. Based on the expression of sum rate, the method is studied to match RAMA pairs and proposed an algorithm which is based on Hungarian algorithm. It provides high transmit rate and is of relatively low cost. In our research the rate of both the whole cell and the best matched pair is considered. The simulation results of our proposed method confirmed that the solution based on Hungarian algorithm can achieve nearly optimum performance.