Article

A POMDP Based Distributed Adaptive Opportunistic Spectrum Access Strategy for Cognitive Ad Hoc Networks

IEICE Transactions on Communications (Impact Factor: 0.33). 06/2011; 94-B(6):1621-1624. DOI: 10.1587/transcom.E94.B.1621
Source: DBLP

ABSTRACT In this letter, we propose a Partially Observable Markov Decision Process (POMDP) based Distributed Adaptive Opportunistic Spectrum Access (DA-OSA) Strategy for Cognitive Ad Hoc Networks (CAHNs). In each slot, the source and destination choose a set of channels to sense and then decide the transmission channels based on the sensing results. In order to maximize the throughput for each link, we use the theories of sequential decision and optimal stopping to determine the optimal sensing channel set. Moreover, we also establish the myopic policy and exploit the monotonicity of the reward function that we use, which can be used to reduce the complexity of the sequential decision.

2 Followers
 · 
168 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies a multiuser optimal stopping strategy for Opportunistic Spectrum Access (OSA). Since all secondary users (SUs) share the same spectrum information and use the same OSA strategy to seize available spectrum resources, collisions will happen inevitably. We formulate this problem as an optimal stopping problem and propose an effective approach named “Spectrum Partition” to avoid such collisions. Spectrum is partitioned completely into several channel sets, the amount of which equals to that of SUs. Thus, the problem can be simplified into multiple single-user cases. In each slot, each SU acquires channel sensing order in descending the idle probabilities of channels based on the updated belief vectors and utilizes optimal stopping rule to determine which channel to access in consideration of channel states and exploration overhead. Simulation results are provided to show the effectiveness of the proposed strategy.
    Wireless Communications & Signal Processing (WCSP), 2013 International Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a multiuser optimal stopping strategy for Opportunistic Spectrum Access (OSA) is proposed. In practical cognitive radio networks (CRNs), secondary users (SUs) usually have their own priorities of spectrum occupation, that is, SU with higher priority has a better chance to access idle channels in the spectrum. Since all SUs share the same spectrum information, throughput of the SUs with low priorities will be quite low even null if idle channels are always allocated to the SUs with high priorities. In another aspect, even if the SUs with low priorities also have chance to access idle channels, collisions will happen because of the competition among SUs. In order to increase system throughput of all SUs and avoid such collisions, we formulate this problem as an optimal stopping problem and propose an effective priority scheme with spectrum partition. In view of users' priorities, spectrum is partitioned completely into several channel sets, the amount of which equals to that of SUs. Thus, the problem can be simplified into multiple single-user cases. In each slot, each SU utilizes optimal stopping rule to determine which channel to access in consideration of channel states and exploration overhead. Simulation results show the effectiveness of the proposed strategy.
    2013 IEEE 4th International Conference on Electronics Information and Emergency Communication (ICEIEC); 11/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: In cognitive radio networks (CRNs), considering the randomness of primary users' (PUs) arrival and the nonideality of spectrum sensing performed by secondary users (SUs), the collisions between PUs and SUs are unavoidable. Frequent occurrences of collisions will strongly degrade PUs' and SUs' QoS. Therefore, collision statistics, such as the average number of collisions, is a very important performance metric in CRNs. If collision statistics are not considered in the scheduling scheme of the CRNs, some SUs will meet more collisions than the others, which cause unfair experiences among the SUs. Therefore, a fair scheduling scheme based on collision statistics is proposed in this paper, which can improve fairness across all SUs. First, the number of collisions is defined as an important fairness metric for each SU, and the scheduler dynamically adjusts the priorities of the SUs by periodically counting each SU's collision number. Then, a prediction algorithm, based on the continuous-time Markov chain model, is proposed to predict the idle probabilities of the available channels in the next slot. Considering both the priorities of the SUs and the idle probabilities of the available channels, a rational scheduling scheme will be achieved finally. Assuming the ordered hunt scheduling scheme applied by the primary system, the simulation results show that the proposed scheme can significantly improve the fairness across all SUs with little impact on spectrum utilization. Copyright © 2012 John Wiley & Sons, Ltd.
    Concurrency and Computation Practice and Experience 06/2013; 25(9). DOI:10.1002/cpe.2879 · 0.78 Impact Factor