Maximizing Cognitive Radio Networks Throughput Using Limited Historical Behavior of Primary Users

• Published in: IEEE access 2018-01, Vol.6, p.12252-12259
• Main Authors: Gottapu, Srinivasa Kiran, Kapileswar, Nellore, Santhi, Palepu Vijaya, Chenchela, Vijay K. R.
• Format: Article
• Language: English
• Subjects: Behavior learning; Browsing; Cognitive radio; cognitive radios; Data communication; Decision making; Delays; Greedy algorithms; Maximization; miss detection; ogtm; Optimization; Payloads; primary users; Radio spectra; secondary users; Sensors; Spectrum allocation; Throughput; throughput limitation
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2018.2812743

Cognitive radios (CRs) mainly aim to reuse the spectrum holes in order to efficiently utilize the available scarce radio spectrum. However, current CRs techniques have a throughput limitation problem which ultimately limits telecommunication applications horizons nowadays. Moreover, achieving high throughput will overcome the bottleneck of CRs application limitations to the reporting and browsing applications only. To tackle this emerging throughput limitation issue in the CRs, this paper proposes the online greedy throughput maximization (OGTM) algorithm which overcomes the throughput limitations. OGTM allows the sensing cycle frame to have a variable length according to the assumed decision validity interval. Then, OGTM varies the decision validity interval of secondary users (SUs) based on the primary users (PUs) historical behavior. As a proof of concept, we developed a simulator in order to evaluate the performance of the proposed OGTM technique. The simulation results show that SUs benefit from the limited PU historical behavior learning, which resultantly increases the throughput up to 95% and at the same time decreases the miss detection probability by 50%.