Enhanced Power Allocation and Relay Selection Scheme in Two-Way Relaying Cognitive Radio Networks

Article Preview

Abstract:

This paper addresses the enhanced 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. Simulation results show that the proposed BnB-based PA and RS scheme can achieve better tradeoff of system throughput and complexity.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1979-1983

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[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] 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

[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] 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

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

Google Scholar

[6] 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

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

Google Scholar