eprintid: 3250
rev_number: 7
eprint_status: archive
userid: 328
dir: disk0/00/00/32/50
datestamp: 2018-12-13 07:49:45
lastmod: 2018-12-19 05:08:47
status_changed: 2018-12-13 07:49:45
type: article
metadata_visibility: show
creators_name: Vu, Xuan Thang
creators_name: Trinh, Anh Vu
creators_name: Chatzinotas, Symeon
creators_name: Ottersten, Björn
creators_id: thang.vu85@gmail.com
creators_id: vuta@vnu.edu.vn
creators_id: Chatzinotas@gmail.com
creators_id: Ottersten@gmail.com
title: Cache-aided Full Duplex: Delivery Time Analysis
and Optimization
ispublished: submitted
subjects: Communications
subjects: ECE
divisions: fac_fet
abstract: Edge caching has received much attention as a
promising technique to overcome the stringent latency and data
hungry challenges in the future generation wireless networks.
Meanwhile, full duplex (FD) transmission can potentially double
the spectral efficiency by allowing a node to receive and transmit
simultaneously. In this paper, we investigate the delivery time
performance of a cache-aided FD system, in which an edge
node, operates in FD mode, serves users via wireless channels
and is equipped with a cache memory. Firstly, we derive a
closed-form expression for the average delivery time by taking
into account the uncertainties of both backhaul and access
wireless channels. The derived analysis allows the examination
of the impact of key parameters, e.g., cache size and transmit
power. Secondly, a power optimization problem is formulated
to minimize the average delivery time. To deal with the nonconvexity
of the formulated problem, we propose an iterative
optimization algorithm by using the bisection method. Finally,
numerical results are presented to demonstrate the effectiveness
of the proposed algorithm.
date: 2018
date_type: submitted
publisher: IEEE
full_text_status: none
publication: IEEE Wireless Communication Letters
refereed: FALSE
issn: ‎2162-2337
citation:   Vu, Xuan Thang and Trinh, Anh Vu and Chatzinotas, Symeon and Ottersten, Björn  (2018) Cache-aided Full Duplex: Delivery Time Analysis and Optimization.  IEEE Wireless Communication Letters .    ISSN ‎2162-2337    (Submitted)