Given the exponentially increasing number of connected devices to the network which will lead to a larger number of installed celluar towers and base stations that are in closer proximity to one another when compared to the current cellular network setup, and the increasing demand of higher data rates by end users, it becomes essential to investigate new methods that will more effectively mitigate the larger interference introduced by the more packed celluar grid and that result in higher data rates. This paper investigates using Device-to-Device communication where neighboring users can cooperate to mitigate the correlated interference they both receive, where one user acts as a relay and the other as the intended destination of a broadcast message sent by the source base station. The setup studied utalizes a non-orthogonal multiple access (NOMA) scheme and a combined decode-forward and compress-forward relaying scheme. We show that this combined scheme outperforms the individual schemes for some channels and network setups, or reduces to either scheme when the combination does not offer any achievable rate gains. The performance of each scheme is measured with respect to the locations of the base station and the two devices, and to the capacity of the digital link between the users.

No / Enabling D2D communications over LTE-A networks can provide many benefits in terms of throughput, energy consumption, traffic load, and so on. It also enables new commercial services such as location-based advertising. For these reasons, D2D communications has become a hot topic in both the academic and industrial communities. However, many research works are focused on node discovery, radio resource management, and other aspects, while the issue of security is less addressed. In this article, we intend to provide an overview of the security architecture, threads, and requirements. Based on these requirements, we propose several potential solutions by reusing the existing security mechanisms. Promising topics related to secure D2D communications for future research are also discussed.

L'explosion du trafic dans les réseaux mobiles d'aujourd'hui est l'une des préoccupations majeures des opérateurs mobiles. En effet, entre investir dans le développement de l’infrastructure pour supporter l’évolution des besoins des utilisateurs et faire face à la concurrence accrue des nouveaux acteurs du marché, l’enjeu est considérable. Dans ce contexte, les communications Device-to-Device (D2D) offrent aux opérateurs mobiles de nouvelles opportunités aussi bien financières que techniques, à travers les communications directes entre les appareils mobiles permettant de délester le réseau d'une partie du trafic. L'organisme de standardisation 3GPP a défini des évolutions de son architecture LTE/4G fonctionnelle pour supporter les communications D2D dans le cadre de Services de Proximité (ProSe). Cependant, les modèles économiques autour de ces nouveaux services sont encore flous et les solutions actuellement proposées par le 3GPP visent un déploiement à court terme d’un ensemble limité de services (ex : les services de sécurité publique). La première contribution proposée dans le cadre de cette thèse est une évolution de l'architecture ProSe vers une architecture cible distribuée dans laquelle les fonctions liées à ProSe sont mutualisées avec d'autres fonctions réseaux. La deuxième contribution porte sur l’intégration des services véhiculaires dans les réseaux mobiles en tant que services ProSe particuliers reposant sur les communications D2D. L'architecture CVS (Cellular Vehicular Services) est alors proposée comme solution pour un déploiement à grande échelle des services véhiculaires en s'appuyant sur une nouvelle évolution de l’architecture ProSe distribuée. Un algorithme de « clustering » ainsi que des procédures de communication en mode relais D2D sont utilisés dans la conception de la solution afin d’optimiser l'usage des ressources du réseau. Enfin, les performances de ces contributions sont évaluées à l'aide de modèles analytiques et de simulations afin de valider les approches et solutions proposées / The traffic explosion in today’s mobile networks is one of the major concerns of mobile operators. This explosion is mostly widening the gap between networks’ capacities and users’ growing needs in terms of bandwidth and QoS (Quality of Service), which directly impacts operators’ business profitability. In this context, Device-to-Device (D2D) communications offer mobile operators business and technical opportunities by allowing the network traffic offload with D2D direct communications between mobile devices. The recent standardization of D2D-based services as Proximity Services (ProSe) by the 3GPP provides already a set of enhancements to the current LTE/4G architecture to support these services. However, still in its infancy, the proposed solutions are envisioned for short-term market deployments and for a limited set of service categories (i.e public safety services). As a first contribution of this thesis, the proposed Distributed ProSe Architecture enhances the current ProSe architecture for a longer term deployment perspective of D2D-based services. On the basis of this enhanced architecture, vehicular communications and related services are further investigated as a specific implementation of ProSe as well as a new market opportunity for mobile operators. The CVS (Cellular Vehicular Services) solution is then introduced as an architecture framework that enables the integration of vehicular networks into mobile operators’ network infrastructure. A mobile network clustering algorithm and D2D relay-based communication mechanisms are used in the solution design in order to optimize the use of both core and radio network resources. Performance evaluation through analytical modeling and simulations are also carried out to validate the proposed contributions

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. / 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.

