2012 IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) 2012
DOI: 10.1109/camad.2012.6335376
|View full text |Cite
|
Sign up to set email alerts
|

Energy-efficient contention-aware channel selection in Cognitive Radio Ad-Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(18 citation statements)
references
References 10 publications
0
18
0
Order By: Relevance
“…Therefore, the algorithm should be robust enough to overcome situations of overestimation and/or underestimation of p C . To that end, in [12] it is shown that the correct construction of the list is slightly impacted by p C estimation inaccuracy, since it depends more significantly on the comparison between the estimated values and not on the estimated values themselves.…”
Section: Channel Selection Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore, the algorithm should be robust enough to overcome situations of overestimation and/or underestimation of p C . To that end, in [12] it is shown that the correct construction of the list is slightly impacted by p C estimation inaccuracy, since it depends more significantly on the comparison between the estimated values and not on the estimated values themselves.…”
Section: Channel Selection Algorithmmentioning
confidence: 99%
“…Preliminary simulation results were presented for the performance evaluation of the algorithm. In this paper, we substantially extend our work in [12] by providing the following contributions:…”
Section: Introductionmentioning
confidence: 98%
See 2 more Smart Citations
“…However, most papers in the literature deal with scenarios where a single SN is considered, thus totally overlooking any SN coexistence issues. To that end, in [5], we proposed a channel selection algorithm in a scenario where an SN coexists with other non-cooperating SNs and opportunistically use the same PU resources according to a specific coexistence scheme. In such coexistence scenarios, it is very important to achieve fairness among the coexisting SNs, which implies equal transmission opportunities among their SUs.…”
Section: Introductionmentioning
confidence: 99%