Joint spectrum sensing and access for stable dynamic spectrum aggregation

被引:2
作者
Wang, Wei [1 ,2 ]
Wu, Lingcen [1 ]
Zhang, Zhaoyang [1 ]
Chen, Lin [3 ]
机构
[1] Zhejiang Univ, Zhejiang Key Lab Informat Network Technol, Dept Informat Sci & Elect Engn, Hangzhou 310027, Peoples R China
[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[3] Univ Paris 11, Dept Comp Sci, LRI, F-91405 Orsay, France
基金
中国国家自然科学基金;
关键词
Cognitive radio; Spectrum aggregation; Spectrum sensing; POMDP; COGNITIVE RADIO; DESIGN; MAC;
D O I
10.1186/s13638-015-0365-7
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Spectrum aggregation is an emerging technology to satisfy the data rate requirement of broadband services for next-generation wireless communication systems. In dynamic spectrum environment, in which the spectrum availability is time-varying, it is quite challenging to maintain the stability of spectrum aggregation. In this paper, we investigate the spectrum sensing and access schemes to minimize the times of channel switching for achieving stable dynamic spectrum aggregation, taking into consideration the hardware limitations of spectrum sensing and aggregation capability. We develop an analytical framework for the joint spectrum sensing and access problem based on partially observable Markov decision process (POMDP). Especially, we derive the reward function by estimation of the stability of different spectrum sensing and access strategies. Based on the POMDP framework, we propose a rollout-based suboptimal spectrum sensing and access scheme which approximates the value function of POMDP, and propose a differential training method to improve its robustness. It is proved that the rollout policy achieves performance improvement over the basis heuristics. The simulation results show that the proposed POMDP-based spectrum sensing and access scheme improves the system stability significantly and achieves near-optimal performance with a much lower complexity.
引用
收藏
页数:14
相关论文
共 24 条
  • [1] [Anonymous], OPER RES
  • [2] [Anonymous], 2010, NETW PROTOCOLS ALGOR
  • [3] Rollout Algorithms for Combinatorial Optimization
    Bertsekas D.P.
    Tsitsiklis J.N.
    Wu C.
    [J]. Journal of Heuristics, 1997, 3 (3) : 245 - 262
  • [4] Rollout algorithms for stochastic scheduling problems
    Bertsekas, DP
    Castañon, DA
    [J]. JOURNAL OF HEURISTICS, 1999, 5 (01) : 89 - 108
  • [5] Bertsekas DP, 1997, P ALL C COMM CONTR C
  • [6] Bertsekas DP, 1995, P IEEE CDC 1995
  • [7] Performance analysis,of the IEEE 802.11 distributed coordination function
    Bianchi, G
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (03) : 535 - 547
  • [8] Joint Design of Spectrum Sensing and Channel Access in Cognitive Radio Networks
    El-Sherif, Amr A.
    Liu, K. J. Ray
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (06) : 1743 - 1753
  • [9] Fan Wu, 2011, Proceedings of the 2011 IEEE 9th International Conference on Dependable, Autonomic and Secure Computing (DASC 2011), P196, DOI 10.1109/DASC.2011.54
  • [10] Gendenko B.V., 1954, Limit Distributions for Sums of Independent Random Variables