Strategic Behavior of Cognitive Radio Networks With Different Information
Strategic Behavior of Cognitive Radio Networks With Different Information
复制标题
不同信息下认知无线电网络的策略行为
DOI：
10.1109/tvt.2019.2904574
复制
发表时间：
2019-03
影响因子：
6.8
通讯作者：
Li Wei Wayne
中科院分区：
文献类型：
--
作者：
Wang Jinting;Zhu Sheng;Li Wei Wayne
在认知无线电系统中，研究了在没有队列长度信息的情况下，单个主用户(PU)和次用户(SU)的均衡加入概率，以及在PU和SU观测到的部分队列长度信息和全部队列长度信息的情况下，PU和SU加入系统的均衡纳什平衡门限。PU随机发送PU请求，并且假设每个SU仅携带一个SU请求。每当完成PU(或SU)请求时，就向PU(或SU)发出奖励。然而，每个SU和PU在其在系统中的平均停留时间期间也分别收取持有成本。在本研究中，PU请求和SU请求都是自私的，它们的目的都是为了最大化自己的利益。我们的主要结论包括：在没有队列长度信息的情况下，确定了PU(或SU)加入系统的门限概率；在部分队列长度信息的情况下，确定了Nash平衡PU(SU)门限；在全队列长度信息的情况下，建立了多维Nash平衡门限。这些Nash Balance阈值整数值不仅取决于Nash Balance PU阈值，还取决于在该到达时间系统中SU请求的特定数量。此外，我们还讨论了输入参数对所得到的均衡加入概率和纳什平衡阈值的敏感性。我们从数学上证明了在无队列长度信息的情况下，SU的均衡加入概率并不一定随PU的传输速率而增加，数值观察到在部分和全部队列长度信息的情况下，到达SU所采用的纳什平衡门限都随着PU的传输速率的变化而变化。我们的结果和观察结果为在设计CRN时与战略用户一起做出决策提供了指导和重要的管理见解。
The equilibrium joining probabilities for a single primary user (PU) and secondary users (SUs) in the case of no queue length information, and the equilibrium Nash balance thresholds for PU and SUs to join the system in the cases of partial queue length information and full queue length information observed by PU and SUs are investigated in a cognitive radio system. PU stochastically sends PU requests and each SU is assumed to only carry one SU request. Whenever a PU (or an SU) request is completed, a reward is issued to the PU (or the SU). However, a holding cost is charged also for each SU and PU during their average sojourn time in the system respectively. Both of PU requests and SU requests are selfish in this research and their objectives are to maximize their own benefit. Our major conclusion includes a threshold probability value for PU (or SU) to join the system identified for the case of no queue length information, a Nash balance PU (SU) threshold value is determined for the case of partial queue length information; and the multi-dimensional Nash balance threshold is established for the case of full queue length information. These Nash balance threshold integer values depend on not only the Nash Balance PU-threshold value but also the specific number of SU requests in the system at that arriving time. In addition, we discuss the sensibility of input parameters to the obtained equilibrium joining probabilities and Nash balance thresholds. We mathematically verify that SUs’ equilibrium joining probability does not necessarily increase with the transmission rate of PU in no queue length information case and observe numerically that the Nash balance thresholds adopted by an arriving SU are fickle with the change of PU's transmission rate in both of partial and full queue length information cases. Our results and observations provide a guideline and important managerial insights in making decisions with strategic users in the design of CRNs.
登录
查看更多内容
影响因子：
2.4
作者：
P. Ekins
通讯作者：
P. Ekins
影响因子：
1.9
作者：
F. Blattner
通讯作者：
F. Blattner
影响因子：
1.6
作者：
Vicki D Crinis
通讯作者：
Vicki D Crinis
影响因子：
0.2
作者：
R. Eglash
通讯作者：
R. Eglash
DOI：
10.1080/13573320701467344
发表时间：
2004-01
期刊：
Wiley-Blackwell: Development Policy Review
影响因子：
--
作者：
J. Roberts;D. Shaw;P. Sahoo;N. Harris;B. Persaud;M. Thakur;I. Gillson;A. Suleiman
通讯作者：
J. Roberts;D. Shaw;P. Sahoo;N. Harris;B. Persaud;M. Thakur;I. Gillson;A. Suleiman