Le problème de coloration de graphe est un problème NP-complet particulièrement étudié, qui permet de modéliser de problèmes dans des domaines variés. Dans cette thèse, de nouveaux algorithmes exacts basés sur une étude de la structure du graphe sont proposés. Ce travail s'appuie sur l'algorithme « Total solutions Exact graph Coloring » (TexaCol) qui construit toutes les solutions en exploitant l'ensemble des cliques d'un graphe. Deux algorithmes exacts, « Partial best solutions Exact graph Coloring » (PexaCol) et « All best solutions Exact graph Coloring » (AexaCol), sont présentés ici pour construire certaines solutions optimales ou toutes les meilleures solutions. Ces deux algorithmes utilisent la méthode de backtracking, dans laquelle ils ne choisissent que les sous-ensembles de meilleurs solutions pour continuer la coloration. L’analyse de résultat montre que PexaCol et AexaCol sont capables de traiter des graphes plus grands que TexaCol. Mais surtout, AexaCol trouve toutes les meilleures solutions significativement plus vite que TexaCol ainsi que le solveur Gurobi, qui sont utilisés comme référence.La téléphonie mobile est un domaine en plein essor qui peut s'appuyer sur une modélisation à base de graphes. Actuellement, les techniques de type « Device-to-Device » (D2D) prennent une place importante dans les réseaux mobiles. L’allocation de ressource constitue l'un des principaux problèmes en matière de performance. Pour assigner efficacement une ressource radio à une paire D2D dans le système Long-Term Evolution (LTE), un schéma systématique d'allocation de ressources est proposé dans cette thèse. Il est basé sur une clusturisation des liens D2D, et permet de prendre en compte à la fois l'allocation inter-cluster et intra-cluster des ressources. En déterminant les zones d'interférence, le problème d'allocation des ressources inter-cluster est formulé comme un problème de coloration de graphe dynamique. Un algorithme de coloration de graphe dynamique est ainsi proposé, basé sur PexaCol. Cet algorithme peut assigner les ressources radio aux clusters qui sont générés ou supprimés dynamiquement. L’analyse numérique montre que cet algorithme assure une bonne performance en termes d'utilisation des ressources, de temps d’exécution et d'adaptabilité. Concernant le problème d’allocation de ressources inter-cluster, une méthode fondée sur la topologie est proposée, intégrant naturellement l'allocation de puissance et l’allocation de Resource Block (RB). Pour simplifier ce problème d'allocation de ressources, la meilleure topologie est choisie à chaque étape, celle qui permet d'obtenir le meilleur débit en utilisant le moins de RBs. A partir de ce procédé, quatre algorithmes d'optimisation sont proposés: l’algorithme glouton statique, PexaCol statique, PexaCol dynamique et PexaCol dynamique approximatif. L'analyse des résultats montre que pour les petits clusters, les versions statiques et dynamiques de PexaCol permettent d'obtenir un index d’optimisation maximal en choisissant la meilleure topologie locale pour chaque noeud. A l'opposé, les algorithmes "glouton statique" et "PexaCol dynamique approximatif" permettent d'obtenir une solution sous-optimale pour l'optimisation locale avec une complexité moindre. Pour les grands clusters, avec certaine séquence de la coloration, le PexaCol dynamique approximatif est mieux que l’algorithme glouton statique pour l’index d’optimisation pendant un temps d’exécution acceptable. / Graph coloring problem is a famous NP-complete problem, which has extensive applications. In the thesis, new exact graph coloring algorithms are researched from a graph structure point of view. Based on Total solutions Exact graph Coloring algorithm (TexaCol) which is capable of getting all coloring solution subsets for each subgraph, two other exact algorithms, Partial best solutions Exact graph Coloring algorithm (PexaCol) and All best solutions Exact graph Coloring algorithm (AexaCol), are presented to get multiple best solutions. These two algorithms utilize the backtracking method, in which they only choose the best solution subset each step to continue the coloring until partial or all best solutions are obtained. The result analysis shows that PexaCol and AexaCol can deal with larger graphs than TexaCol and especially, AexaCol runs much faster than TexaCol and the solver Gurobi to get all best solutions.Device-to-Device (D2D) is a promising technique for the future mobile networks, such as 5th generation wireless systems (5G), and the resource allocation is one of the most crucial problems for its performance. In order to efficiently allocate radio resource for D2D links in Long-Term Evolution (LTE) system, a systematic resource allocation scheme is proposed based on D2D clusters, including the inter-cluster resource allocation and the intra-cluster resource allocation. With the cluster interference range, the inter-cluster resource allocation problem is formulated as a dynamic graph coloring problem, and a dynamic graph coloring algorithm is designed based on PexaCol. This algorithm is able to allocate radio resource to clusters while they are dynamically generated and deleted. The numerical analysis results show that this algorithm has good performance in resource utilization, runtime and scalability.For the intra-cluster resource allocation problem, a topology-based resource allocation method is designed naturally combining power allocation with Resource Block (RB) allocation. To simplify this associated optimization problem, a local optimal method is proposed, in which the best topology is chosen each step achieving the maximal throughput with the minimum number of assigned RBs. With respect to this method, four algorithms are presented: static greedy, static PexaCol, dynamic PexaCol and dynamic PexaCol approximate. Result analysis shows that for small-scale clusters, static PexaCol and dynamic PexaCol are capable of getting a maximal optimization index by locally choosing the best topology for each node while static greedy and dynamic PexaCol approximate are able to get the suboptimal solution for the local optimization with much lower complexity. For large-scale clusters, giving certain treating sequences, the dynamic PexaCol approximate performs better than static greedy regarding the optimization index within an acceptable runtime.

