<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06088158</id>
  <dt>a</dt>
  <an>06088158</an>
  <augroup>
    <au>Guo, Kunqi</au>
    <au>Sun, Lixin</au>
    <au>Lee, Yong</au>
    <au>Jia, Shilou</au>
  </augroup>
  <ti>Cognitive radio access based on multiparameter matching ability estimation.</ti>
  <so>Zhou, Qihai (ed.), Theoretical and mathematical foundations of computer science. Second international conference, ICTMF 2011, Singapore, May 5--6, 2011. Selected papers. Berlin: Springer (ISBN 978-3-642-24998-3/pbk; 978-3-642-24999-0/ebook). Communications in Computer and Information Science 164, 405-412 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>cognitive radio</ut>
    <ut>match ability</ut>
    <ut>utility function</ut>
    <ut>average waiting time</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-24999-0_56</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper, we focus on the channel usage efficiency for secondary user in cognitive radio networks. We formulate the optimization objective as the total reward maximization by Partially Observable Markov Decision Processes (POMDPs). The total reward is maximized by considering multidimensional context parameters including allowable channel transmission rate, queue delay and arrival rate. Match Ability is proposed considering above context parameters. A heuristic greedy algorithm is proposed for each secondary user to access sensed channels based on the local maximum match ability. By combining the utility function of average waiting time with match ability, we improve the global scheduling delay fairness. We demonstrate by simulation results that as the average arrival rate of secondary user increases, the large stable region of low delay can be efficiently maintained by varying utility function of the average waiting time.</ab>
    <rv></rv>
  </abgroup>
</item>