Performance Analysis and Learning Algorithms in Advanced Wireless Networks

Over the past decade, wireless data traffic has experienced an exponential growth, especially with multimedia traffic becoming the dominant traffic, and such growth is expected to continue in the near future. This unprecedented growth has led to an increasing demand for high-rate wireless communications.Key solutions for addressing such demand include extreme network densification with more small-cells, the utilization of high frequency bands, such as the millimeter wave (mmWave) bands and terahertz (THz) bands, where more bandwidth is available, and unmanned aerial vehicle (UAV)-enabled cellular networks. With this motivation, different types of advanced wireless networks are considered in this thesis. In particular, mmWave cellular networks, networks with hybrid THz, mmWave and microwave transmissions, and UAV-enabled networks are studied, and performance metrics such as the signal-to-interference-plus-noise ratio (SINR) coverage, energy coverage, and area spectral efficiency are analyzed. In addition, UAV path planning in cellular networks are investigated, and deep reinforcement learning (DRL) based algorithms are proposed to find collision-free UAV trajectory to accomplish different missions. In the first part of this thesis, mmWave cellular networks are considered. First, K-tier heterogeneous mmWave cellular networks with user-centric small-cell deployments are studied. Particularly, a heterogeneous network model with user equipments (UEs) being distributed according to Poisson cluster processes (PCPs) is considered. Distinguishing features of mmWave communications including directional beamforming and a detailed path loss model are taken into account. General expressions for the association probabilities of different tier base stations (BSs) are determined. Using tools from stochastic geometry, the Laplace transform of the interference is characterized and general expressions for the SINR coverage probability and area spectral efficiency are derived. Second, a distributed multi-agent learning-based algorithm for beamforming in mmWave multiple input multiple output (MIMO) networks is proposed to maximize the sum-rate of all UEs. Following the analysis of mmWave cellular networks, a three-tier heterogeneous network is considered, where access points (APs), small-cell BSs (SBSs) and macrocell BSs (MBSs) transmit in THz, mmWave, microwave frequency bands, respectively. By using tools from stochastic geometry, the complementary cumulative distribution function (CCDF) of the received signal power, the Laplace transform of the aggregate interference, and the SINR coverage probability are determined. Next, system-level performance of UAV-enabled cellular networks is studied. More specifically, in the first part, UAV-assisted mmWave cellular networks are addressed, in which the UE locations are modeled using PCPs. In the downlink phase, simultaneous wireless information and power transfer (SWIPT) technique is considered. The association probability, energy coverages and a successful transmission probability to jointly determine the energy and SINR coverages are derived. In the uplink phase, a scenario that each UAV receives information from its own cluster member UEs is taken into account. The Laplace transform of the interference components and the uplink SINR coverage are characterized. In the second part, cellular-connected UAV networks is investigated, in which the UAVs are aerial UEs served by the ground base stations (GBSs). 3D antenna radiation combing the vertical and horizontal patterns is taken into account. In the final part of this thesis, deep reinforcement learning based algorithms are proposed for UAV path planning in cellular networks. Particularly, in the first part, multi-UAV non-cooperative scenarios is considered, where multiple UAVs need to fly from initial locations to destinations, while satisfying collision avoidance, wireless connectivity and kinematic constraints. The goal is to find trajectories for the cellular-connected UAVs to minimize their mission completion time. The multi-UAV trajectory optimization problem is formulated as a sequential decision making problem, and a decentralized DRL approach is proposed to solve the problem. Moreover, multiple UAV trajectory design in cellular networks with a dynamic jammer is studied, and a learning-based algorithm is proposed. Subsequently, a UAV trajectory optimization problem is considered to maximize the collected data from multiple Internet of things (IoT) nodes under realistic constraints. The problem is translated into a Markov decision process (MDP) and dueling double deep Q-network (D3QN) is proposed to learn the decision making policy

Fine-grained performance analysis of massive MTC networks with scheduling and data aggregation

