QoS-Aware Joint Policies in Cognitive Radio Networks

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

One of the most challenging problems in Opportunistic Spectrum Access (OSA) is to design channel sensing-based protocol in multi secondary users (SUs) network. Quality of Service (QoS) requirements for SUs have significant implications on this protocol design. In this paper, we propose a new method to find joint policies for SUs which not only guarantees QoS requirements but also maximizes network throughput. We use Decentralized Partially Observable Markov Decision Process (Dec-POMDP) to formulate interactions between SUs. Meanwhile, a tractable approach for Dec-POMDP is utilized to extract sub-optimum joint policies for large horizons. Among these policies, the joint policy which guarantees QoS requirements is selected as the joint sensing strategy for SUs. To show the efficiency of the proposed method, we consider two SUs trying to access two-channel primary users (PUs) network modeled by discrete Markov chains. Simulations demonstrate three interesting findings: 1- Optimum joint policies for large horizons can be obtained using the proposed method. 2- There exists a joint policy for the assumed QoS constraints. 3- Our method outperforms other related works in terms of network throughput.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

QoS-Aware Joint Policies in Cognitive Radio Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with QoS-Aware Joint Policies in Cognitive Radio Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and QoS-Aware Joint Policies in Cognitive Radio Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-286403

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.