Matching algorithms for infrastructure-based wireless networks employing cooperative diversity system
Veluppillai Mahinthan, Lin Cai, J.W. Mark, Xuemin Shen · 2006
We study how to optimally group active users in an infrastructure-based wireless network employing two-user- based cooperative diversity technology in order to maximize the cooperative diversity gain in the network. The optimization problem is formulated as a non-bipartite weighted-matching problem, which can be solved with the state-of-the-art maximum weighted-matching algorithm in polynomial time O(n 3 ) .T o reduce the computational complexity, we develop a Worst-Link- First (WLF) matching algorithm, which gives the user with the worse channel condition and the higher energy consumption rate a higher priority to choose its partner. The computational complexity of the proposed WLF algorithm is O(n 2 ) while the achieved average energy gain is only slightly lower than that with the optimal maximum weighted-matching algorithm. Numerical results demonstrate that, with the WLF matching algorithm, 5 ∼ 7 dB energy gain can be achieved.