Cette thèse porte sur plusieurs technologies de déchargement cellulaire pour les futurs réseaux sans fil avec l’amélioration envisagée sur la efficacité spatiale du spectre et l’efficacité énergétique. Notre recherche concerne deux directions principales, y compris la communication D2D underlaid dans les réseaux cellulaires et le caching proactif au bord de réseau.La première partie de cette thèse contient deux chapitres qui présentent nos résultats de recherche sur les réseaux cellulaire avec D2D underlaid. Notre recherche se focalise sur l’accès opportuniste distribué, dont la performance en termes du débit D2D est optimisé dans deux scénarios: 1) en supposant que l’utilisateur cellulaire avec un trafic saturé peut avoir une probabilité de couverture minimale; 2) en supposant que le trafic discontinu à l’utilisateur cellulaire, dont le délai moyen doit être maintenue au-dessous d’un certain seuil. La deuxième partie de cette thèse se focalise sur les méthodes de caching proactif au bord de réseau, y compris le caching aux petites cellules et aux appareils des utilisateurs. Tout d’abord, nous étudions le placement de contenu probabiliste dans différents types de réseaux et avec différents objectifs d’optimisation. Deuxièmement, pour le caching aux petites cellules, nous proposons un schéma coopérative parmi les petites stations de base, qui exploite le gain combiné du caching coopérative et les techniques de multipoint coordonnée. Les modèles de processus ponctuel nous permet de créer la connexion entre la diversité de transmission en couche PHY et la diversité de contenus stockés. / This thesis focuses on several emerging technologies towards future wireless networks with envisaged improvement on the area spectral efficiency and energy efficiency. The related research involves two major directions, including deviceto- device (D2D) communication underlaid cellular networks and proactive caching at network edge. The first part of this thesis starts with introducing D2D underlaid cellular network model and distributed access control methods for D2D users that reuse licensed cellular uplink spectrum. We aim at optimize the throughput of D2D network in the following two scenarios: 1) assuming always backlogged cellular users with coverage probability constraint, 2) assuming bursty packet arrivals at the cellular user, whose average delay must be kept below a certain threshold. The second part of this thesis focuses on proactive caching methods at network edge, including at small base stations (SBSs) and user devices. First, we study and compare the performance of probabilistic content placement in different types of wireless caching networks and with different optimization objectives. Second, we propose a cooperative caching and transmission strategy in a cluster-centric small cell networks (SCNs), which exploits the combined gain of cache-level cooperation and CoMP technique. Using spatial models from stochastic geometry, we build the connection between PHY transmission diversity and the content diversity in local caches.

