两跳放大转发中继网络中的ε-全局最优多中继选择策略

doi:10.3969/j.issn.1000-0801.2011.08.010

电信科学 ›› 2011, Vol. 27 ›› Issue (8): 39-44.doi: 10.3969/j.issn.1000-0801.2011.08.010

两跳放大转发中继网络中的ε-全局最优多中继选择策略

徐加利,张海霞,袁东风

山东大学信息科学与工程学院济南 250100

出版日期:2011-08-15 发布日期:2011-08-15
基金资助:
山东大学自主创新基金资助项目;山东大学自主创新基金资助项目;山东大学自主创新基金资助项目

ε-Global Optimal Multiple Relay Selection Scheme for Dual-Hop Amplify-and-Forward Relay Networks

Jiali Xu,Haixia Zhang,Dongfeng Yuan

School of Information Science and Engineering,Shandong University,Jinan 250100,China

Online:2011-08-15 Published:2011-08-15

摘要/Abstract

摘要：

研究了并行两跳放大转发中继网络中的多中继选择策略问题。以接收端的信噪比（signal-to-noise ratio,SNR）最大化为目标，该问题首先被规划为0-1非线性整数规划问题，这是一个NP-hard问题，其最优解只可以通过穷举方法得到，但是对于节点数量很大的网络，低效的穷举方法是无法容忍的。基于分支定界（branch-and-bound）框架并结合线性变形放松技术（reformulation-linearization technique，RLT），提出了一种ε-全局最优的多中继选择策略。仿真结果表明该方法能很好地以预定精度ε逼近全局最优解。通过此方法得到的性能可以作为其他算法的参考基准。

关键词: 多中继选择, 信噪比最大化, 0-1非线性整数规划, 分支定界, 线性变形放松技术

Abstract:

This paper studies the problem of multiple relay selection in multiple parallel dual-hop amplify-and-forward（AF） relay networks.The problem is first formulated as a nonlinear integer programming （NLIP）problem,with the objective of maximizing signal-to-noise ratio（SNR）at destination node.This problem is NP-hard and optimal solution via exhaustive scheme is obviously time-inefficient for its intolerable exponential complexity.Then,a ε-global optimal solution algorithm based on a branch-and-bound architecture is proposed to resolve the NLIP problem with the employment the reformulation-linearization technique（RLT）.Numerical results indicate that the proposed algorithm can achieve global optimal solution with predefined accuracy ε.The solution via this proposed algorithm can work as a benchmark for other algorithms.

Key words: multiple relay selection, SNR maximization, nonlinear integral programming, branch-and-bound, reformulation-linearization technique

徐加利,张海霞,袁东风. 两跳放大转发中继网络中的ε-全局最优多中继选择策略[J]. 电信科学, 2011, 27(8): 39-44.

Jiali Xu,Haixia Zhang,Dongfeng Yuan. ε-Global Optimal Multiple Relay Selection Scheme for Dual-Hop Amplify-and-Forward Relay Networks[J]. Telecommunications Science, 2011, 27(8): 39-44.

图/表 5

参考文献 22

1	Sendonaris A , Erkip E , Aazhang B . User cooperation diversity-part Ⅰ:system description. IEEE Pervasive Computing, 2003,51(11): 1927～1938
2	Sendonaris A , Erkip E , Aazhang B . User cooperation diversity-part Ⅱ:implementation aspects and performance analysis. IEEE Trans Comm, 2003,51(11): 1939～1948
3	Nosratinia A , Hunter T E , Hedayat A . Cooperative communication in wireless networks. IEEE Commun Magazine, 2004,42(10): 74～80
4	Laneman J N , Wornell G W . Cooperative diversity in wireless networks:efficient protocols and outage behavior. IEEE Trans Inform Theory, 2004,50(12): 3062～3080
5	Laneman J N , Wornell G W . Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans Inform Theory, 2003,49(10): 2415～2425
6	Y-W Hong , W-J Huang , F-H Chiu , et al. Cooperative communications in resource-constrained wireless networks. IEEE Signal Processing Mag, 2007,24(3): 47～57
7	Yao Yingwei , Cai Xiaodong , Giannakis G B . On energy efficiency and optimum resource allocation of relay transmissions. IEEE Trans Wireless Commun, 2005,4(6): 2917～2927
8	Host-Madsen A , Erkip A , J Zhang . Capacity bounds and power allocation in wireless relay channel. IEEE Trans Inf Theory, 2005,51(6): 2020～2040
9	Deng X , Haimovich A M . Power allocation for cooperative relaying in wireless networks. IEEE Commun Lett, 2005,9(11): 994～996
10	Zhao Y , Adve R S , Lim T J . Improving amplify-and-forward relay networks:optimum power allocation versus selection. IEEE Trans on Wireless Commun, 2007,6(8): 3114～3123
11	Jing Y , Jafarkhani H . Network beamforming using relays with perfect channel information. IEEE Trans Inform Theory, 2009,55(6): 2499～2517
12	Jing Y , Jafarkhani H . Single and multiple relay selection schemes and their achievable diversity orders. IEEE Trans on Wireless Commun, 2009,8(3): 1414～1423
13	Bletsas A , Khisti A , Reed D , et al. A simple cooperative diversity method based on network path selection. IEEE Jour On Selected Areas Commun, 2006,24(3): 659～672
14	Bletsas A , Shin H , Win M Z . Outage optimality of opportunistic amplify-and-forward relaying. IEEE Commun Letters, 2007,11(3): 261～263
15	Li D , Sun X . Nonlinear integer programming. Springer, 2006
16	Jens Clausen . Branch and bound algorithms-principles and examples, March 12,1999
17	Boyd S , Erkip E , Mattingley J . Branch and bound methods.
18	Bazaraa M S , Sherali H D , Shetty C M . Nonlinear programming:theory and algorithms,second ed. John Wiley ＆ Sons, 1993
19	Sherali A , Erkip H D , Tuncbilek C H . A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J Global Optim, 1992,2(1): 101～112
20	Sherali H D , Adams W P . A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Boston,MA: Kluwer Academic, 1999
21	Shi Y , Hou Y T , Sherali H D . Cross-layer optimization for data rate utility problem in UWB-based ad hoc networks. IEEE Trans on Mobile Computing, 2008,7(6)
22

两跳放大转发中继网络中的ε-全局最优多中继选择策略

ε-Global Optimal Multiple Relay Selection Scheme for Dual-Hop Amplify-and-Forward Relay Networks

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 5

参考文献 22

相关文章 0

Metrics

推荐阅读 0