Optimal Throughput Performance in Full-Duplex Relay Assisted Cognitive Networks

Author's Department

Computer Science & Engineering Department

Find in your Library

http://www.worldcat.org/oclc/1187255963

All Authors

M Emre Ozfatura; Sherif ElAzzouni; Ozgur Ercetin; Tamer ElBatt

Document Type

Research Article

Publication Title

Springer Wireless Networks

Publication Date

4-1-2019

doi

10.1007/s11276-018-1692-5

Abstract

In this paper, we study a full-duplex cooperative cognitive radio network with multiple full-duplex secondary users acting as potential relays for transmitting the packets of a primary user. In addition to having full-duplex capability, the receivers also have multi-packet reception capability allowing them to simultaneously decode packets incoming from different senders. Our objective is to maximize the sum throughput of the secondary users while stabilizing the primary and relay queues. Towards this objective, we characterize the optimal scheduling of primary and relay packets at the full-duplex secondary users. The resulting problem is non-convex, and thus, we transform it into a linear fractional problem by using the dominant system approach. This, in turn, facilitates an efficient numerical solution by the bisection method. We analyze the effects of different network parameters on the optimal solution numerically for a number of possible scenarios. Our numerical results demonstrate how the multi-packet reception and full-duplex capabilities, as well as the partial relaying and number of secondary users affect the primary and secondary users’ stable throughput revealing new insights into the performance of overlay cognitive networks. In particular, we demonstrate that full-duplex capability of secondary users together with multi-packet reception capability of the primary destination is the key in reaping the benefits of full-duplex cooperative cognitive communications.

First Page

1931

Last Page

1947

This document is currently not available here.

Find this item online

Share

COinS