当前位置: X-MOL 学术IEEE Wirel. Commun. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Sensing-Mining-Access Tradeoff in Blockchain-Enabled Dynamic Spectrum Access
IEEE Wireless Communications Letters ( IF 6.3 ) Pub Date : 2020-12-18 , DOI: 10.1109/lwc.2020.3045776
Shisheng Hu , Yiyang Pei , Ying-Chang Liang

Dynamic spectrum access (DSA) is crucial to improve the utilization efficiency of the limited and precious radio spectrum resources. Recently, the application of blockchain is proposed to improve the security, distribution and transparency of DSA. However, in opportunistic spectrum access (OSA), the implementation of blockchain consumes considerable amount time in each time slot so that the time left for spectrum sensing and access will be decreased. Therefore, in this letter, we aim to optimize the frame structure regarding the sensing time and mining time so that the average achievable throughput is maximized. We first decouple the original optimization problem into two sub-optimization problems with respect to sensing time and mining time, respectively, and then prove that there exists a unique maximum point for both the two sub-optimization problems. After that, an alternating algorithm is proposed for the optimization. Using the simulations, the sensing-mining-access tradeoff and effectiveness of our proposed algorithm to optimize such a tradeoff are illustrated.

中文翻译:

启用区块链的动态频谱访问中的传感-采矿-访问权衡

动态频谱访问(DSA)对于提高有限而宝贵的无线电频谱资源的利用效率至关重要。最近,提出了区块链的应用,以提高DSA的安全性,分布性和透明度。但是,在机会频谱访问(OSA)中,区块链的实现在每个时隙中消耗大量时间,因此,频谱感知和访问所需的时间将减少。因此,在这封信中,我们旨在优化有关感测时间和挖掘时间的帧结构,以使平均可获得的吞吐量最大化。我们首先将原始优化问题解耦为两个分别针对感测时间和挖掘时间的子优化问题,然后证明两个子优化问题都有一个唯一的最大值。之后,提出了一种交替算法进行优化。使用仿真,说明了感知-挖掘-访问权衡和我们提出的算法以优化这种权衡的有效性。
更新日期:2020-12-18
down
wechat
bug