TY - JOUR
T1 - Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access
AU - Zafar, Ammar
AU - Alouini, Mohamed-Slim
AU - Chen, Yunfei
AU - Radaydeh, Redha Mahmoud Mesleh
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2012/5/20
Y1 - 2012/5/20
N2 - Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.
AB - Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.
UR - http://hdl.handle.net/10754/244131
UR - http://www.hindawi.com/journals/jcnc/2012/294581/
UR - http://www.scopus.com/inward/record.url?scp=84861942038&partnerID=8YFLogxK
U2 - 10.1155/2012/294581
DO - 10.1155/2012/294581
M3 - Article
SN - 2090-7141
VL - 2012
SP - 1
EP - 9
JO - Journal of Computer Networks and Communications
JF - Journal of Computer Networks and Communications
ER -