Abstract: Cooperative communication for wireless networks has gained a lot of recent interests due to its ability to mitigate fading with exploration of spatial diversity. This paper studies the optimization problem of jointing routing and cooperative relay selection in multi-flow multi-radio cooperative wireless network, and model the problem of maximizing the minimum transmission rate of multiple flows as a mixed-integer linear programming problem. To solve this problem, a heuristic joint flow routing and relay node assignment algorithm based on branch-bound（JFRBB） is proposed. JFRBB is an iterative algorithm, it achieves the optimal solution by decomposing the original problem into several sub-problems based branch-bound method. The simulation results demonstrate that, compared with the performance achieved in multi-radio non-cooperative network and single radio cooperative network, JFRBB can make the multi-radio cooperative achieve much better performance of rate gain, and aggregate traffic.

Key words: cooperative communication, multi-radio, cooperative routing, relay node

摘要： 协作通信可以利用空间分集效应抵抗无线信道衰弱而得到广泛关注。在多业务流多跳多接口无线协作网络中，研究联合路由选择和协作节点分配的最优化问题，将最大化最小业务流速率的联合优化问题建模为混合整数线性规划问题。针对这个问题提出一种基于分支定界的启发式算法JFRBB。JFRBB算法基于分支定界的思想是将原问题分解为多个子问题通过迭代获得最优解。仿真实验结果表明，JFRBB下的多接口协作网络获得的传输速率、聚合流量明显优于多接口无协作网络和单接口协作网络的性能。

关键词: 协作通信, 多接口, 协作路由, 中继节点