By Topic

Learning-Based Opportunistic Spectrum Access with Adaptive Hopping Transmission Strategy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Derakhshani, M. ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada ; Le-Ngoc, Tho

This paper presents an adaptive hopping transmission strategy for secondary users (SUs) to access temporarily idle frequency-slots of a licensed frequency band in consideration of the random return of primary users (PUs), aiming to maximize the overall SU throughput. A SU dynamically hops over multiple idle frequency-slots, each with an adaptive activity factor to avoid high-risk data loss due to possible PU return. SU activity factor optimization problems are formulated to develop the optimal opportunistic spectrum access (OSA) algorithms for SUs based on the Lagrange dual decomposition method. Subsequently, a fully distributed learning-based OSA algorithm is developed in which each SU independently adapts its activity factors to the optimal values over time by learning other SUs' behavior from locally available information. The convergence and convergence rate that characterize its asymptotic behavior and efficiency are analyzed. It is shown that the proposed learning-based OSA algorithm converges with probability of 1 to the optimal solution. Illustrative results confirm its effectiveness and performance gain as compared to existing OSA schemes.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 11 )