.png){kind=icon}
返回
Throughput-Optimal Queue Length Based CSMA/CA Algorithm for Cognitive Radio Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2014.2343613.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cognitive radio networks allow unlicensed users to access licensed spectrum opportunistically without disrupting primary user (PU) communication. Developing a distributed implementation that can fully utilize the spectrum opportunities for secondary users (SUs) has so far remained elusive. Although throughput optimal algorithms based on the well-known maximal weight scheduling (MWS) algorithm exist for cognitive radio networks, they require central processing of network-wide SU information. In this paper, a new distributed algorithm is introduced that asymptotically achieves the capacity region of the cognitive radio systems. The proposed algorithm achieves the full SU capacity region while adapting to the channel availability dynamics caused by unknown primary user activity. Extensive simulation results are provided to illustrate the efficacy of the algorithm.
Keyword:
Cognitive radio networks
CSMA
throughput optimal
distributed
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.6K
被引数:
1.8W