Abstract. The Internet of Things (IoT) represents a substantial shift within wireless communication and constitutes a relevant topic of social, economic, and overall technical impact. It refers to resource-constrained devices communicating without or with low human intervention. However, communication among machines imposes several challenges compared to traditional human type communication (HTC). Moreover, as the number of devices increases exponentially, different network management techniques and technologies are needed. Data aggregation is an efficient approach to handle the congestion introduced by a massive number of machine type devices (MTDs). The aggregators not only collect data but also implement scheduling mechanisms to cope with scarce network resources. This thesis provides an overview of the most common IoT applications and the network technologies to support them. We describe the most important challenges in machine type communication (MTC). We use a stochastic geometry (SG) tool known as the meta distribution (MD) of the signal-to-interference ratio (SIR), which is the distribution of the conditional SIR distribution given the wireless nodes’ locations, to provide a fine-grained description of the per-link reliability. Specifically, we analyze the performance of two scheduling methods for data aggregation of MTC: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). The results show the fraction of users in the network that achieves a target reliability, which is an important aspect to consider when designing wireless systems with stringent service requirements. Finally, the impact on the fraction of MTDs that communicate with a target reliability when increasing the aggregators density is investigated

NFV orchestration in edge and fog scenarios

Mención Internacional en el título de doctorLas infraestructuras de red actuales soportan una variedad diversa de servicios como video bajo demanda, video conferencias, redes sociales, sistemas de educación, o servicios de almacenamiento de fotografías. Gran parte de la población mundial ha comenzado a utilizar estos servicios, y los utilizan diariamente. Proveedores de Cloud y operadores de infraestructuras de red albergan el tráfico de red generado por estos servicios, y sus tareas de gestión no solo implican realizar el enrutamiento del tráfico, sino también el procesado del tráfico de servicios de red. Tradicionalmente, el procesado del tráfico ha sido realizado mediante aplicaciones/ programas desplegados en servidores que estaban dedicados en exclusiva a tareas concretas como la inspección de paquetes. Sin embargo, en los últimos anos los servicios de red se han virtualizado y esto ha dado lugar al paradigma de virtualización de funciones de red (Network Function Virtualization (NFV) siguiendo las siglas en ingles), en el que las funciones de red de un servicio se ejecutan en contenedores o máquinas virtuales desacopladas de la infraestructura hardware. Como resultado, el procesado de tráfico se ha ido haciendo más flexible gracias al laxo acople del software y hardware, y a la posibilidad de compartir funciones de red típicas, como firewalls, entre los distintos servicios de red. NFV facilita la automatización de operaciones de red, ya que tareas como el escalado, o la migración son típicamente llevadas a cabo mediante un conjunto de comandos previamente definidos por la tecnología de virtualización pertinente, bien mediante contenedores o máquinas virtuales. De todos modos, sigue siendo necesario decidir el en rutamiento y procesado del tráfico de cada servicio de red. En otras palabras, que servidores tienen que encargarse del procesado del tráfico, y que enlaces de la red tienen que utilizarse para que las peticiones de los usuarios lleguen a los servidores finales, es decir, el conocido como embedding problem. Bajo el paraguas del paradigma NFV, a este problema se le conoce en inglés como Virtual Network Embedding (VNE), y esta tesis utiliza el termino “NFV orchestration algorithm” para referirse a los algoritmos que resuelven este problema. El problema del VNE es NP-hard, lo cual significa que que es imposible encontrar una solución optima en un tiempo polinómico, independientemente del tamaño de la red. Como consecuencia, la comunidad investigadora y de telecomunicaciones utilizan heurísticos que encuentran soluciones de manera más rápida que productos para la resolución de problemas de optimización. Tradicionalmente, los “NFV orchestration algorithms” han intentado minimizar los costes de despliegue derivados de las soluciones asociadas. Por ejemplo, estos algoritmos intentan no consumir el ancho de banda de la red, y usar rutas cortas para no utilizar tantos recursos. Además, una tendencia reciente ha llevado a la comunidad investigadora a utilizar algoritmos que minimizan el consumo energético de los servicios desplegados, bien mediante la elección de dispositivos con un consumo energético más eficiente, o mediante el apagado de dispositivos de red en desuso. Típicamente, las restricciones de los problemas de VNE se han resumido en un conjunto de restricciones asociadas al uso de recursos y consumo energético, y las soluciones se diferenciaban por la función objetivo utilizada. Pero eso era antes de la 5a generación de redes móviles (5G) se considerase en el problema de VNE. Con la aparición del 5G, nuevos servicios de red y casos de uso entraron en escena. Los estándares hablaban de comunicaciones ultra rápidas y fiables (Ultra-Reliable and Low Latency Communications (URLLC) usando las siglas en inglés) con latencias por debajo de unos pocos milisegundos y fiabilidades del 99.999%, una banda ancha mejorada (enhanced Mobile Broadband (eMBB) usando las siglas en inglés) con notorios incrementos en el flujo de datos, e incluso la consideración de comunicaciones masivas entre maquinas (Massive Machine-Type Communications (mMTC) usando las siglas en inglés) entre dispositivos IoT. Es más, paradigmas como edge y fog computing se incorporaron a la tecnología 5G, e introducían la idea de tener dispositivos de computo más cercanos al usuario final. Como resultado, el problema del VNE tenía que incorporar los nuevos requisitos como restricciones a tener en cuenta, y toda solución debía satisfacer bajas latencias, alta fiabilidad, y mayores tasas de transmisión. Esta tesis estudia el problema des VNE, y propone algunos heurísticos que lidian con las restricciones asociadas a servicios 5G en escenarios edge y fog, es decir, las soluciones propuestas se encargan de asignar funciones virtuales de red a servidores, y deciden el enrutamiento del trafico en las infraestructuras 5G con dispositivos edge y fog. Para evaluar el rendimiento de las soluciones propuestas, esta tesis estudia en primer lugar la generación de grafos que representan redes 5G. Los mecanismos propuestos para la generación de grafos sirven para representar distintos escenarios 5G. En particular, escenarios de federación en los que varios dominios comparten recursos entre ellos. Los grafos generados también representan servidores en el edge, así como dispositivos fog con una batería limitada. Además, estos grafos tienen en cuenta los requisitos de estándares, y la demanda que se espera en las redes 5G. La generación de grafos propuesta sirve para representar escenarios federación en los que varios dominios comparten recursos entre ellos, y redes 5G con servidores edge, así como dispositivos fog estáticos o móviles con una batería limitada. Los grafos generados para infraestructuras 5G tienen en cuenta los requisitos de estándares, y la demanda de red que se espera en las redes 5G. Además, los grafos son diferentes en función de la densidad de población, y el área de estudio, es decir, si es una zona industrial, una autopista, o una zona urbana. Tras detallar la generación de grafos que representan redes 5G, esta tesis propone algoritmos de orquestación NFV para resolver con el problema del VNE. Primero, se centra en escenarios federados en los que los servicios de red se tienen que asignar no solo a la infraestructura de un dominio, sino a los recursos compartidos en la federación de dominios. Dos problemas diferentes han sido estudiados, uno es el problema del VNE propiamente dicho sobre una infraestructura federada, y el otro es la delegación de servicios de red. Es decir, si un servicio de red se debe desplegar localmente en un dominio, o en los recursos compartidos por la federación de dominios; a sabiendas de que el último caso supone el pago de cuotas por parte del dominio local a cambio del despliegue del servicio de red. En segundo lugar, esta tesis propone OKpi, un algoritmo de orquestación NFV para conseguir la calidad de servicio de las distintas slices de las redes 5G. Conceptualmente, el slicing consiste en partir la red de modo que cada servicio de red sea tratado de modo diferente dependiendo del trozo al que pertenezca. Por ejemplo, una slice de eHealth reservara los recursos de red necesarios para conseguir bajas latencias en servicios como operaciones quirúrgicas realizadas de manera remota. Cada trozo (slice) está destinado a unos servicios específicos con unos requisitos muy concretos, como alta fiabilidad, restricciones de localización, o latencias de un milisegundo. OKpi es un algoritmo de orquestación NFV que consigue satisfacer los requisitos de servicios de red en los distintos trozos, o slices de la red. Tras presentar OKpi, la tesis resuelve el problema del VNE en redes 5G con dispositivos fog estáticos y móviles. El algoritmo de orquestación NFV presentado tiene en cuenta las limitaciones de recursos de computo de los dispositivos fog, además de los problemas de falta de cobertura derivados de la movilidad de los dispositivos. Para concluir, esta tesis estudia el escalado de servicios vehiculares Vehicle-to-Network (V2N), que requieren de bajas latencias para servicios como la prevención de choques, avisos de posibles riesgos, y conducción remota. Para estos servicios, los atascos y congestiones en la carretera pueden causar el incumplimiento de los requisitos de latencia. Por tanto, es necesario anticiparse a esas circunstancias usando técnicas de series temporales que permiten saber el tráfico inminente en los siguientes minutos u horas, para así poder escalar el servicio V2N adecuadamente.Current network infrastructures handle a diverse range of network services such as video on demand services, video-conferences, social networks, educational systems, or photo storage services. These services have been embraced by a significant amount of the world population, and are used on a daily basis. Cloud providers and Network operators’ infrastructures accommodate the traffic rates that the aforementioned services generate, and their management tasks do not only involve the traffic steering, but also the processing of the network services’ traffic. Traditionally, the traffic processing has been assessed via applications/programs deployed on servers that were exclusively dedicated to a specific task as packet inspection. However, in recent years network services have stated to be virtualized and this has led to the Network Function Virtualization (Network Function Virtualization (NFV)) paradigm, in which the network functions of a service run on containers or virtual machines that are decoupled from the hardware infrastructure. As a result, the traffic processing has become more flexible because of the loose coupling between software and hardware, and the possibility of sharing common network functions, as firewalls, across multiple network services. NFV eases the automation of network operations, since scaling and migrations tasks are typically performed by a set of commands predefined by the virtualization technology, either containers or virtual machines. However, it is still necessary to decide the traffic steering and processing of every network service. In other words, which servers will hold the traffic processing, and which are the network links to be traversed so the users’ requests reach the final servers, i.e., the network embedding problem. Under the umbrella of NFV, this problem is known as Virtual Network Embedding (VNE), and this thesis refers as “NFV orchestration algorithms” to those algorithms solving such a problem. The VNE problem is a NP-hard, meaning that it is impossible to find optimal solutions in polynomial time, no matter the network size. As a consequence, the research and telecommunications community rely on heuristics that find solutions quicker than a commodity optimization solver. Traditionally, NFV orchestration algorithms have tried to minimize the deployment costs derived from their solutions. For example, they try to not exhaust the network bandwidth, and use short paths to use less network resources. Additionally, a recent tendency led the research community towards algorithms that minimize the energy consumption of the deployed services, either by selecting more energy efficient devices or by turning off those network devices that remained unused. VNE problem constraints were typically summarized in a set of resources/energy constraints, and the solutions differed on which objectives functions were aimed for. But that was before 5th generation of mobile networks (5G) were considered in the VNE problem. With the appearance of 5G, new network services and use cases started to emerge. The standards talked about Ultra Reliable Low Latency Communication (Ultra-Reliable and Low Latency Communications (URLLC)) with latencies below few milliseconds and 99.999% reliability, an enhanced mobile broadband (enhanced Mobile Broadband (eMBB)) with significant data rate increases, and even the consideration of massive machine-type communications (Massive Machine-Type Communications (mMTC)) among Internet of Things (IoT) devices. Moreover, paradigms such as edge and fog computing blended with the 5G technology to introduce the idea of having computing devices closer to the end users. As a result, the VNE problem had to incorporate the new requirements as constraints to be taken into account, and every solution should either satisfy low latencies, high reliability, or larger data rates. This thesis studies the VNE problem, and proposes some heuristics tackling the constraints related to 5G services in Edge and fog scenarios, that is, the proposed solutions assess the assignment of Virtual Network Functions to resources, and the traffic steering across 5G infrastructures that have Edge and Fog devices. To evaluate the performance of the proposed solutions, the thesis studies first the generation of graphs that represent 5G networks. The proposed mechanisms to generate graphs serve to represent diverse 5G scenarios. In particular federation scenarios in which several domains share resources among themselves. The generated graphs also represent edge servers, so as fog devices with limited battery capacity. Additionally, these graphs take into account the standard requirements, and the expected demand for 5G networks. Moreover, the graphs differ depending on the density of population, and the area of study, i.e., whether it is an industrial area, a highway, or an urban area. After detailing the generation of graphs representing the 5G networks, this thesis proposes several NFV orchestration algorithms to tackle the VNE problem. First, it focuses on federation scenarios in which network services should be assigned not only to a single domain infrastructure, but also to the shared resources of the federation of domains. Two different problems are studied, one being the VNE itself over a federated infrastructure, and the other the delegation of network services. That is, whether a network service should be deployed in a local domain, or in the pool of resources of the federation domain; knowing that the latter charges the local domain for hosting the network service. Second, the thesis proposes OKpi, a NFV orchestration algorithm to meet 5G network slices quality of service. Conceptually, network slicing consists in splitting the network so network services are treated differently based on the slice they belong to. For example, an eHealth network slice will allocate the network resources necessary to meet low latencies for network services such as remote surgery. Each network slice is devoted to specific services with very concrete requirements, as high reliability, location constraints, or 1ms latencies. OKpi is a NFV orchestration algorithm that meets the network service requirements among different slices. It is based on a multi-constrained shortest path heuristic, and its solutions satisfy latency, reliability, and location constraints. After presenting OKpi, the thesis tackles the VNE problem in 5G networks with static/moving fog devices. The presented NFV orchestration algorithm takes into account the limited computing resources of fog devices, as well as the out-of-coverage problems derived from the devices’ mobility. To conclude, this thesis studies the scaling of Vehicle-to-Network (V2N) services, which require low latencies for network services as collision avoidance, hazard warning, and remote driving. For these services, the presence of traffic jams, or high vehicular traffic congestion lead to the violation of latency requirements. Hence, it is necessary to anticipate to such circumstances by using time-series techniques that allow to derive the incoming vehicular traffic flow in the next minutes or hours, so as to scale the V2N service accordingly.The 5G Exchange (5GEx) project (2015-2018) was an EU-funded project (H2020-ICT-2014-2 grant agreement 671636). The 5G-TRANSFORMER project (2017-2019) is an EU-funded project (H2020-ICT-2016-2 grant agreement 761536). The 5G-CORAL project (2017-2019) is an EU-Taiwan project (H2020-ICT-2016-2 grant agreement 761586).Programa de Doctorado en Ingeniería Telemática por la Universidad Carlos III de MadridPresidente: Ioannis Stavrakakis.- Secretario: Pablo Serrano Yáñez-Mingot.- Vocal: Paul Horatiu Patra

