2014
DOI: 10.1109/tpds.2013.75
|View full text |Cite
|
Sign up to set email alerts
|

Distributed and Asynchronous Data Collection in Cognitive Radio Networks with Fairness Consideration

Abstract: Abstract-As a promising communication paradigm, Cognitive Radio Networks (CRNs) have paved a road for Secondary Users (SUs) to opportunistically exploit unused licensed spectrum without causing unacceptable interference to Primary Users (PUs). In this paper, we study the distributed data collection problem for asynchronous CRNs, which has not been addressed before. We study the Proper Carrier-sensing Range (PCR) for SUs. By working with this PCR, an SU can successfully conduct data transmission without disturb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 46 publications
(13 citation statements)
references
References 54 publications
0
13
0
Order By: Relevance
“…Recently, studies in [15] have considered optimizing transmission schedules in sensory systems with dynamic traffic patterns. Sensory systems with a probabilistic network model have been investigated in [16] and [17]. Data collection processes in sensory systems with mobility have been studied in [18].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, studies in [15] have considered optimizing transmission schedules in sensory systems with dynamic traffic patterns. Sensory systems with a probabilistic network model have been investigated in [16] and [17]. Data collection processes in sensory systems with mobility have been studied in [18].…”
Section: Related Workmentioning
confidence: 99%
“…Although there exist numerous works on aggregation in traditional wireless networks (e.g., see [7] for a survey), we are only able to identify one paper [5] that explicitly targets aggregation in cognitive radio networks. However, the models and approaches employed by [5] are very different from the ones considered in this paper. Lastly, we note here that although rendezvous algorithms can potentially be used to solve data aggregation, COG-COMP is more efficient in many (if not all) cases.…”
Section: Data Aggregationmentioning
confidence: 99%
“…They require channel-related information from all the candidate relay nodes, which is inefficient when the number of candidate relays is large or the time for relay selection is limited [10]. For example, channel state information and SNR are required by the relay selection approaches proposed in [11,12], respectively.…”
Section: Related Workmentioning
confidence: 99%