Device-to-device (D2D) communications underlaying a cellular infrastructure takes advantage of the physical proximity of communicating devices and increasing resource utilisation. However, adopting D2D communications in complex scenarios poses substantial challenges for the resource allocation design. Meanwhile, matching theory has emerged as a promising framework for wireless resource allocation which can overcome some limitations of game theory and optimisation. This thesis focuses on the resource allocation optimisation for D2D communications based on matching theory. First, resource allocation policy is designed for D2D communications underlaying cellular networks. A novel spectrum allocation algorithm based on many-to-many matching is proposed to improve system sum rate. Additionally, considering the quality-of-service (QoS) requirements and priorities of di erent applications, a context-aware resource allocation algorithm based on many-to-one matching is proposed, which is capable of providing remarkable performance enhancement in terms of improved data rate, decreased packet error rate (PER) and reduced delay. Second, to improve resource utilisation, joint subchannel and power allocation problem for D2D communications with non-orthogonal multiple access (NOMA) is studied. For the subchannel allocation, a novel algorithm based on the many-to-one matching is proposed for obtaining a suboptimal solution. Since the power allocation problem is non-convex, sequential convex programming is adopted to transform the original power allocation problem to a convex one. The proposed algorithm is shown to enhance the network sum rate and number of accessed users. Third, driven by the trend of heterogeneity of cells, the resource allocation problem for NOMA-enhanced D2D communications in heterogeneous networks (HetNets) is investigated. In such a scenario, the proposed resource allocation algorithm is able to closely approach the optimal solution within a limited number of iterations and achieves higher sum rate compared to traditional HetNets schemes. Thorough theoretical analysis is conducted in the development of all proposed algorithms, and performance of proposed algorithm is evaluated via comprehensive simulations. This thesis concludes that matching theory based resource allocation for D2D communications achieves near-optimal performance with acceptable complexity. In addition, the application of D2D communications in NOMA and HetNets can improve system performance in terms of sum rate and users connectivity.

Device-to-Device (D2D) communication is one of the technologies for next generation communication system. Unlike traditional cellular network, D2D allows proximity users to communicate directly with each other without routing the data through a base station. The main aim of this study is to improve the overall energy efficiency (EE) of D2D communications overlaying cellular system. To reduce the complexity of joint EE optimization, we decompose the main EE problem into two subproblems; resource efficiency (RE) optimization in the first stage and EE optimization for D2D pairs in the second stage. Firstly, we propose an alternative two-stage RE-EE scheme for a single cellular user equipment (CUE) and a D2D pair utilizing uplink spectrum. Later, we extend this work for multiple CUEs and D2D pairs by considering the downlink orthogonal frequency division multiple access (OFDMA). By exploiting a range of optimization tools including the Bisection method, interior point algorithm, fractional programming, Dinkelbach approach, Lagrange dual decomposition, difference of convex functions, and concave-convex procedure, the original non-convex problems are solved and we present iterative two-stage RE-EE solutions. Simulation results demonstrate that the proposed two-stage scheme for uplink scenario outperforms the cellular mode and dedicated mode of communications and the performance is close to the global optimal solution. The results also show that the proposed schemes for downlink resource sharing provide improved system EE performance with significant gain on EE for D2D users compared to a two-stage EE-EE solution, which is obtained numerically. Furthermore, the RE and EE optimization for non-orthogonal multiple access (NOMA) are considered to study the effect of users' access to the whole spectrum. The results indicate that the proposed RE scheme for NOMA with D2D communications achieves higher system EE compared to the OFDMA based schemes.

