Mobile edge computing (MEC) can dramatically promote the compu- tation capability and prolong the lifetime of mobile users by offloading computation- intensive tasks to edge cloud. In this thesis, a spatial-random two-tier heterogeneous network (HetNet) is modelled to feature random node distribution, where the small- cell base stations (SBSs) and the macro base stations (MBSs) are cascaded with resource-limited servers and resource-unlimited servers, respectively. Only a certain type of application services and finite number of offloaded tasks can be cached and processed in the resource-limited edge server. For that setup, we investigate the per- formance of two offloading strategies corresponding to integrated access and backhaul (IAB)-enabled MEC networks and traditional cellular MEC networks. By using tools from stochastic geometry and queuing theory, we derive the average delay for the two different strategies, in order to better understand the influence of IAB on MEC networks. Simulations results are provided to verify the derived expressions and to reveal various system-level insights.

The mathematical modeling and performance analysis of cellular networks have seen a major paradigm shift with the application of stochastic geometry. The main purpose of stochastic geometry is to endow probability distributions on the locations of the base stations (BSs) and users in a network, which, in turn, provides an analytical handle on the performance evaluation of cellular networks. To preserve the tractability of analysis, the common practice is to assume complete spatial randomness} of the network topology. In other words, the locations of users and BSs are modeled as independent homogeneous Poisson point processes (PPPs). Despite its usefulness, the PPP-based network models fail to capture any spatial coupling between the users and BSs which is dominant in a multi-tier cellular network (also known as the heterogeneous cellular networks (HetNets)) consisting of macro and small cells. For instance, the users tend to form hotspots or clusters at certain locations and the small cell BSs (SBSs) are deployed at higher densities at these locations of the hotspots in order to cater to the high data demand. Such user-centric deployments naturally couple the locations of the users and SBSs. On the other hand, these spatial couplings are at the heart of the spatial models used in industry for the system-level simulations and standardization purposes. This dissertation proposes fundamentally new spatial models based on stochastic geometry which closely emulate these spatial couplings and are conductive for a more realistic and fine-tuned performance analysis, optimization, and design of cellular networks. First, this dissertation proposes a new class of spatial models for HetNets where the locations of the BSs and users are assumed to be distributed as Poisson cluster process (PCP). From the modeling perspective, the proposed models can capture different spatial couplings in a network topology such as the user hotspots and user BS coupling occurring due to the user-centric deployment of the SBSs. The PCP-based model is a generalization of the state-of-the-art PPP-based HetNet model. This is because the model reduces to the PPP-based model once all spatial couplings in the network are ignored. From the stochastic geometry perspective, we have made contributions in deriving the fundamental distribution properties of PCP, such as the distance distributions and sum-product functionals, which are instrumental for the performance characterization of the HetNets, such as coverage and rate. The focus on more refined spatial models for small cells and users brings to the second direction of the dissertation, which is modeling and analysis of HetNets with millimeter wave (mm-wave) integrated access and backhaul (IAB), an emerging design concept of the fifth generation (5G) cellular networks. While the concepts of network densification with small cells have emerged in the fourth generation (4G) era, the small cells can be realistically deployed with IAB since it solves the problem of high capacity wired backhaul of SBSs by replacing the last-mile fibers with mm-wave links. We have proposed new stochastic geometry-based models for the performance analysis of IAB-enabled HetNets. Our analysis reveals some interesting system-design insights: (1) the IAB HetNets can support a maximum number of users beyond which the data rate drops below the rate of a single-tier macro-only network, and (2) there exists a saturation point of SBS density beyond which no rate gain is observed with the addition of more SBSs. The third and final direction of this dissertation is the combination of machine learning and stochastic geometry to construct a new class of data driven network models which can be used in the performance optimization and design of a network. As a concrete example, we investigate the classical problem of wireless link scheduling where the objective is to choose an optimal subset of simultaneously active transmitters (Tx-s) from a ground set of Tx-s which will maximize the network-wide sum-rate. Since the optimization problem is NP-hard, we replace the computationally expensive heuristic by inferring the point patterns of the active Tx-s in the optimal subset after training a determinantal point process (DPP). Our investigations demonstrate that the DPP is able to learn the spatial interactions of the Tx-s in the optimal subset and gives a reasonably accurate estimate of the optimal subset for any new ground set of Tx-s. / Doctor of Philosophy / The high speed global cellular communication network is one of the most important technologies, and it continues to evolve rapidly with every new generation. This evolution greatly depends on observing performance-trends of the emerging technologies on the network models through extensive system-level simulations. Since these simulation models are extremely time-consuming and error prone, the complementary analytical models of cellular networks have been an area of active research for a long time. These analytical models are intended to provide crisp insights on the network behavior such as the dependence of network performance metrics (such as coverage or rate) on key system-level parameters (such as transmission powers, base station (BS) density) which serve as the prior knowledge for more fine-tuned simulations. Over the last decade, the analytical modeling of the cellular networks has been driven by stochastic geometry. The main purpose of stochastic geometry is to endow the locations of the base stations (BSs) and users with probability distributions and then leverage the properties of these distributions to average out the spatial randomness. This process of spatial averaging allows us to derive the analytical expressions of the system-level performance metrics despite the presence of a large number of random variables (such as BS and user locations, channel gains) under some reasonable assumptions. The simplest stochastic geometry based model of cellular networks, which is also the most tractable, is the so-called Poisson point process (PPP) based network model. In this model, users and BSs are assumed to be distributed as independent homogeneous PPPs. This is equivalent to saying that the users and BSs independently and uniformly at random over a plane. The PPP-based model turned out to be a reasonably accurate representation of the yesteryear’s cellular networks which consisted of a single tier of macro BSs (MBSs) intended to provide a uniform coverage blanket over the region. However, as the data-hungry devices like smart-phones, tablets, and application like online gaming continue to flood the consumer market, the network configuration is rapidly deviating from this baseline setup with different spatial interactions between BSs and users (also termed spatial coupling) becoming dominant. For instance, the user locations are far from being homogeneous as they are concentrated in specific areas like residential and commercial zones (also known as hotspots). Further, the network, previously consisting of a single tier of macro BSs (MBSs), is becoming increasingly heterogeneous with the deployment of small cell BSs (SBSs) with small coverage footprints and targeted to serve the user hotspots. It is not difficult to see that the network topology with these spatial couplings is quite far from complete spatial randomness which is the basis of the PPP-based models. The key contribution of this dissertation is to enrich the stochastic geometry-based mathematical models so that they can capture the fine-grained spatial couplings between the BSs and users. More specifically, this dissertation contributes in the following three research directions. Direction-I: Modeling Spatial Clustering. We model the locations of users and SBSs forming hotspots as Poisson cluster processes (PCPs). A PCP is a collection of offspring points which are located around the parent points which belong to a PPP. The coupling between the locations of users and SBSs (due to their user-centric deployment) can be introduced by assuming that the user and SBS PCPs share the same parent PPP. The key contribution in this direction is the construction of a general HetNet model with a mixture of PPP and PCP-distributed BSs and user distributions. Note that the baseline PPP-based HetNet model appears as one of the many configurations supported by this general model. For this general model, we derive the analytical expressions of the performance metrics like coverage probability, BS load, and rate as functions of the coupling parameters (e.g. BS and user cluster size). Direction-II: Modeling Coupling in Wireless Backhaul Networks. While the deployment of SBSs clearly enhances the network performance in terms of coverage, one might wonder: how long network densification with tens of thousands of SBSs can meet the everincreasing data demand? It turns out that in the current network setting, where the backhaul links (i.e. the links between the BSs and core network) are still wired, it is not feasible to densify the network beyond some limit. This backhaul bottleneck can be overcome if the backhaul links also become wireless and the backhaul and access links (link between user and BS) are jointly managed by an integrated access and backhaul (IAB) network. In this direction, we develop the analytical models of IAB-enabled HetNets where the key challenge is to tackle new types of couplings which exist between the rates on the wireless access and backhaul links. Such couplings exist due to the spatial correlation of the signal qualities of the two links and the number of users served by different BSs. Two fundamental insights obtained from this work are as follows: (1) the IAB HetNets can support a maximum number of users beyond which the network performance drops below that of a single-tier macro-only network, and (2) there exists a saturation point of SBS density beyond which no performance gain is observed with the addition of more SBSs. Direction-III: Modeling Repulsion. In this direction, we focus on modeling another aspect of spatial coupling imposed by the intra-point repulsion. Consider a device-to-device (D2D) communication scenario, where some users are transmitting some on-demand content locally cached in their devices using a common channel. Any reasonable multiple access scheme will ensure that two nearly users are never simultaneously active as they will cause severe mutual interference and thereby reducing the network-wide sum rate. Thus the active users in the network will have some spatial repulsion. The locations of these users can be modeled as determinantal point processes (DPPs). The key property of DPP is that it forms a bridge between stochastic geometry and machine learning, two otherwise non-overlapping paradigms for wireless network modeling and design. The main focus in this direction is to explore the learning framework of DPP and bring together advantages of stochastic geometry and machine learning to construct a new class of data-driven analytical network models.

