Throughput-Delay Trade-Off for Cognitive Radio Networks: A Convex Optimization Perspective

Hang Hu, Hang Zhang and Hong Yu

Abstract and Applied Analysis, 2014, vol. 2014, 1-8

Abstract:

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/430696.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/430696.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:430696

DOI: 10.1155/2014/430696

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().