東華大學圖書館 |

Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management./
Author:	Naderializadeh, Navid.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2016,
Description:	145 p.
Notes:	Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
Contained By:	Dissertations Abstracts International80-06B.
Subject:	Electrical engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10801350

Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management.
Naderializadeh, Navid.

Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management. - Ann Arbor : ProQuest Dissertations & Theses, 2016 - 145 p.

Source: Dissertations Abstracts International, Volume: 80-06, Section: B.

Thesis (Ph.D.)--University of Southern California, 2016.

This item must not be sold to any third party vendors.

We focus on the fundamental limits of two possible architectures in fifth-generation mobile networks (5G) that bring connectivity and contents closer to the users in the network. In particular, we study the problem of interference management in wireless device-to-device (D2D) communication systems and cache-aided wireless networks. For D2D networks, we first focus on the so-called "low-interference" regime; i.e., the regime where the level of interference in the network is so low that it can be safely "ignored". In particular, we present a general condition for the K-user fully-connected fully-asymmetric Gaussian interference channel, under which the simple scheme of treating interference as noise (TIN) is shown to be not only optimal for the entire GDoF region, but also within a constant gap of the entire capacity region. Based on this condition, we then propose a new spectrum sharing mechanism for D2D networks, named information-theoretic link scheduling (in short, ITLinQ), which identifies the subsets of users in the network that satisfy the TIN optimality condition and schedules the links in such subsets to transmit data at the same time. We characterize the guaranteed fraction of the capacity region that ITLinQ is able to achieve in a specific network setting. Furthermore, we introduce a distributed version of the ITLinQ scheme and show that it outperforms the state-of-the-art by more than a 100% in terms of sum-throughput, while keeping the complexity at the same level. For the case of cache-aided wireless networks, we consider a system comprising a library of files (e.g., movies) and a wireless network with an arbitrary number of transmitters and an arbitrary number of receivers, where each transmitter and each receiver is equipped with a local cache of certain size. Each receiver will ask for one of the files in the library, which needs to be delivered. In this setting, we characterize the one-shot sum degrees-of-freedom (sum-DoF) of the networks to within a factor of 2 for all system parameters. Our result shows that the one-shot sum-DoF scales linearly with the aggregate cache size in the network. We propose an achievable scheme that exploits the redundancy of the contents at transmitters' caches to cooperatively zero-force some outgoing interference and availability of the unintended content at receivers' caches to cancel (subtract) some of the incoming interference. We develop a particular pattern for cache placement that maximizes the overall gains of cache-aided transmit and receive interference cancellations. For the converse, we present an integer optimization problem which minimizes the number of communication blocks needed to deliver any set of requested files to the receivers. We then provide a lower bound on the value of this optimization problem, hence leading to an upper bound on the linear one-shot sum-DoF of the network, which is within a factor of 2 of the achievable sum-DoF. We finally extend the aforementioned result to the wireless cellular networks with caches at both base stations and receivers, in which each receiver is only able to receive signals from its three neighboring base stations due to the presence of path loss and fading. We characterize the degrees-of-freedom (DoF) per cell to within additive and multiplicative gaps of 2 for all system parameters, under one-shot linear schemes. Our result indicates that the one-shot linear DoF per cell scales linearly with the total amount of cache that is available in the cell. To establish the result, we propose a randomized cache placement for the receivers and a delivery scheme which utilizes the overlap of contents at the base station caches to zero-force part of their outgoing interference and also uses the cache contents of the receivers to create coded multicasting opportunities, so that the receivers are able to eliminate the remaining interference due to undesired packets. We also provide a converse argument which shows that the achievable one-shot linear DoF per cell of our scheme is within constant additive and multiplicative gaps of 2 of its optimum value.Subjects--Topical Terms:

