Open Access
2014 Throughput-Delay Trade-Off for Cognitive Radio Networks: A Convex Optimization Perspective
Hang Hu, Hang Zhang, Hong Yu
Abstr. Appl. Anal. 2014: 1-8 (2014). DOI: 10.1155/2014/430696


The throughput-delay trade-off problem for cooperative spectrum sensing (CSS) is investigated. It is proved that the maximum achievable throughput and the minimum transmission delay cannot be obtained simultaneously. An efficient algorithm is proposed to optimize the sensing bandwidth and the final decision threshold jointly such that the throughput is maximized while the delay is constrained. It is demonstrated that convex optimization plays an essential role in solving the problem in an efficient way. Simulation results show that the proposed optimal scheme can significantly improve the throughput of the secondary users (SUs) under the constraint that the delay Quality of Service (QoS) requirements of the SUs are satisfied.


Download Citation

Hang Hu. Hang Zhang. Hong Yu. "Throughput-Delay Trade-Off for Cognitive Radio Networks: A Convex Optimization Perspective." Abstr. Appl. Anal. 2014 1 - 8, 2014.


Published: 2014
First available in Project Euclid: 2 October 2014

zbMATH: 07022378
MathSciNet: MR3198190
Digital Object Identifier: 10.1155/2014/430696

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top