{"title":"Throughput performance optimization in cognitive radio networks under Rayleigh fading","authors":"Hyeonje Cho, G. Hwang","doi":"10.1109/WCNC.2012.6214001","DOIUrl":null,"url":null,"abstract":"We consider a time slotted cognitive radio (CR) network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users' channels. In the contention, all SUs use common access probabilities to decide whether they access one of available channels. We focus on the throughput performance of an arbitrary SU. To improve the throughput performance of SUs, it is desirable that the access probabilities are adapted to the information on channel status and fading condition. In the analysis, we derive the optimal access probabilities that maximize the throughput performance of an arbitrary SU. From our analysis, we provide an insight on how to obtain optimal access probabilities in the CR network. We also investigate the effect of the knowledge of channel status and fading condition on throughput performance. Numerical results are provided to investigate throughput performance behavior.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6214001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We consider a time slotted cognitive radio (CR) network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users' channels. In the contention, all SUs use common access probabilities to decide whether they access one of available channels. We focus on the throughput performance of an arbitrary SU. To improve the throughput performance of SUs, it is desirable that the access probabilities are adapted to the information on channel status and fading condition. In the analysis, we derive the optimal access probabilities that maximize the throughput performance of an arbitrary SU. From our analysis, we provide an insight on how to obtain optimal access probabilities in the CR network. We also investigate the effect of the knowledge of channel status and fading condition on throughput performance. Numerical results are provided to investigate throughput performance behavior.