DOI: 10.1007/978-0-387-09490-8_16
|View full text |Cite
|
Sign up to set email alerts
|

Throughput and Delay Bounds for Cognitive Transmissions

Abstract: Cognitive networks are based on agile and opportunistic use of spectrum resources. This work focuses on those network scenarios where primary or licensed users coexist with secondary or unlicensed ones. Secondary users opportunistically access the shared resources whenever vacant, with the strict constraint of being invisible to primary users. We derive here analytical bounds on throughput and transmission delay of secondary users under different assumptions on secondary and primary users traffic statistics, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0
1

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 36 publications
(27 citation statements)
references
References 18 publications
0
26
0
1
Order By: Relevance
“…In [21], probabilistic methods have been used to evaluate the performance of PUs and SUs under different operation models. In [6,35,42], systems with SUs and PUs were modeled using priority queueing techniques. As mentioned above, we find the serverbreakdown model more appropriate for modeling such a system.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…In [21], probabilistic methods have been used to evaluate the performance of PUs and SUs under different operation models. In [6,35,42], systems with SUs and PUs were modeled using priority queueing techniques. As mentioned above, we find the serverbreakdown model more appropriate for modeling such a system.…”
Section: Related Workmentioning
confidence: 99%
“…For a strategy (p, q), let TA(p, q) denote the conditional delay experienced by an SU that arrives when the PU band is available and TO(p, q) be the conditional delay experienced by an SU that arrives when the PU band is occupied 6 . The corresponding delay costs are given by JA(p, q) = αTA(p, q), and JO(p, q) = αTO(p, q).…”
Section: Nash Equilibriummentioning
confidence: 99%
See 3 more Smart Citations