Device-to-device communication has been suggested as a complement to traditional cellular networks as a means of offloading cellular traffic. In this thesis we explore a solution for device-to-device communication based on opportunistic content distribution in a content-centric network. Communication opportunities arise as mobile nodes roam around in an area and occasionally enter in direct communication range with one another. We consider a node to be a pedestrian equipped with a mobile device and explore the properties of opportunistic communication in the context of content dissemination in urban areas. The contributions of this thesis lie in three areas. We first study human mobility as one of the main enablers of opportunistic communication. We introduce traces collected from a realistic pedestrian mobility simulator and demonstrate that the performance of opportunistic networks is not very sensitive to the accurate estimation of the probability distributions of mobility parameters. However, capturing the space in which mobility occurs may be of high importance. Secondly, we design and implement a middleware for opportunistic content-centric networking, and we evaluate it via a small-scale testbed, as well as through extensive simulations. We conclude that energy-saving mechanisms should be part of the middleware design, while caching should be considered only as an add-on feature. Thirdly, we present and evaluate three different energy-saving mechanisms in the context of opportunistic networking: a dual-radio architecture, an asynchronous duty-cycling scheme, and an energy-aware algorithm which takes into account node selfishness. We evaluate our proposals analytically and via simulations. We demonstrate that when a critical mass of participants is available, the performance of the opportunistic network is comparable to downloading contents directly via the cellular network in terms of energy consumption while offloading large traffic volumes from the operator. / <p>QC 20151120</p>

The wireless networks of the future are likely to be tiered, i.e., a heterogeneous mixture of overlaid networks that have different power, spectrum, hardware, coverage, mobility, complexity, and technology requirements. The focus of this dissertation is to improve the performance and increase the throughput of tiered networks with resource/interference management methods, node densification schemes, and transceiver designs; with their applications to advanced tiered network structures such as heterogeneous networks (i.e., picocells, femtocells, relay nodes, and distributed antenna systems), device-to-device (D2D) networks, and aeronautical communication networks (ACN). Over the last few decades, there has been an incredible increase in the demand for wireless services in various applications in the entire world. This increase leads to the emergence of a number of advanced wireless systems and networks whose common goal is to provide a very high data rate to countless users and applications. With the traditional macrocellular network architectures, it will be extremely challenging to meet such demand for high data rates in the upcoming years. Therefore, a mixture of different capability networks has started being built in a tiered manner. While the number and capabilities of networks are increasing to satisfy higher requirements; Modeling, managing, and maintaining the entire structure has become more challenging. The capacity of wireless networks has increased with various different advanced technologies/methodologies between 1950-2000 which can be summarized under three main titles: spectrum increase (x25), spectrum efficiency increase (x25), and network density (spectrum reuse) increase (x1600). It is vital to note that among different schemes, the most important gain is explored with increasing the reuse and adding more nodes/cells into the system, which will be the focus of this dissertation. Increasing the reuse by adding nodes into the network in an uncoordinated (irregular in terms of power, spectrum, hardware, coverage, mobility, complexity, and technology) manner brought up heterogeneity to the traditional wireless networks: multi-tier resource management problems in uncoordinated interference environments. In this study, we present novel resource/interference management methods, node densification schemes, and transceiver designs to improve the performance of tiered networks; and apply our methodologies to heterogeneous networks, D2D networks, and ACN. The focus and the contributions of this research involve the following perspectives: 1. Resource Management in Tiered Networks: Providing a fairness metric for tiered networks and developing spectrum allocation models for heterogeneous network structures. 2. Network Densification in Tiered Networks: Providing the signal to interference plus noise ratio (SINR) and transmit power distributions of D2D networks for network density selection criteria, and developing gateway scheduling algorithms for dense tiered networks. 3. Mobility in Tiered Networks: Investigation of mobility in a two-tier ACN, and providing novel transceiver structures for high data rate, high mobility ACN to mitigate the effect of Doppler.