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

Channel Assignment With Access Contention Resolution for Cognitive Radio Networks

Abstract: In this paper, we consider the channel allocation problem for throughput maximization in cognitive radio networks with hardware-constrained secondary users. Specifically, we assume that secondary users (SUs) exploit spectrum holes on a set of channels where each SU can use at most one available channel for communication. We present the optimal brute-force search algorithm and its complexity for this non-linear integer optimization problem. Since the optimal solution has exponential complexity with the numbers … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
55
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(55 citation statements)
references
References 35 publications
0
55
0
Order By: Relevance
“…The channel sets come in two types: orthogonal channels and overlapping channels [116]. The orthogonal channels do not interfere with one another, even if they are simultaneously active in the same coverage area; whereas, overlapping channels interfere with one another, if they are being simultaneously used in the same coverage area.…”
Section: H Channel Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The channel sets come in two types: orthogonal channels and overlapping channels [116]. The orthogonal channels do not interfere with one another, even if they are simultaneously active in the same coverage area; whereas, overlapping channels interfere with one another, if they are being simultaneously used in the same coverage area.…”
Section: H Channel Modelmentioning
confidence: 99%
“…(b) Access contention resolution: Overlapping and non-overlapping channel assignment algorithms are employed in [116] to maximize the throughput within the CRAHN. In the non-overlapping channel assignment algorithm, a distinct set of channels is assigned to the SUs.…”
Section: ) Crahnmentioning
confidence: 99%
“…Since Urban-X uses simultaneous transmission of two data transceivers in different channels, it is costly for cognitive radio sensor networks. Tan and Le [2] have investigated the channel assignment problem for cognitive radio networks with hardware-constrained SUs, and presented the optimal bruteforce search algorithm to solve the corresponding problem. Wang et al [3] have proposed a heuristic centralized scheme to assign channels among secondary users.…”
Section: Dynamic Channel Assignmentmentioning
confidence: 99%
“…Shi et al [6] have studied the problem of periodic sensor scheduling with limited sensor energy and communication bandwidth. However, [2]- [4] do not consider multihop communication between sensor nodes.…”
Section: Dynamic Channel Assignmentmentioning
confidence: 99%
See 1 more Smart Citation