Abstract With the unprecedented growth in mobile data traffic and network densification, the emerging fifth-generation (5G) wireless network warrants a paradigm shift with respect to system design and technological enablers. In this regard, the prime motivation of this thesis is to propose an integrated access-backhaul (IAB) framework to dynamically schedule users, while efficiently providing a wireless backhaul to dense small cells and mitigating interference. In addition, joint resource allocation and interference mitigation solutions are proposed for two-hop and multi-hop self-backhauled millimeter wave (mmWave) networks. The first contribution of this thesis focuses on a multi-user two-hop relay cellular system in which a massive antenna array enabled macro base station (BS) simultaneously provides high beamforming gains to outdoor users, and wireless backhauling to outdoor small cells. Moreover, a hierarchical interference mitigation scheme is applied to efficiently mitigate cross-tier and co-tier interference. In the second contribution, a multi-hop self-backhauled mmWave communication scenario is studied whereby a joint multi-hop multi-path selection and rate allocation framework is proposed to enable Gbps data rates with reliable communications. Using reinforcement learning techniques, a dynamic and efficient re-routing solution is proposed to cope with blockage and latency constraints. Finally, a risk-sensitive learning solution is leveraged to provide high-reliability and low-latency communications. In summary, the dissertation analyses key trade-offs between (i) capacity and latency, (ii) reliability and network density. Extensive simulation results were carried out to verify the performance gains of the proposed algorithms compared to several baselines and for different network settings. Key findings show significant improvements in terms of higher data rates, lower latency, and reliable communications with some trade-offs. / Tiivistelmä Liikkuvan dataliikenteen ennennäkemättömän kasvun ja verkkojen tihentymisen seurauksena pian käyttöön tulevien viidennen sukupolven (5G) langattomien verkkojen järjestelmäsuunnittelua ja teknologisten mahdollistajien käyttöä on täytynyt lähestyä kokonaan uudesta näkökulmasta. Niinpä tämän väitöstyön johtavana ajatuksena on ehdottaa integroitua verkkoon pääsyn ja runkoverkkoyhteyden muodostamismallia, jossa käyttäjät resursoidaan dynaamisesti ja samalla muodostetaan tehokkaat runkoverkkoyhteydet piensoluille. Tätä varten tutkitaan resurssiallokaation ja häiriöiden lieventämisen yhteisratkaisuja, jotka tukevat kahden tai useamman hypyn yhteyksiä ja samanaikaista runkoverkkoyhteyden luomista millimetriaaltoalueen verkoissa. Työn alkuosa keskittyy usean käyttäjän välitinavusteiseen kahden hypyn solukkoverkkoon, jossa makrotukiasemassa käytetään suurta antenniryhmää muodostamaan samanaikaisesti suuren vahvistuksen antennikeiloja käyttäjälinkeille ja langattomalle runkoyhteysosuudelle. Lisäksi sovelletaan hierarkkista häiriönvaimennusmenetelmää saman kerroksen ja kerrosten välisen häiriön tehokkaaseen vähentämiseen. Työn seuraavassa osassa arvioidaan usean hypyn runkoverkkoyhteyden muodostuksen tutkimusongelmaa millimetrialueen kommunikaatiossa kehittämällä yhdistetty menetelmä usean hypyn monipolkuvalinnalle ja tiedonsiirtoresurssien allokoinnille. Tällä tähdätään gigabittiluokan datanopeuksiin ja luotettavaan tietoliikenteeseen millimetrialueella. Vahvistavan oppimisen tekniikan avulla esitellään dynaaminen ja tehokas uudelleenreitityskonsepti toimimaan esto- ja viiverajoitusten kanssa. Lopuksi hyödynnetään riskisensitiivistä oppimista ja antennidiversiteettitekniikoita suuren luotettavuuden ja pienen latenssin saavuttamiseksi millimetrialueen tiedonsiirrossa. Näiden avulla analysoidaan kaupankäyntiä esimerkiksi (i) kapasiteetin ja latenssin sekä (ii) luotettavuuden ja verkon tiheyden/kuormituksen välillä. Mittavien suoritettujen simulointien avulla osoitetaan ehdotettujen algoritmien suorituskykyedut suhteessa tunnettuihin verrokkeihin useissa eri skenaarioissa. Tulosten perusteella saavutetaan merkittäviä kustannussäästöjä infrastruktuurin ja runkoverkon osalta sekä päästään suuriin datanopeuksiin ja parannuksiin pienen latenssin luotettavassa tietoliikenteessä.