Quantifying the Impact of Time-Sharing on Route Capacity in Cognitive Radio Networks With Full-Duplex Capability

Abstract

Recent advances in full-duplex (FD) communications along with the introduction of the concept of device-to-device communications have challenged the applicability of traditional routing and scheduling schemes in multi-hop cognitive radio networks (CRNs). In this letter, we derived a close-form expression to quantify the impact of time-sharing of a given channel assignment along a given path on network performance. Based on the derived expression, we mathematically model the channel-assignment problem that minimizes the number of time-shared hops along a given path as a binary-quadratic optimization problem (BQP). Then, we transfer the BQP into a binary linear programming problem (BLP), which is sub-optimally solvable using a polynomial-time sequential fixing method. Simulation results indicate that routing with assignment that minimizes the needed number of time-shared transmissions along a path can provide significant improvement in network throughput.