Direct communication radio Iinterface for new radio multicasting and cooperative positioning

Cotutela: Universidad de defensa UNIVERSITA’ MEDITERRANEA DI REGGIO CALABRIARecently, the popularity of Millimeter Wave (mmWave) wireless networks has increased due to their capability to cope with the escalation of mobile data demands caused by the unprecedented proliferation of smart devices in the fifth-generation (5G). Extremely high frequency or mmWave band is a fundamental pillar in the provision of the expected gigabit data rates. Hence, according to both academic and industrial communities, mmWave technology, e.g., 5G New Radio (NR) and WiGig (60 GHz), is considered as one of the main components of 5G and beyond networks. Particularly, the 3rd Generation Partnership Project (3GPP) provides for the use of licensed mmWave sub-bands for the 5G mmWave cellular networks, whereas IEEE actively explores the unlicensed band at 60 GHz for the next-generation wireless local area networks. In this regard, mmWave has been envisaged as a new technology layout for real-time heavy-traffic and wearable applications. This very work is devoted to solving the problem of mmWave band communication system while enhancing its advantages through utilizing the direct communication radio interface for NR multicasting, cooperative positioning, and mission-critical applications. The main contributions presented in this work include: (i) a set of mathematical frameworks and simulation tools to characterize multicast traffic delivery in mmWave directional systems; (ii) sidelink relaying concept exploitation to deal with the channel condition deterioration of dynamic multicast systems and to ensure mission-critical and ultra-reliable low-latency communications; (iii) cooperative positioning techniques analysis for enhancing cellular positioning accuracy for 5G+ emerging applications that require not only improved communication characteristics but also precise localization. Our study indicates the need for additional mechanisms/research that can be utilized: (i) to further improve multicasting performance in 5G/6G systems; (ii) to investigate sideline aspects, including, but not limited to, standardization perspective and the next relay selection strategies; and (iii) to design cooperative positioning systems based on Device-to-Device (D2D) technology

