Joint Power Allocation and Relay Selection Optimization for Cognitive Radio Networks

Article Preview

Abstract:

This paper investigates the joint power allocation (PA) and relay selection scheme (RS) in two-way relaying cognitive radio networks consisting of multiple user-pairs and multiple relays. In order to reduce the computational complexity for practical scenario, we propose a branch and bound based (BnB-based) power allocation and relay selection scheme and a greedy power allocation and relay selection scheme to maximize the system throughput. The system is assumed under the constraint that the interference power from the secondary nodes in two way relay systems to primary user (PU) shall be less than a predefined interference threshold which can guarantee the normal communication of PU. Numerical simulation results show that the optimal PA and RS scheme has the highest system capacity, however, the greedy PA and RS scheme has the lowest complexity. The proposed BnB-based PA and RS scheme has the better tradeoff of system throughput and complexity than the above two schemes.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1153-1159

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Nosratinia, T.E. Hunter, and A. Hedayat, Cooperative communication in wireless networks, IEEE Commun. Magazine, vol. 42, no. 10, pp.74-80, Oct, (2004).

DOI: 10.1109/mcom.2004.1341264

Google Scholar

[2] J. N. Laneman, D. N. C. Tse, G. W. Wornell, Cooperative diversity in wireless networks: Efficient protocols and outage behavior, IEEE Trans. Inf. Theory, vol. 50, no. 12, pp.3062-3080, Dec. (2004).

DOI: 10.1109/tit.2004.838089

Google Scholar

[3] M. Chen and A. Yener, Power Allocation for Multi-Access Two-Way Relaying, in IEEE proc. ICC, June (2009).

DOI: 10.1109/icc.2009.5199348

Google Scholar

[4] Xuehua Zhang, Ali Ghrayeb and Mazen Hasna. Network Coding and Relay Assignment Schemes for Systems with Multiple Two-way Relay Channels, in IEEE proc. ICC, May. (2010).

DOI: 10.1109/tcomm.2013.052013.120790

Google Scholar

[5] Federal Communications Commission (FCC), Spectrum policy task force, ET Docket no. 02-135, Nov. 15, (2002).

Google Scholar

[6] Jemin Lee, Hano Wang, Jeffrey G. Andrews, and Daesik Hong, Outage Probability of Cognitive Relay Networks with Interference Constraints.

Google Scholar

[7] D. Michalopoulos and G. Karagiannidis, Performance Analysis of Single Relay Selection in Rayleigh Fading, IEEE Transactions on Wireless Communications, Vol. 7, Issue 10, pp.3718-3724, Oct. (2008).

DOI: 10.1109/t-wc.2008.070492

Google Scholar

[8] B. Rankov and A. Wittneben, Spectal efficient protocols for half-duplex fading relay channels, IEEE J. Sel. Areas Commun, Vol. 25, no. 2, pp.379-389, Feb. (2007).

DOI: 10.1109/jsac.2007.070213

Google Scholar

[9] A. Muller and J. Speidei, Relay Selection in Dual-Hop Transmission Systems: Selection Strategies and Performance Results, IEEE proc. ICC, pp.4998-5003, May (2008).

DOI: 10.1109/icc.2008.937

Google Scholar

[10] K. Koh,S. Kim, A. Mutapcic, and S. Boyd, gpposy: A matlab solver for geometric programs in posynomial form, Technical report, Stanford University, May (2006).

Google Scholar

[11] Ninad Thakoor, Jean Gao, Branch-and-Bound for Model Selection and Its Computational Complexity, IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 5, May (2011).

DOI: 10.1109/tkde.2010.156

Google Scholar

[12] S. Boyd ,J. Mattingley, Branch and bound methods., [Online]. Lecture notes for EE364b, Convex Optimization II, Stanford University, Fall (2008).

Google Scholar