2. 中国电子科技集团公司 第二十八研究所,江苏 南京 210007;
3. 清华大学 自动化系,北京 100084
2. The 28th Research Inst. of China Electronics Technol.Group Corp.,Nanjing 210007,China;
3. Dept. of Automation,Tsinghua Univ.,Beijing 100084,China
在认知无线电中,系统框架可概括为衬底式(underlay)、机会式频谱接入(opportunistic spectrum access)和基于频谱感知的频谱共享(sensing-based spectrum sharing)3种[1–2]。在衬底式中,次用户无需感知主用户对信道的占用情况,在对主用户的平均干扰可接受的范围内,通过控制其发射功率实现对主用户信道的共享[3–5];在机会式频谱接入中,次用户通过一段时间的频谱感知,对主用户是否占用的状态进行检测,当主用户不占用时接入主用户的信道[6–8];在基于频谱感知的频谱共享中,次用户在频谱感知后,根据主用户对信道的占用情况选择不同的发射功率,当主用户不占用时,为了获得对信道的最大利用率,选择较大的发射功率,否则采用小的发射功率[9–12]。
以上3种框架中,Kang等[8]首先初步提出了在频谱感知的基础上进行功率分配的方法,Stotas等[10]提出基于频谱感知的频谱共享方法,该方法表现出了最优的系统性能,即次用户应该根据主用户的状态调节不同的发射功率。Chen等[11–12]分别提出了连续和多电平离散的发射功率分配算法,优化了次用户在判决主用户状态后的功率分配,但算法计算复杂度较高。这些算法为了实现考虑频谱感知,设置了专门的感知阶段,用于收集无线信号、检测主用户的状态,但是在次用户传输阶段,传输信息也可以用于进行频谱感知,从而能够大大提高感知样本的数量及正确率。
本文提出了一种用于传输阶段的频谱感知策略,并分析了基于解码信息的系统实现模型,通过对该问题进行数学建模,求解得出检测概率、发射功率等参数。相对于传统的认知无线电策略,该方案极大地提高了感知的信息量,在不增加对主用户平均干扰的前提下,提升了次用户对信道的综合利用率。考虑到实际通信系统误码率非常低(通常小于1%),研究了无感知阶段这一特殊情况,本文的结论可以推广到存在感知阶段的情况。本文为认知无线电的研究提供了一种新的思路,即综合利用所有的可用信息进行感知、决策和传输,不局限于固定的时隙分配。
1 系统模型考虑如图1所示的典型认知无线电系统,分别包括一个主用户发射机和接收机、次用户发射机和接收机。假设主用户占用一个信道,图1中,
![]() |
| 图1 认知无线电系统框架 Fig. 1 System model of the cognitive radio |
系统的帧结构如图2所示。在第
![]() |
| 图2 系统的帧结构 Fig. 2 Frame architecture of the system |
2 数学建模 2.1 基于解码的频谱感知分析
在第
| ${y_i} = \theta \sqrt {{\gamma _2}} x_i^{\rm{p}} + \sqrt g x_i^{\rm{s}} + {n_i}$ | (1) |
式中:
次用户SU2对
1)
| ${\overline y _i} = {n_i}$ | (2) |
2)
| ${\overline y _i} = 2\sqrt g x_i^{\rm{s}} + {n_i}$ | (3) |
3)
| ${\overline y _i} = \sqrt {{\gamma _2}} x_i^{\rm{p}} + {n_i}$ | (4) |
4)
| ${\overline y _i} = \sqrt {{\gamma _2}} x_i^{\rm{p}} + 2\sqrt g x_i^{\rm{s}} + {n_i}$ | (5) |
这4种情况的概率如下:
| ${\delta _1} = \Pr ({\lambda _i} = 1|\theta = 0) = 1 - Q\left( {\sqrt {g{P_{\rm{s}}}/{N_0}} } \right)$ | (6) |
| ${\delta _2} = \Pr ({\lambda _i} = 0|\theta = 0) = Q\left( {\sqrt {g{P_{\rm{s}}}/{N_0}} } \right)$ | (7) |
| ${\delta _3} = \Pr ({\lambda _i} = 1|\theta = 1) = 1 - Q\left( {\sqrt {g{P_{\rm{s}}}/({N_0} + {\gamma _2}{P_{\rm{p}}})} } \right)$ | (8) |
| ${\delta _4} = \Pr ({\lambda _i} = 0|\theta = 1) = Q\left( {\sqrt {g{P_{\rm{s}}}/({N_0} + {\gamma _2}{P_{\rm{p}}})} } \right)$ | (9) |
式中,
使用能量检测作为本文的检测方法,则相应的检验统计量可以写为:
| $y = \frac{1}{M}\sum\limits_{i = 1}^M {{{\left| {{{\overline y }_i}} \right|}^2}} $ | (10) |
情况1)和3)下,
| $f(\varepsilon |\theta = 0) = \frac{{{{\rm{e}}^{ - \varepsilon /{N_0}}}}}{{{N_0}}}{\delta _1} + \frac{{{{\rm{e}}^{ - (\varepsilon + 4g{P_{\rm{s}}})/{N_0}}}}}{{{N_0}}}{I_0}\left( {\sqrt {\varepsilon 16g{P_{\rm{s}}}/N_0^2} } \right){\delta _2}$ | (11) |
| $f(\varepsilon |\theta \!=\! 1) \!=\! \frac{{{{\rm{e}}^{ - \varepsilon /({N_0} + {\gamma _2}{P_{\rm{p}}})}}}}{{{N_0} + {\gamma _2}{P_{\rm{p}}}}}{\delta _3} \!+\! \frac{{{{\rm{e}}^{ - \frac{{\varepsilon + 4g{P_{\rm{s}}}}}{{{N_0} + {\gamma _2}{P_{\rm{p}}}}}}}}}{{{N_0} \!+\! {\gamma _2}{P_{_{\rm{p}}}}}}{I_0}\left(\!\! {\sqrt {\frac{{\varepsilon 16g{P_{\rm{s}}}}}{{{{\left( {{N_0} + {\gamma _2}{P_{\rm{p}}}} \right)}^2}}}} } \right){\delta _4}$ | (12) |
式中,
根据中心权限定理(central limit theorem),对于较大的
| $E(y|\theta = 0) = {N_0}{\delta _1} + ({N_0} + 4g{P_{\rm{s}}}){\delta _2}$ | (13) |
| $\begin{aligned}[b]V(y|\theta = 0) = & \frac{1}{M}\left\{ {2N_0^2{\delta _1} - {E^2}(y|\theta = 0) + } \right.\\& \left. {\left[ {{{({N_0} + 4g{P_{\rm{s}}})}^2} + N_0^2 + 8g{P_{\rm{s}}}{N_0}} \right]{\delta _2}} \right\}\end{aligned}$ | (14) |
| $E(y|\theta = 1) = ({N_0} + {\gamma _2}{P_{\rm{p}}}){\delta _3} + ({N_0} + {\gamma _2}{P_{\rm{p}}} + 4g{P_{\rm{s}}}){\delta _4}$ | (15) |
| $\begin{aligned} V(y|\theta = 1) & = \frac{1}{M}\left\{ {2{{({N_0} + {\gamma _2}{P_{\rm{p}}})}^2}} \right.{\delta _3} - {E^2}(y|\theta = 1) + \\& \left. {\left[ {{{({N_0} + {\gamma _2}{P_{\rm{p}}} + 4g{P_{\rm{s}}})}^2} + {{\left( {{N_0} + {\gamma _2}{P_{\rm{p}}}} \right)}^2} + 8g{P_{\rm{s}}}} \right]{\delta _4}} \right\}\end{aligned}$ | (16) |
采用能量检测法进行频谱决策,假设检测门限为
| ${P_{\rm{f}}} = Q\left( {\frac{{\eta - E(y|\theta = 0)}}{{\sqrt {V(y|\theta = 0)} }}} \right),\;{P_{\rm{d}}} = Q\left( {\frac{{\eta - E(y|\theta = 1)}}{{\sqrt {V(y|\theta = 1)} }}} \right)\!\!\!\!\!$ | (17) |
式(17)中,将
| ${P_{\rm{f}}}({P_{\rm{d}}}) = Q\left(\!\! {\frac{{{Q^{ - 1}}({P_{\rm{d}}})\sqrt {V(y|\theta = 0)} + E(y|\theta = 0) - E(y|\theta = 1)}}{{\sqrt {V(y|\theta = 1)} }}}\!\! \right)$ | (18) |
图2中,SU2利用剩余信号进行频谱感知,并决定下一帧的传输功率,如果感知结果为主用户没有占用信道,则分配功率
| ${R_{0|0}} = {\rm{lb}}\left( {1 + g{P_0}/{N_0}} \right)$ | (19) |
| ${R_{0|1}} = {\rm{lb}}\left( {1 + g{P_1}/{N_0}} \right)$ | (20) |
| ${R_{1|0}} = {\rm{lb}}\left( {1 + g{P_0}/({N_0} + {\gamma _2}{P_{\rm{p}}})} \right)$ | (21) |
| ${R_{1|1}} = {\rm{lb}}\left( {1 + g{P_1}/({N_0} + {\gamma _2}{P_{\rm{p}}})} \right)$ | (22) |
因此,下一帧中,SU2获得的平均信道容量为:
| $\begin{aligned}[b]R = & \Pr \left( {\theta = 0} \right)(1 - {P_{\rm{f}}}){R_{0|0}} + \Pr \left( {\theta = 0} \right){P_{\rm{f}}}{R_{0|1}} + \\ & \Pr \left( {\theta = 1} \right)(1 - {P_{\rm{d}}}){R_{1|0}} + \Pr \left( {\theta = 1} \right){P_{\rm{d}}}{R_{1|1}}\end{aligned}$ | (23) |
式中,
考虑次用户峰值发射功率约束,定义最大峰值发射功率为
| $0 \le {P_0},{P_1} \le \overline P $ | (24) |
考虑对主用户的平均干扰约束,定义平均干扰门限值为
| $\Pr \left( {\theta = 1} \right)\left( {(1 - {P_{\rm{d}}}){P_0} + {P_{\rm{d}}}{P_1}} \right){h_2} \le \overline I $ | (25) |
在式(24)、(25)的约束下,最大化次用户平均信道容量,相应的优化问题可以建模为:
| $\begin{array}{l}\mathop {\max {\rm{ }} \;\;R}\limits_{{P_0},{P_1},{P_{\rm{d}}}{\rm{ }}} \\\;\;\;{\rm{s}}{\rm{.t}}{\rm{.}}\;\;\;\;\;0 \le {P_{\rm{d}}} \le 1,式{\rm{ (24),(25)}}\end{array}$ | (26) |
式(26)对于参数
| $L({P_0},{P_1},\mu ) = R + \mu \left[ {\overline I - \Pr \left( {\theta = 1} \right)\left( {(1 - {P_{\rm{d}}}){P_0} + {P_{\rm{d}}}{P_1}} \right){h_2}} \right]$ | (27) |
相应的Lagrange dual优化问题可以写成:
| $\min \;\;g(\mu ) = \sup \;L({P_0},{P_1},\mu )$ | (28) |
求解式(26)和(28)等价。根据Karush Kuhn Tucker定理[14],对于给定的
| ${P_0} = \left\{ \begin{aligned}& \overline P ,\;\;\Pr \left( {\theta = 0} \right)\overline P {h_2} \le \overline {I}; \\& f\left( {\frac{{{A_0} + \sqrt {{\varDelta _0}} }}{2},[0,\overline P ]} \right),\;\;{\text{其他}}\end{aligned} \right.$ | (29) |
式中,
| $f(x,[a,b]) = \left\{ \begin{aligned}& a,\;x < a;\\& x,\;a \le x \le b;\\& b,\;x > b\end{aligned} \right.$ | (30) |
| $\begin{aligned}{A_0} = & \frac{{{\rm{lb}}(e)\left[ {\Pr \left( {\theta = 0} \right)(1 - {P_{\rm{f}}}) + \Pr \left( {\theta = 1} \right)(1 - {P_{\rm{d}}})} \right]}}{{\mu \Pr (\theta = 1)(1 - {P_{\rm{d}}}){h_2}}} - \\ & \frac{{2{N_0} + {\gamma _2}{P_{\rm{p}}}}}{g}\end{aligned}$ | (31) |
| $\begin{aligned}[b] & {\varDelta _0} =A_0^2 - \frac{4}{g}\left\{ {\frac{{{N_0}({N_0} + {\gamma _2}{P_{\rm{p}}})}}{g}} \right. - \\& \left. {\frac{{{\rm{lb}}(e)\left[ {\Pr \left( {\theta \!=\! 0} \right)(1 \!-\! {P_{\rm{f}}})({N_0} \!+\! {\gamma _2}{P_{\rm{p}}}) \!+\! \Pr \left( {\theta \!=\! 1} \right)(1 \!-\! {P_{\rm{d}}}){N_0}} \right]}}{{\mu \Pr (\theta = 1)(1 - {P_{\rm{d}}}){h_2}}}} \right\}\end{aligned}$ | (32) |
相应地,最优
| ${P_1} = \left\{ \begin{aligned}& \overline P ,\;\;\Pr \left( {\theta = 0} \right)\overline P {h_2} \le \overline I ;\\& f\left( {\frac{{{A_1} + \sqrt {{\Delta _1}} }}{2},[0,\overline P ]} \right),\;\;{\text{其他}}\end{aligned} \right.$ | (33) |
式中:
| ${A_1} = \frac{{{\rm{lb}}(e)\left[ {\Pr \left( {\theta = 0} \right){P_{\rm{f}}} + \Pr \left( {\theta = 1} \right){P_{\rm{d}}}} \right]}}{{\mu \Pr (\theta = 1){P_{\rm{d}}}{h_2}}} - \frac{{2{N_0} + {\gamma _2}{P_{\rm{p}}}}}{g}$ | (34) |
| $\begin{aligned}{\varDelta _1} = & A_1^2 - \frac{4}{g}\left\{ {\frac{{{N_0}({N_0} + {\gamma _2}{P_{\rm{p}}})}}{g}} \right. - \\ & \left. {\frac{{{\rm{lb}}(e)\left[ {\Pr \left( {\theta = 0} \right){P_{\rm f}}({N_0} + {\gamma _2}{P_{\rm{p}}}) + \Pr \left( {\theta = 1} \right){P_{\rm{d}}}{N_0}} \right]}}{{\mu \Pr (\theta = 1){P_{\rm{d}}}{h_2}}}} \right\}\end{aligned}$ | (35) |
得到最优的
式(26)中,当给定
| $\begin{aligned}[b]R = & {P_{\rm{f}}}\left( {\Pr \left( {\theta = 0} \right){R_{0|1}} - \Pr \left( {\theta = 0} \right){R_{0|0}}} \right) + \\& {P_{\rm{d}}}\left( {\Pr \left( {\theta = 1} \right){R_{1|1}} - \Pr \left( {\theta = 1} \right){R_{1|0}}} \right) + a\end{aligned}$ | (36) |
式中,
| ${P_{\rm{d}}} = f\left( {\frac{1}{{{P_1} - {P_0}}}\left( {\overline I /\Pr \left( {\theta = 1} \right)/{h_2} - {P_0}} \right),[0,1]} \right)$ | (37) |
给出一种循环求解方法,迭代求解系统最优参数:
1)设置初始值
2)根据式(18),求解
3)设置初始
4)根据式(37),求解
5)重复步骤2)~4),直至收敛。
4 数值仿真设置仿真参数为:总样本数为
图3为次用户平均信道容量关于次用户间信道增益的变化曲线。从图3中可以看出,相比于直接传输的衬底式策略,本文提出的策略极大地提高了次用户的平均信道容量。其原因主要是本文在直接传输的基础上,利用剩余信号进行频谱感知,获得了主用户是否存在的判决结果,基于此,进行发射功率的优化调整,进而提高了次用户的信道容量。
![]() |
| 图3 次用户平均信道容量关于信道增益的变化曲线 Fig. 3 Average rate of SU vs. channel gain of the SU |
图4为次用户平均信道容量关于主用户空闲概率的变化曲线。从图4中可以看出,在
![]() |
| 图4 次用户平均信道容量关于空闲概率的变化曲线 Fig. 4 Average rate of SU vs. absent probability of the PU |
5 结 论
本文提出了利用次用户传输阶段进行频谱感知的策略,并通过解码、能量检测等典型的实现对策略进行了分析,求解了最优的参数,并对没有进行频谱感知的传统策略进行了仿真对比分析。通过本文的研究和分析,为认知无线电的研究提供了一种新的思路,对次用户感知性能、信道容量的提升有很大的帮助。未来的研究中,考虑将本文的研究成果推广至机会式频谱接入和基于频谱感知的频谱共享场景中,获得更加精确的感知信息融合方法。
| [1] |
Haykin S. Cognitive radio:Brain-empowered wireless communications[J]. IEEE Journal of Selected Areas on Communication, 2005, 23(2): 201-220. DOI:10.1109/JSAC.2004.839380 |
| [2] |
Park J, Pawelczak P, Cabric D. Performance of joint spectrum sensing and MAC algorithms for multichannel opportunistic spectrum access Ad Hoc networks[J]. IEEE Transaction on Mobile Computing, 2011, 10(7): 1011-1027. DOI:10.1109/TMC.2010.255 |
| [3] |
Gong X W, Vorobyov S A, Tellambura C. Optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks[J]. IEEE Transactions on Signal Processing, 2011, 59(4): 1814-1826. DOI:10.1109/TSP.2010.2101069 |
| [4] |
Musavian L, Aissa S. Capacity and power allocation for spectrum sharing communications in fading channels[J]. IEEE Transactions on Wireless Communication, 2009, 8(1): 148-156. DOI:10.1109/T-WC.2009.070265 |
| [5] |
Liang Y C, Zeng Y, Peh E C Y. Sensing throughput tradeoff for cognitive radio networks[J]. IEEE Transactions on Wireless Communication, 2008, 7(4): 1326-1337. DOI:10.1109/TWC.2008.060869 |
| [6] |
Zhou X, Li G Y, Li D. Probabilistic resource allocation for opportunistic spectrum access[J]. IEEE Transactions on Wireless Communication, 2010, 9(9): 2870-2879. DOI:10.1109/TWC.2010.070610.091511 |
| [7] |
Ding G Y, Wang J L, Wu Q H. Robust spectrum sensing with crowd sensors[J]. IEEE Transactions on Wireless Communication, 2014, 62(9): 3129-3143. DOI:10.1109/TCOMM.2014.2346775 |
| [8] |
Kang X, Liang Y C, Garg H. Sensing-based spectrum sharing in cognitive radio networks[J]. IEEE Transactions on Vehicle Technology, 2009, 58(8): 4649-4654. DOI:10.1109/TVT.2009.2018258 |
| [9] |
Pei Y Y, Liang Y C, Teh Y C. How much time is needed for wideband spectrum sensing?[J]. IEEE Transactions on Wireless Communication, 2009, 8(11): 5466-5471. DOI:10.1109/TWC.2009.090350 |
| [10] |
Stotas S, Nallanathan A. Optimal sensing time and power allocation in multiband cognitive radio networks[J]. IEEE Transactions on Communication, 2011, 59(1): 226-235. DOI:10.1109/TCOMM.2010.110310.090473 |
| [11] |
Chen Z, Wang X D, Zhang X D. Continuous power allocation strategies for sensing-based multiband spectrum sharing[J]. IEEE Journal of Selected Areas on Communication, 2013, 31(11): 2409-2419. DOI:10.1109/JSAC.2013.131126 |
| [12] |
Chen Zhong,Gao Feifei,Zhang Zhengwei,et al.Multiple-level power allocation strategy in cognitive radio networks[J].EURASIP Journal on Advances in Signal Processing,2014,2014:51. https://link.springer.com/article/10.1186/1687-6180-2014-51
|
| [13] |
Bertsekas D P.Convex analysis and optimization[M].Nashua:Athena Scientific,2003.
|
| [14] |
Ben-Tal A,Nemirovski A.Lectures on modern convex optimization:Analysis,algorithms,and engineering applications[M].Philadelphia:Society for Industrial and Applied Mathematics,2001.
|
| [15] |
Boyd S,Vandenberghe L.Convex optimization[M].Cambridge:Cambridge University Press,2005.
|
2018, Vol. 50




