Academic Journals Database
Disseminating quality controlled scientific knowledge

Optimal Sensing for Opportunistic Spectrum Access in Cognitive Radio

Author(s): Nasrullah Armi, Naufal M. Saad, M. Zuki Yusoff, Muhammad Arshad

Journal: International Journal of Engineering
ISSN 1985-2312

Volume: 4;
Issue: 3;
Start page: 243;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Dynamic Spectrum Access | Opportunistic Spectrum Access | POMDP | Greedy Algorithm | Cognitive Radio

One of the most difficult thing but important problem when designing an OSA (Opportunistic Spectrum Access) MAC protocol is how the unlicensed users decide when and which channel they should sense and access without conflicting the communications among PUs. To solve this problem, the unlicensed users should have the ability of adaptively and dynamically seeking and exploiting opportunities in both licensed and unlicensed spectrum and along both of the time and the frequency dimensions. Secondary Users (SUs) as unlicensed users are required to sense radio frequency band, and when PU are detected, they must vacate the channel immediately within certain amount of time. Due to hardware and energy constraints, full spectrum availability cannot be sensed as well as they do not monitor when there is no data to be transmitted. In this paper, we study MAC protocol design and optimal sensing for OSA in Cognitive Radio (CR) ad hoc network under Partially Observable Markov Decision Process (POMDP) algorithm that maximizes achievable throughput for SUs with sufficient protection to PUs. The bandwith effect to number of bit transmitted in one slot and tractable greedy algorithm to reduce the complexity of POMDP calculation was studied as well. The derivation of greedy approach proves that sensing problem can be solved either optimally or approximate the optimal solution. Computer simulation is used to evaluate the performances both of optimal and sub optimal strategy.
Why do you need a reservation system?      Affiliate Program