OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks

Caleffi, Marcello; Akyildiz, Ian F.; Paura, Luigi

doi:10.1109/twc.2012.061912.111479

Cited by 57 publications

(53 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Before flow transmission, nodes (i.e., SUs) will first perform spectrum sensing to obtain the states of channels 12 .…”

Section: B Implementation Of the Gamementioning

confidence: 99%

“…Liu et al [35] considered both the benefits and prices of channel switching, where an optimal channel access scheme was developed to improve transmission opportunities and mitigate channel congestion. In the spatial domain, Caleffi et al [12] considered the diversity effects of spatial routes and proposed the criterion for an optimal routing metric in CRNs, and a connectivity-based routing scheme for the cognitive ad hoc networks was introduced in the work of Abbagnale et al [15]. However, these schemes only considered either the frequency or the spatial domain.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Liang

Wang

Tian

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In Cognitive Radio Networks (CRNs), Secondary Users (SUs) can flexibly access Primary Users' (PUs') idle spectrum bands but such spectrum opportunities are dynamic due to PUs' uncertain activity patterns. In a multi-hop CRN consisting of SUs as relays, such spectrum dynamics will further cause the invalidity of pre-determined routes. In this paper, we investigate spectrum-mobility-incurred route-switching problems in both spatial and frequency domains for CRNs, where spatial switching determines which relays and links should be re-selected and frequency switching decides which channels ought to be re-assigned to the spatial routes. The proposed route-switching scheme not only avoids conflicts with PUs but also mitigates spectrum congestion. Meanwhile, tradeoffs between routing costs and channel switching costs are achieved. We further formulate the route-switching problem as the Route-Switching Game which is shown to be a potential game and has a pure Nash Equilibrium (NE). Accordingly, efficient algorithms for finding the NE and the ϵ−NE are proposed. Then we extend the proposed game to the incomplete-information scenario and provide a method to compute the Bayesian NE. Finally, we prove that the price of stability of the proposed game has a deterministic upper bound.

show abstract

“…Before flow transmission, nodes (i.e., SUs) will first perform spectrum sensing to obtain the states of channels 12 .…”

Section: B Implementation Of the Gamementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Liang

Wang

Tian

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Two link availability prediction models for CRAHNs are proposed in [9] and [10]. In [9], a time period T p that the link between two CR nodes will stay available and its corresponding probability ( ) p L T is predicted.…”

Section: Introductionmentioning

confidence: 99%

Link Availability Prediction for Cognitive Radio Ad Hoc Networks

Hou¹,

Yeung²,

Wong³

2014

JCC

View full text Add to dashboard Cite

One critical issue for routing in cognitive radio ad hoc networks (CRAHNs) is how to select a reliable path for forwarding traffic. This is because mobility may cause radio links to break frequently. The reliability of a path depends on the availability of those links that constitutes the path. In this letter, we present a novel approach to predict the probability of the availability of the link between two cognitive radio nodes. The prediction is achieved by estimating the link activation and spectrum activation probabilities. Our prediction is verified by simulation and proved to be accurate. This study can provide reliability assurance on dynamic routing for cognitive radio ad hoc networks.

show abstract

“…The average lifetime of the mobile graphs in the stable sequence found by the ADTRP algorithm would serve as an upper bound (benchmark) for any communication topology that spans all the CUs found by any centralized or distributed algorithm. In [16], an optimal routing metric for cognitive radio ad-hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve optimality and accuracy.…”

mentioning

confidence: 99%