Linear programming, complexity theory and elementary functional analysis
Mathematical Programming: Series A and B
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Management Science
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Discovery of Spectrum Opportunities with MAC-Layer Sensing in Cognitive Radio Networks
IEEE Transactions on Mobile Computing
Local coordination based routing and spectrum assignment in multi-hop cognitive radio networks
Mobile Networks and Applications
Search: A routing protocol for mobile cognitive radio ad-hoc networks
Computer Communications
A geometric approach to improve spectrum efficiency for cognitive relay networks
IEEE Transactions on Wireless Communications
Routing in cognitive radio networks: Challenges and solutions
Ad Hoc Networks
Cooperative Spectrum Sensing in Cognitive Radio, Part I: Two User Networks
IEEE Transactions on Wireless Communications
Optimal spectrum sensing framework for cognitive radio networks
IEEE Transactions on Wireless Communications
COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS - Dynamic Spectrum Sharing: A Game Theoretical Overview
IEEE Communications Magazine
A survey on spectrum management in cognitive radio networks
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Cognitive radio networks (CRNs) are composed of frequency-agile radio devices that allow licensed (primary) and unlicensed (secondary) users to coexist, where secondary users opportunistically access channels without interfering with the operation of primary ones. From the perspective of secondary users, spectrum availability is a time-varying network resource over which multihop end-to-end connections must be maintained. In this paper, a theoretical outlook on the problem of routing secondary user flows in a CRN is provided. The investigation aims to characterize optimal sequences of routes over which a secondary flow is maintained. The optimality is defined according to a novel metric that considers the maintenance cost of a route as channels, and/or links must be switched due to the primary user activity. Different from the traditional notion of route stability, the proposed approach considers subsequent path selections, as well. The problem is formulated as an integer programming optimization model. Properties of the problem are also formally introduced and leveraged to design a heuristic algorithm when information on primary user activity is not complete. Numerical results are presented to assess the optimality gap of the heuristic routing algorithm in realistic CRN scenarios.