Routing in cognitive radio networks with full-duplex capability under dynamically varying spectrum availability

Abstract

This paper proposes a routing scheme for full-duplex-(FD)-based multi-hop CRNs that attempts to maximize the packet-delivery-ratio between any source–destination pair by being aware of the time-varying nature of spectrum-availability of the operating environment. The proposed routing scheme consists of path selection and channel assignment. Two design variants are presented: one for inband- and the other for outband-FD CRNs. Our scheme is performed into three phases: path-discovery (to identify a set of feasible routes), channel-selection (to assign channels along each path) and path-selection (to select the highest effective availability-time path). Compared to a reference scheme, the simulation results indicate that being spectrum-availability-aware can achieve significant performance enhancement.

Keywords

• Software-defined networking
• BLP
• Full-duplex
• Routing
• Multi-hop
• Sequential-fixing