Throughput-delay trade-off for cognitive radio networks: a convex optimization perspective (Q1724112)

Summary: 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.