UM
Sensing-throughput tradeoff in cluster-based cooperative cognitive radio networks: A novel frame structure
Nie G.1; Wang Y.1; Li G.1; Xu M.1
2012-08-20
Source PublicationIEEE Vehicular Technology Conference
AbstractIn cooperative cognitive radio networks (CCRNs), the reporting time is consumed by all secondary users (SUs) for reporting the sensing results to the central node or fusion center. Intuitively, the performance of CCRNs will be degradation, since the more SUs for cooperation, the more reporting time for reporting sensing results. However, most previous studies have not considered this point. In this paper, a cluster-based cooperative spectrum sensing model is proposed in order to reduce the reporting time. Based on a novel frame structure, a sensingthroughput tradeoff problem considering the reporting time is formulated for two scenarios. The optimal clustering rule is obtained by maximizing the transmission time of all SUs. Then, a low-complexity solution is proposed to solve the tradeoff problem, which shows close-to-optimal performance by simulation. © 2012 IEEE.
DOI10.1109/VETECS.2012.6240200
URLView the original
Language英語
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.Beijing University of Posts and Telecommunications
2.Ministry of Education China
Recommended Citation
GB/T 7714
Nie G.,Wang Y.,Li G.,et al. Sensing-throughput tradeoff in cluster-based cooperative cognitive radio networks: A novel frame structure[C],2012.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Nie G.]'s Articles
[Wang Y.]'s Articles
[Li G.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Nie G.]'s Articles
[Wang Y.]'s Articles
[Li G.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Nie G.]'s Articles
[Wang Y.]'s Articles
[Li G.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.