返回
Learning Temporal-Spatial Spectrum Reuse
DOI:10.1109/TCOMM.2016.2569093.png)
摘要
En 中文
We formulate and study a multi-user multi-armed bandit problem that exploits the temporal-spatial opportunistic spectrum access (OSA) of primary user (PU) channels, so that secondary users (SUs) who do not interfere with each other can make use of the same PU channel. We first propose a centralized channel allocation policy that has logarithmic regret, but requires a central processor to solve an NP-complete optimization problem at exponentially increasing time intervals. To overcome the high computation complexity at the central processor, we also propose heuristic distributed policies that, however, have linear regrets. Our first distributed policy utilizes a distributed graph coloring and consensus algorithm to determine SUs' channel access ranks, while our second distributed policy incorporates channel access rank learning in a local procedure at each SU at the cost of a higher regret. We compare the performance of our proposed policies with other distributed policies recently proposed for temporal (but not spatial) OSA. We show that all these policies have linear regrets in our temporal-spatial OSA framework. Simulations suggest that our proposed policies have significantly smaller regrets than the other policies when spectrum temporal-spatial reuse is allowed.
Keyword:
Cognitive radio
spectrum reuse
multi-armed bandit
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Joint Spectrum Sensing and Access Evolutionary Game in Cognitive Radio Networks认知无线电网络中的联合频谱感知和接入演化博弈
Quality of life and sexual satisfaction in women suffering from endometriosis: An Italian preliminary study
Sexologies
IF0
Correction: Clinical Applicability and Cutoff Values for an Unstructured Neuropsychological Assessment Protocol for Older Adults with Low Formal Education
PLoS ONE
IF0

