2011
DOI: 10.1109/jsac.2011.110404
|View full text |Cite
|
Sign up to set email alerts
|

Opportunistic Multiple Access for Cognitive Radio Networks

Abstract: Abstract-In this paper, opportunistic multiple access to the under-utilized channel resources is investigated. Exploiting source burstiness, secondary cognitive nodes utilizes primary nodes' periods of silence to access the channel and transmit their packets. Cognitive relays could also make use of these silence periods to offer spatial diversity without incurring bandwidth efficiency losses. First, we consider the cognitive cooperation protocol and propose two different relay assignment schemes. Comparison be… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
32
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(32 citation statements)
references
References 20 publications
0
32
0
Order By: Relevance
“…Later, the authors in [14] extended the POMDP framework with learning the unknown statistics of the primary signals. In [12][15] [16], the SUs were modeled as separate queuing systems and a multiple-access strategy with cooperative relays was proposed. Wu et al in [17] proposed a multi-winner spectrum auction game to suppress the SUs' collision behaviors during spectrum access, while Li et al in [18] presented a coalitional game theoretic approach for the SUs' spectrum access.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Later, the authors in [14] extended the POMDP framework with learning the unknown statistics of the primary signals. In [12][15] [16], the SUs were modeled as separate queuing systems and a multiple-access strategy with cooperative relays was proposed. Wu et al in [17] proposed a multi-winner spectrum auction game to suppress the SUs' collision behaviors during spectrum access, while Li et al in [18] presented a coalitional game theoretic approach for the SUs' spectrum access.…”
mentioning
confidence: 99%
“…13: end if 14: end for 15: • Update the probability of sensing and accessing, p s (t + 1) andp a (t + 1), using (79) and (80). 16: end for Based on (79)-(84), each SU can gradually learn the ESS. In Algorithm 1, we summarize the detailed procedures of the proposed distributed learning algorithm.…”
mentioning
confidence: 99%
“…After multi-channel sensing, SUs access primary channels for data transmission. Several spectrum access methods based on different mathematical models have been proposed, e.g., Markov decision process (MDP) based approaches [10]- [11], queuing theoretic approaches [12]- [14], and game theoretic approaches [15]- [17]. Moreover, the joint spectrum sensing and channel access problems were studied in [18]- [20].…”
Section: Introductionmentioning
confidence: 99%
“…The authors of [5] then extended this research to a CR system supporting multiple PUs and a single SU in order to find the optimal transmit power and to characterize the relaying probability of the SU. The stability region of a CR network supporting multiple PUs, multiple relays and multiple SUs has been analysed in [6]. The authors of [4] to [6] employed the interweave paradigm, where the SUs have fewer opportunities to access the resources.…”
Section: Introductionmentioning
confidence: 99%
“…The stability region of a CR network supporting multiple PUs, multiple relays and multiple SUs has been analysed in [6]. The authors of [4] to [6] employed the interweave paradigm, where the SUs have fewer opportunities to access the resources. All these studies assumed that only a single queue was set up for each of the users, which fails to realistically represent the characteristics of multimedia video communication, and the results were conceived under the assumption of queuing stability, where the specific QoS constraints such as the delay tolerance were completely ignored.…”
Section: Introductionmentioning
confidence: 99%