Physical-layer security in 6G networks

The sixth generation (6G) of mobile network will be composed by different nodes, from macro-devices (satellite) to nano-devices (sensors inside the human body), providing a full connectivity fabric all around us. These heterogeneous nodes constitute an ultra dense network managing tons of information, often very sensitive. To trust the services provided by such network, security is a mandatory feature by design. In this scenario, physical-layer security (PLS) can act as a first line of defense, providing security even to low-resourced nodes in different environments. This paper discusses challenges, solutions and visions of PLS in beyond-5G networks

Energy optimization in ultra-dense radio access networks via traffic-aware cell switching

We propose a reinforcement learning based cell switching algorithm to minimize the energy consumption in ultra-dense deployments without compromising the quality of service (QoS) experienced by the users. In this regard, the proposed method can intelligently learn which small cells (SCs) to turn off at any given time based on the traffic load of the SCs and the macro cell. To validate the idea, we used the open call detail record (CDR) data set from the city of Milan, Italy, and tested our algorithm against typical operational benchmark solutions. With the obtained results, we demonstrate exactly when and how the proposed method can provide energy savings, and moreover how this happens without reducing QoS of users. Most importantly, we show that our solution has a very similar performance to the exhaustive search, with the advantage of being scalable and less complex

Enabling Cyber-Physical Communication in 5G Cellular Networks: Challenges, Solutions and Applications

