论文部分内容阅读
针对多用户多中继场景,为了进一步提升系统的吞吐量,需要为用户选择合适的中继协助其传输.考虑到多址网络编码中继的中继选择问题是一个复杂的优化问题,为了降低其求解复杂度,将中继网络建模为带权二分图,中继选择最优解即转化为图论中求二分图最大赋权匹配问题.分别将Kuhn和Munkres(KM)算法和贪婪算法应用于多址接入中继网络的中继选择,蒙特卡洛仿真结果表明,KM算法求解的遍历容量略高于贪婪算法.
For multi-user multi-relay scenario, in order to further improve system throughput, users need to select the appropriate relay to assist their transmission.Considering the multiple access network coding relay selection problem is a complex optimization problem, in order to reduce Which solves the complexity, the relay network is modeled as a weighted bisection, and the optimal solution of the relay selection is transformed into the maximum weight matching problem of the bipartite graph in the graph theory.The Kuhn and Munkres (KM) algorithms and the greedy algorithm Which is applied to the relay selection of multiple access relay networks. The Monte Carlo simulation results show that the KM algorithm solves slightly more ergodic capacity than the greedy algorithm.