Delay-Constrained Caching in Cognitive Radio Networks

Jing Zhao, Wei Gao, Yi Wang, Guohong Cao

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

In cognitive radio networks, unlicensed users can use under-utilized licensed spectrum to achieve substantial performance improvement. To avoid interference with licensed users, unlicensed users must vacate the spectrum when it is accessed by licensed (primary) users. Since it takes some time for unlicensed users to switch to other available channels, the ongoing data transmissions may have to be interrupted and the transmission delay can be significantly increased. This makes it hard for cognitive radio networks to meet the delay constraints of many applications. In this paper, we develop caching techniques to address this problem. We formulate the cache placement problem in cognitive radio networks as an optimization problem, where the goal is to minimize the total cost, subject to some delay constraint, i.e., the data access delay can be statistically bounded. To solve this problem, we propose a cost-based approach to minimize the caching cost, and design a delay-based approach to satisfy the delay constraint. Then, we combine them and propose a distributed hybrid approach to minimize the caching cost subject to the delay constraint. Simulation results show that our approaches outperform existing caching solutions in terms of total cost and delay constraint, and the hybrid approach performs the best among the approaches satisfying the delay constraint.

Original languageEnglish (US)
Article number7095610
Pages (from-to)627-640
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume15
Issue number3
DOIs
StatePublished - Mar 1 2016

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Delay-Constrained Caching in Cognitive Radio Networks'. Together they form a unique fingerprint.

  • Cite this