Cyber-physical systems (CPS) are expected to revolutionize the world through a myriad of applications in health-care, disaster event applications, environmental management, vehicular networks, industrial automation, and so on. The continuous explosive increase in wireless data traffic, driven by the global rise of smartphones, tablets, video streaming, and online social networking applications along with the anticipated wide massive sensors deployments, will create a set of challenges to network providers, especially that future fifth generation (5G) cellular networks will help facilitate the enabling of CPS communications over current network infrastructure. In this dissertation, we first provide an overview of CPS taxonomy along with its challenges from energy efficiency, security, and reliability. Then we present different tractable analytical solutions through different 5G technologies, such as device-to-device (D2D) communications, cell shrinking and offloading, in order to enable CPS traffic over cellular networks. These technologies also provide CPS with several benefits such as ubiquitous coverage, global connectivity, reliability and security. By tuning specific network parameters, the proposed solutions allow the achievement of balance and fairness in spectral efficiency and minimum achievable throughout among cellular users and CPS devices. To conclude, we present a CPS mobile-health application as a case study where security of the medical health cyber-physical space is discussed in details

Deployment and navigation of aerial drones for sensing and interacting applications

Existing research recognises the critical role played by Unmanned Aerial Vehicles (UAVs) (also referred to as drones) to numerous civilian applications. Typical drone applications include surveillance, wireless communication, agriculture, among many others. One of the biggest challenges is to determine the deployment and navigation of the drones to benefit the most for different applications. Many research questions have been raised about this topic. For example, drone-enabled wildlife monitoring has received much attention in recent years. Unfortunately, this approach results in significant disturbance to different species of wild animals. Moreover, with the capability of rapidly moving communication supply towards demand when required, the drone equipped with a base station, i.e., drone-cell, is becoming a promising solution for providing cellular networks to victims and rescue teams in disaster-affected areas. However, few studies have investigated the optimal deployments of multiple drone-cells with limited backhaul communication distances. In addition, the use of autonomous drones as flying interactors for many real-life applications has not been sufficiently discussed. With superior maneuverability, drone-enabled autonomous aerial interacting can potentially be used on shark attack prevention and animal herding. Nevertheless, previous studies of autonomous drones have not dealt with such applications in much detail. This thesis explores the solutions to all the mentioned research questions, with a particular focus on the deployment and navigation of the drones. First, we provide one of the first investigations into reducing the negative impacts of wildlife monitoring drones by navigation control. Second, we study the optimal placement of a group of drone-cells with limited backhaul communication ranges, aims to maximise the number of served users. Third, we propose a novel method named ‘drone shark shield’, which uses communicating autonomous drones to intervene and prevent shark attacks for protecting swimmers and surfers. Lastly, we introduce one of the first autonomous drone herding systems for mustering a large number of farm animals efficiently. Simulations have been conducted to verify the effectiveness of the proposed approaches. We believe that our findings in this thesis shed new light on the fundamental benefits of autonomous civilian drones

