基于二分图最大赋权匹配的网络编码中继选择  

Network Coded Relay Selection Based on Maximum Weight Matching

作　　者：纪晓东[1] 谢信乾[1] 

机构地区：[1]泛网无线通信教育部重点实验室(北京邮电大学),北京100876

出　　处：《北京邮电大学学报》2011年第5期33-37,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家科技重大专项项目(2010ZX03003-003-01)

摘　　要：针对多用户多中继场景,为了进一步提升系统的吞吐量,需要为用户选择合适的中继协助其传输.考虑到多址网络编码中继的中继选择问题是一个复杂的优化问题,为了降低其求解复杂度,将中继网络建模为带权二分图,中继选择最优解即转化为图论中求二分图最大赋权匹配问题.分别将Kuhn和Munkres(KM)算法和贪婪算法应用于多址接入中继网络的中继选择,蒙特卡洛仿真结果表明,KM算法求解的遍历容量略高于贪婪算法.In wireless multiple access relay networks, network coded relay can help two users transmit messages in the same time frequency resource without interference. Base station recovers the origin messages utilizing joint detection, and the achievable rate increases. In multiple-relay scenario, proper relay selection methods can further improve the overall throughput. Since relay selection is a complex optimization problem, to reduce the complexity, the network is modeled as a weighted bipartite graph and relay selection problem turns into the maximum weight matching problem. The Kuhn and Munkres （KM） algorithm and the greedy algorithm are utilized to solve the relay selection for multi-access network, and Monte Carlo. Simulations show that the KM algorithm achieves a bit higher ergodic capacity than that of greedy algorithm.

关 键 词：网络编码 中继选择 最大赋权匹配 

分 类 号：TN925.3[电子电信—通信与信息系统]