Cognitive radio access optimization using multiparameter match ability estimation

Authors:
Kunqi Guo;Lixin Sun;Xiaoqun Zhao;Shilou Jia
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Jiangsu, China and Communication Research Center, Harbin Institute of Technology, Harbin, China;School of Computer Science and Telecommunication Engineering, Jiangsu University, Jiangsu, China;School of Communication Engineering, Tongji University, Shanghai, China;Communication Research Center, Harbin Institute of Technology, Harbin, China
Venue:
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
Year:
2011

Citing 8
Cited 0

Data structures and program design in C++

Data structures and program design in C++
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Queuing analysis in multichannel cognitive spectrum access: a large deviation approach

INFOCOM'10 Proceedings of the 29th conference on Information communications
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework

IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors

IEEE Transactions on Information Theory
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework

IEEE Journal on Selected Areas in Communications
Cognitive Medium Access: Constraining Interference Based on Experimental Models

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate the optimal channel access of secondary user system in cognitive radio networks as the total reward maximization by Partially Observable Markov Decision Processes (POMDPs). Match Ability is proposed that takes allowable channel transmission rate and bit-error-rate (BER) required by receiving end into account. A heuristic greedy algorithm for channel access is proposed that is based on the local maximum match ability. By combining the utility function of queuing delay with local match ability, we improve the global average delay fairness. It is demonstrated by simulation results that as the average arrival rate increases, the large stable region of low delay can be maintained by adjusting utility function of the average waiting time under the condition that all the control information time overhead is not considered in the centralized global fairness control.