Modélisation de Réseaux sans Fils de Grandes Dimensions à l'aide de la Géométrie Stochastique

The main goal of this work is to study cooperative aspects of large wireless networks from the perspective of stochastic geometry. This allows the consideration of important effects such as the random spatial distribution of nodes, as well as the effects of interference and interference correlation at receivers, which are not possible when a single link is considered in isolation.First, some aspects of the performance of the relay channel in the context of a large wireless network are considered. Mainly, the performance, in terms of outage probability (OP), of a single full-duplex relay channel utilizing decode-and-forward (DF) or compress-and-forward, when the interference is generated by uniform spatial deployment of nodes, modeled as a Poisson point process. The OP performance of these two protocols is compared with a point-to-point transmission and with a half-duplex DF protocol. Afterwards, the case in which more than one transmitter in the network may use a relay is considered. The effects of cooperation versus interference are studied, when the users use either full-duplex DF, or point-to-point transmissions. In a second phase, this work explores the advantages that could be obtained through out-of-band device-to-device (D2D) video file exchanges in cellular networks. These advantages are measured in terms of the fraction of requests that can be served in a time-block through D2D, thus avoiding a downlink file transfer from the base station. For this, a stochastic geometry framework is introduced, in which the user file-caching policy, user pairing strategy, and link quality and scheduling issues are considered.L'objectif de cette thèse est d'étudier certains aspects des réseaux coopératifs sans fils à l'aide de la géométrie stochastique. Ça permets de considérer la distribution spatiale aléatoire des utilisateurs et les effets adverses de leur interaction, comme l’interférence.Nous étudions la performance, évaluée par la probabilité d'outage, atteignable dans un canal de relai full-duplex quand les nœuds opèrent dans un grand réseau sans fils où les émetteurs interférants sont modelés avec un processus ponctuel de Poisson homogène. Nous trouvons la probabilité d'outage des protocoles décodez-et-renvoyez (decode-and-forward, DF), et comprimez-et-renvoyez (compress-and-forward) et nous faisons une comparaison avec une transmission point à point et un protocole DF half-duplex. Ensuite, nous étudions une situation plus générale dans laquelle les émetteurs qui causent l'interférence peuvent aussi utiliser un relai ou faire des transmissions point à point. Nous étudions la relation entre les avantages de la cooperation et l'interférence qu'elle même génère.Dans la deuxième partie nous étudions la performance des stratégies de partage de vidéos par communications entre dispositifs mobiles (device-to-device, D2D) hors de la bande des communications cellulaires. Nous étudions la fraction des demandes de vidéos qui peuvent être satisfaites par D2D, c’est-à-dire, par le biais des émissions locales, plutôt que par la station de base. Pour étudier ce problème, nous introduisons un modèle de processus ponctuel, qui considère la stratégie de stockage dans les utilisateurs, le problème de comment lier les utilisateurs et les problèmes de la transmission et coordination entre les utilisateurs