649834
Electrical engineering.

Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management.
LDR:05218nmm a2200301 4500 001 2208668
005 20191028072731.5
008 201008s2016 ||||||||||||||||| ||eng d
035 $a (MiAaPQ)AAI10801350
035 $a (MiAaPQ)US_Calif_673567
035 $a AAI10801350
040 $a MiAaPQ $c MiAaPQ
100 1 $a Naderializadeh, Navid. $3 3435712
245 1 0 $a Fundamentals of Two User-Centric Architectures for 5G: Device-to-Device Communication and Cache-Aided Interference Management.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2016
300 $a 145 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Avestimehr, Amir Salman.
502 $a Thesis (Ph.D.)--University of Southern California, 2016.
506 $a This item must not be sold to any third party vendors.
520 $a We focus on the fundamental limits of two possible architectures in fifth-generation mobile networks (5G) that bring connectivity and contents closer to the users in the network. In particular, we study the problem of interference management in wireless device-to-device (D2D) communication systems and cache-aided wireless networks. For D2D networks, we first focus on the so-called "low-interference" regime; i.e., the regime where the level of interference in the network is so low that it can be safely "ignored". In particular, we present a general condition for the K-user fully-connected fully-asymmetric Gaussian interference channel, under which the simple scheme of treating interference as noise (TIN) is shown to be not only optimal for the entire GDoF region, but also within a constant gap of the entire capacity region. Based on this condition, we then propose a new spectrum sharing mechanism for D2D networks, named information-theoretic link scheduling (in short, ITLinQ), which identifies the subsets of users in the network that satisfy the TIN optimality condition and schedules the links in such subsets to transmit data at the same time. We characterize the guaranteed fraction of the capacity region that ITLinQ is able to achieve in a specific network setting. Furthermore, we introduce a distributed version of the ITLinQ scheme and show that it outperforms the state-of-the-art by more than a 100% in terms of sum-throughput, while keeping the complexity at the same level. For the case of cache-aided wireless networks, we consider a system comprising a library of files (e.g., movies) and a wireless network with an arbitrary number of transmitters and an arbitrary number of receivers, where each transmitter and each receiver is equipped with a local cache of certain size. Each receiver will ask for one of the files in the library, which needs to be delivered. In this setting, we characterize the one-shot sum degrees-of-freedom (sum-DoF) of the networks to within a factor of 2 for all system parameters. Our result shows that the one-shot sum-DoF scales linearly with the aggregate cache size in the network. We propose an achievable scheme that exploits the redundancy of the contents at transmitters' caches to cooperatively zero-force some outgoing interference and availability of the unintended content at receivers' caches to cancel (subtract) some of the incoming interference. We develop a particular pattern for cache placement that maximizes the overall gains of cache-aided transmit and receive interference cancellations. For the converse, we present an integer optimization problem which minimizes the number of communication blocks needed to deliver any set of requested files to the receivers. We then provide a lower bound on the value of this optimization problem, hence leading to an upper bound on the linear one-shot sum-DoF of the network, which is within a factor of 2 of the achievable sum-DoF. We finally extend the aforementioned result to the wireless cellular networks with caches at both base stations and receivers, in which each receiver is only able to receive signals from its three neighboring base stations due to the presence of path loss and fading. We characterize the degrees-of-freedom (DoF) per cell to within additive and multiplicative gaps of 2 for all system parameters, under one-shot linear schemes. Our result indicates that the one-shot linear DoF per cell scales linearly with the total amount of cache that is available in the cell. To establish the result, we propose a randomized cache placement for the receivers and a delivery scheme which utilizes the overlap of contents at the base station caches to zero-force part of their outgoing interference and also uses the cache contents of the receivers to create coded multicasting opportunities, so that the receivers are able to eliminate the remaining interference due to undesired packets. We also provide a converse argument which shows that the achievable one-shot linear DoF per cell of our scheme is within constant additive and multiplicative gaps of 2 of its optimum value.
590 $a School code: 0208.
650 4 $a Electrical engineering. $3 649834
690 $a 0544
710 2 $a University of Southern California. $3 700129
773 0 $t Dissertations Abstracts International $g 80-06B.
790 $a 0208
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10801350