哈尔滨工业大学通信技术研究所,哈尔滨,150001
网络首发:2009-08-10,
纸质出版:2009
移动端阅览
王荆宁, 沙学军, 卢为党, 等. 改进的集中式协作用户选择方法[J]. 西安交通大学学报, 2009,43(8):64-67+71.
Improved Selection Methods for Concentrative Cooperative Partners[J]. 2009, 43(8): 64-67+71.
针对协作分集系统中协作用户选择方法计算复杂度较高的缺点
提出了2种改进的协作用户选择方法——信道最优方法和非互惠信道最优方法.信道最优方法首先为信道最差的用户选择一个与其信道最优的用户作为协作伙伴
两用户互相作为对方的协作伙伴转发对方的信息
并且引入了2个信噪比门限来避免不必要的协作过程; 非互惠信道最优方法是为信道最差的用户选择一个信道最优的用户作为协作伙伴
为其转发信息
而该协作伙伴则另外选择一个最优的用户作为自己的协作伙伴.仿真表明
在小区内的用户数达到50以上的时候
这2种协作用户选择方法在能量增益与最差链路优先匹配算法相当的基础上
可以省略复杂度为O(N
2
)的计算.
Focusing on the high computational complexity of partner selection methods in cooperative systems
two improved partner selection methods are proposed. These are the best channel matching strategy and the non-reciprocal best channel matching strategy. The user with the worst link is firstly taken into account in the best channel matching strategy. Then the user with the best inter-user channel quality is selected by the method as his partner. The two users cooperate to relay information for each other
and unnecessary cooperative process is avoided by setting up two special thresholds of signal-to-noise. The non-reciprocal best channel matching strategy starts from the user with the worst link and then selects the user with the best inter-user channel as a partner for each user. Simulation results show that both the partner selection strategies can reduce O(N
2
)computation complexity
meanwhil
e keep the same energy gain as the existing worst-link-first algorithm.
ALAMOUTI S M. A simple transmit diversity technique for wireless communications [J]. IEEE Journal on Selected Areas in Communications,1998, 16(8): 1451-1458.
SENDONARIS A, ERKIP E, AAZHANG B. User cooperation diversity,part I: system description [J]. IEEE Transactions on Communications, 2003, 51(11): 1927-1938.
BLETSAS A, KHISTI A, REED D P, et al. A simple cooperative diversity method based on network path selection [J]. IEEE Journal on Selected Areas in Communications, 2006, 24(3): 659-672.
BLETSAS A, SHIN H, WIN M Z, et al. Cooperative diversity with opportunistic relaying [C]∥IEEE Wireless Communications and Networking Conference. Piscataway, NJ, USA: IEEE, 2006:1034-1039.
GABOW H N. An efficient implementation of Edmonds' algorithm for maximum matching on graphs [J].Journal of the ACM, 1976, 23(2): 221-234.
AVIS D. A survey of heuristics for the weighted matching problem [J]. Networks, 1983, 13(4): 475-493.
MAHINTHAN V, CAI L, MARK J W, et al. Maximizing cooperative diversity energy gain for wireless networks [J]. IEEE Transactions on Wireless Communications, 2007, 6(7): 2530-2539.
NOSRATINIA A, HUNTER T E. Grouping and partner selection in cooperative wireless networks [J]. IEEE Journal on Selected Areas in Communications, 2007, 25(2): 369-378.
ZHANG Xiaojuan, GONG Yi. Power allocation for regenerative cooperative systems with multi-antenna destination [C]∥IEEE International Conference on Communications. Piscataway, NJ, USA: IEEE, 2008: 3755-3759.
MAHINTHAN V, MARK J W, SHEN X. A cooperative diversity scheme based on quadrature signaling [J]. IEEE Transactions on Wireless Communications, 2007, 6(1): 41-45.
MAHINTHAN V, CAI L, MARK J W, et al. Partner selection based on optimal power allocation in cooperative-diversity systems [J]. IEEE Transactions on Vehicular Technology, 2008, 57(1): 511-520.
0
浏览量
4
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621