Routing With Intelligent Spectrum Assignment in Full-Duplex Cognitive Networks Under Varying Channel Conditions

Recent developments of self-interference suppression techniques have enabled practical implementations of full-duplex (FD) cognitive-radio (CR) communication systems. Such systems can significantly enhance spectrum utilization by allowing a CR user to simultaneously transmit and receive over the sam...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 24; no. 4; pp. 872 - 876
Main Authors: Bany Salameh, Haythem, Qawasmeh, Reema, Al-Ajlouni, Ahmad F.
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
binary linear programming (BLP)
Channel allocation
Channel assignment
Communications systems
Computer simulation
fifth generation (5G)
in-band full-duplex (IB-FD)
Interference
Linear programming
out-of-band full-duplex (OB-FD)
Polynomials
Protocol
Protocol (computers)
Route selection
Routing
Routing protocols
Signal to noise ratio
Throughput
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recent developments of self-interference suppression techniques have enabled practical implementations of full-duplex (FD) cognitive-radio (CR) communication systems. Such systems can significantly enhance spectrum utilization by allowing a CR user to simultaneously transmit and receive over the same frequency channel. However, the CR FD-capabilities challenge the effectiveness of existing CR-based routing protocols as joint FD-aware channel-assignment and routing are essential to enhance network performance. In this letter, we propose a joint FD-aware channel-assignment and route selection protocol in FD-based CR networks (CRNs) under time-varying channel conditions and transmission rates. Specifically, for a given set of paths between a CR source-destination pair, our protocol computes the channel-assignment over each path that maximizes the end-to-end network throughput subject to interference constraints. This assignment problem is shown to be an NP-hard binary linear programming (BLP) that can be sub-optimally solved in polynomial-time using the sequential-fixing procedure. Then, our protocol determines the path with the highest end-to-end network throughput. Simulation results reveal that our proposed routing protocol significantly improves the end-to-end throughput compared to previous FD-aware routing protocols.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2020.2968445