2012
DOI: 10.1109/tmc.2011.168
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Fair Bandwidth Allocation in Multichannel Cognitive Radio Networks

Abstract: Abstract-Cognitive radio (CR) improves spectrum efficiency by allowing secondary users (SUs) to dynamically exploit the idle spectrum owned by primary users (PUs). This paper studies optimal bandwidth allocation of SUs for throughput efficiency. Consider the following tradeoff: an SU increases its instantaneous throughput by accessing more spectrum, but channel access/switching overhead, contention among multiple SUs, and dynamic PU activity create higher liability for larger bandwidths. So how much is too muc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(20 citation statements)
references
References 34 publications
0
20
0
Order By: Relevance
“…Price-based resource allocation in two-tier femtocell networks using a price bargaining algorithm has been presented in [17] where interference from SUs (femtocell users) is considered as a price to reduce the SUs' payoffs. Optimal bandwidth allocation using channel reconfiguration for SUs to maximize the per-SU throughput has been studied in [18].…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Price-based resource allocation in two-tier femtocell networks using a price bargaining algorithm has been presented in [17] where interference from SUs (femtocell users) is considered as a price to reduce the SUs' payoffs. Optimal bandwidth allocation using channel reconfiguration for SUs to maximize the per-SU throughput has been studied in [18].…”
Section: A Related Workmentioning
confidence: 99%
“…Proof: Revenue optimization can be solved by Lagrangian operation by expressing (18) with (19) and (20) as…”
Section: Definition 2 (Best Response For the Sppsg)mentioning
confidence: 99%
“…The user allocations are recomputed dynamically each time activities of PUs change the status of the spectrum. In [12], the channel reconfiguration algorithm based on the knapsack problem is introduced to optimize the number of SUs added in each time slot. The assigned time slot for SUs can be rearranged when the status of the spectrum is changed regarding the PUs activities, and thus the global utilization can be maximized.…”
Section: Related Workmentioning
confidence: 99%
“…The user allocations are recomputed dynamically each time activities of PUs change the status of the spectrum. Similar to [11], [12], the channel reconfiguration algorithm based on the knapsack problem is introduced to optimize the number of SUs added in each time slot. The assigned time slot for SUs can be rearranged when the status of the spectrum is changed regarding the PU activities, and thus the global utilization can be maximized.…”
Section: Introductionmentioning
confidence: 99%