<p>    </p> <p>In order to advance next-generation communication systems, it is critical to enhance the state-of-the-art communication architectures, such as device-to-device (D2D), multiple- input multiple-output (MIMO), and intelligent reflecting surface (IRS), in terms of achieving high data rate, low latency, and high energy efficiency. In the first part of this dissertation, we address joint learning and optimization methodologies on cutting-edge network archi- tectures. First, we consider D2D networks equipped with MIMO systems. In particular, we address the problem of minimizing the network overhead in D2D networks, defined as the sum of time and energy required for processing tasks at devices, through the design for MIMO beamforming and communication/computation resource allocation. Second, we address IRS-assisted communication systems. Specifically, we study an adaptive IRS control scheme considering realistic IRS reflection behavior and channel environments, and propose a novel adaptive codebook-based limited feedback protocol and learning-based solutions for codebook updates. </p> <p><br></p> <p>Furthermore, in order for revolutionary innovations to emerge for future generations of communications, it is crucial to explore and address fundamental, long-standing open problems for communications, such as the design of practical codes for a variety of important channel models. In the later part of this dissertation, we study the design of practical codes for feedback-enabled communication channels, i.e., feedback codes. The existing feedback codes, which have been developed over the past six decades, have been demonstrated to be vulnerable to high forward/feedback noises, due to the non-triviality of the design of feedback codes. We propose a novel recurrent neural network (RNN) autoencoder-based architecture to mitigate the susceptibility to high channel noises by incorporating domain knowledge into the design of the deep learning architecture. Using this architecture, we suggest a new class of non-linear feedback codes that increase robustness to forward/feedback noise in additive White Gaussian noise (AWGN) channels with feedback. </p>

The Internet of things (IoT) recently blossomed remarkably and has been transforming the everyday physical entities around us into an ecosystem of information that will enrich our lives in unimaginable ways. Authentication is one of the primary goals of security in the IoT and acts as the main gateway to a secure system which transmits confidential and/or private data.This thesis focuses on a Device-to-Device Mutual Authentication Protocol, designed for the smart home network, which is an essential component of communication in the Internet of Things(IoT). The protocol has been developed based on asymmetric cryptography to authenticate the devices in the network and for the devices to agree on a shared secret session key. In order to ensure the security of a communications session between the devices, the session keys are changed frequently - ideally after every communication session. The proposed scheme has been programmed in HLPSL, simulated and its efficiency verified using the SPAN/ AVISPA tool. When SPAN substantiates the protocol simulation and the attacker simulation, the back-ends of the AVISPA tool verifies the safety and security of the proposed authentication protocol. The thesis also evaluates the protocol's security against the attacks successful against protocols proposed by other researchers. / Graduate / 0544 / 0984 / 0537 / pwilson1@uvic.ca

Benefiting from the constant and significant advancement of wireless communication technologies and networking protocols, Wireless Ad hoc NETwork (WANET) has played a more and more important role in modern communication networks without relying much on existing infrastructures. The past decades have seen numerous applications adopting ad hoc networks for service provisioning. For example, Wireless Sensor Network (WSN) can be widely deployed for environment monitoring and object tracking by utilizing low-cost, low-power and multi-function sensor nodes. To realize such applications, the design and evaluation of communication protocols are of significant importance. Meanwhile, the network performance analysis based on mathematical models is also in great need of development and improvement. This dissertation investigates the above topics from three important and fundamental aspects, including data collection protocol design, protocol modeling and analysis, and physical interference modeling and analysis. The contributions of this dissertation are four-fold. First, this dissertation investigates the synchronization issue in the duty-cycled, pipelined-scheduling data collection of a WSN, based on which a pipelined data collection protocol, called PDC, is proposed. PDC takes into account both the pipelined data collection and the underlying schedule synchronization over duty-cycled radios practically and comprehensively. It integrates all its components in a natural and seamless way to simplify the protocol implementation and to achieve a high energy efficiency and low packet delivery latency. Based on PDC, an Adaptive Data Collection (ADC) protocol is further proposed to achieve dynamic duty-cycling and free addressing, which can improve network heterogeneity, load adaptivity, and energy efficiency. Both PDC and ADC have been implemented in a pioneer open-source operating system for the Internet of Things, and evaluated through a testbed built based on two hardware platforms, as well as through emulations. Second, Linear Sensor Network (LSN) has attracted increasing attention due to the vast requirements on the monitoring and surveillance of a structure or area with a linear topology. Being aware that, for LSN, there is few work on the network modeling and analysis based on a duty-cycled MAC protocol, this dissertation proposes a framework for modeling and analyzing a class of duty-cycled, multi-hop data collection protocols for LSNs. With the model, the dissertation thoroughly investigates the PDC performance in an LSN, considering both saturated and unsaturated scenarios, with and without retransmission. Extensive OPNET simulations have been carried out to validate the accuracy of the model. Third, in the design and modeling of PDC above, the transmission and interference ranges are defined for successful communications between a pair of nodes. It does not consider the cumulative interference from the transmitters which are out of the contention range of a receiver. Since most performance metrics in wireless networks, such as outage probability, link capacity, etc., are nonlinear functions of the distances among communicating, relaying, and interfering nodes, a physical interference model based on distance is definitely needed in quantifying these metrics. Such quantifications eventually involve the Nodal Distance Distribution (NDD) intrinsically depending on network coverage and nodal spatial distribution. By extending a tool in integral geometry and using decomposition and recursion, this dissertation proposes a systematic and algorithmic approach to obtaining the NDD between two nodes which are uniformly distributed at random in an arbitrarily-shaped network. Fourth, with the proposed approach to NDDs, the dissertation presents a physical interference model framework to analyze the cumulative interference and link outage probability for an LSN running the PDC protocol. The framework is further applied to analyze 2D networks, i.e., ad hoc Device-to-Device (D2D) communications underlaying cellular networks, where the cumulative interference and link outage probabilities for both cellular and D2D communications are thoroughly investigated. / Graduate / 0984 / 0544 / tong1987fei@163.com

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Over the last years, the wireless broadband access has achieved a tremendous success. With that, the telecommunications industry has faced very important changes in terms of technology, heterogeneity, kind of applications, and massive usage (virtual data tsunami) derived from the introduction of smartphones and tablets; or even in terms of market structure and its main players/actors. Nonetheless, it is well-known that the electromagnetic spectrum is a scarce resource, being already fully occupied (or at least reserved for certain applications). Tra- ditional spectrum markets (where big monopolies dominate) and static spectrum management originated a paradoxal situation: the spectrum is occupied without actually being used! In one hand, with the global transition from analog to digital Television (TV), part of the spectrum previously licensed for TV is freed and geographically interleaved, originating the consequent Television White Spaces (TVWS); on the other hand, the direct communications between devices, commonly referred as Device-to-Device (D2D) communications, are attracting crescent attention by the scientific community and industry in order to overcome the scarcity problem and satisfy the increasing demand for extra capacity. As such, this thesis is divided in two main parts: (a) Spectrum market for TVWS: where a SWOT analysis for the use of TVWS is performed giving some highlights in the directions/actions that shall be followed so that its adoption becomes effective; and a tecno-economic evaluation study is done considering as a use-case a typical European city, showing the potential money savings that operators may reach if they adopt by the use of TVWS in a flexible market manner; (b) D2D communications: where a neighbor discovery technique for D2D communications is proposed in the single-cell scenario and further extended for the multi-cell case; and an interference mitigation algorithm based on the intelligent selection of Downlink (DL) or Uplink (UL) band for D2D communications underlaying cellular networks. A summary of the principal conclusions is as follows: (a) The TVWS defenders shall focus on the promotion of a real-time secondary spectrum market, where through the correct implementation of policies for protection ratios in the spectrum broker and geo-location database, incumbents are protected against interference; (b) It became evident that an operator would recover its investment around one year earlier if it chooses to deploy the network following a flexible spectrum market approach with an additional TVWS carrier, instead of the traditional market; (c) With the proposed neighbor discovery technique the time to detect all neighbors per Mobile Station (MS) is significantly reduced, letting more time for the actual data transmission; and the power of MS consumed during the discovery process is also reduced because the main processing is done at the Base Station (BS), while the MS needs to ensure that D2D communication is possible just before the session establishment; (d) Despite being a simple concept, band selection improves the gains of cellular communications and limits the gains of D2D communications, regardless the position within the cell where D2D communications happen, providing a trade-off between system performance and interference mitigation. / Nos Ãltimos anos, o acesso de banda larga atingiu um grande sucesso. Com isso, a indÃstria das telecomunicaÃÃes passou por importantes transformaÃÃes em termos de tecnologia, heterogeneidade, tipo de aplicaÃÃes e uso massivo (tsunami virtual de dados) em consequÃncia da introduÃÃo dos smartphones e tablets; ou atà mesmo na estrutura de mercado e os seus principais jogadores/atores. PorÃm, à sabido que o espectro electromagnÃtico à um recurso limitado, estando jà ocupado (ou pelo menos reservado para alguma aplicaÃÃo). O mercado tradicional de espectro (onde os grandes monopÃlios dominam) e o seu gerenciamento estÃtico contribuÃram para essa situaÃÃo paradoxal: o espectro està ocupado mas nÃo està sendo usado! Por um lado, com a transiÃÃo mundial da TelevisÃo (TV) analÃgica para a digital, parte do espectro anteriormente licenciado para a TV à libertado e geograficamente multiplexado para evitar a interferÃncia entre sinais de torres vizinhas, dando origem a ÂespaÃos em branco na frequÃncia da TV ou Television White Spaces (TVWS); por outro lado, as comunicaÃÃes diretas entre usuÃrios, designadas por comunicaÃÃes diretas Dispositivo-a-Dispositivo (D2D), està gerando um crescente interesse da comunidade cientÃfica e indÃstria, com vista a ultrapassar o problema da escassez de espectro e satisfazer a crescente demanda por capacidade extra. Assim, a tese està dividida em duas partes principais: (a) Mercado de espectro eletromagnÃtico para TVWS: onde à feita uma anÃlise SWOT para o uso dos TVWS, dando direÃÃes/aÃÃes a serem seguidas para que o seu uso se torne efetivo; e um estudo tecno-econÃmico considerando como cenÃrio uma tÃpica cidade Europeia, onde se mostram as possÃveis poupanÃas monetÃrias que os operadores conseguem obter ao optarem pelo uso dos TVWS num mercado flexÃvel; (b) ComunicaÃÃes D2D: onde uma tÃcnica de descoberta de vizinhos para comunicaÃÃes D2D à proposta, primeiro para uma Ãnica cÃlula e mais tarde estendida para o cenÃrio multi-celular; e um algoritmo de mitigaÃÃo de interferÃncia baseado na seleÃÃo inteligente da banda Ascendente (DL) ou Descendente (UL) a ser reusada pelas comunicaÃÃes D2D que acontecem na rede celular. Um sumÃrio das principais conclusÃes à o seguinte: (a) Os defensores dos TVWS devem-se focar na promoÃÃo do mercado secundÃrio de espectro electromagnÃtico, onde atravÃs da correta implementaÃÃo de politicas de proteÃÃo contra a interferÃncia no broker de espectro e na base de dados, os usuÃrios primÃrio sÃo protegidos contra a interferÃncia; (b) Um operador consegue recuperar o seu investimento aproximadamente um ano antes se ele optar pelo desenvolvimento da rede seguindo um mercado secundÃrio de espectro com a banda adicional de TVWS, em vez do mercado tradicional; (c) Com a tÃcnica proposta de descoberta de vizinhos, o tempo de descoberta por usuÃrio à significativamente reduzido; e a potÃncia consumida nesse processo à tambÃm ela reduzida porque o maior processamento à feito na EstaÃÃo RÃdio Base (BS), enquanto que o usuÃrio sà precisa de se certificar que a comunicaÃÃo direta à possÃvel; (d) A seleÃÃo de banda, embora seja um conceito simples, melhora os ganhos das comunicaÃÃes celulares e limita os das comunicaÃÃes D2D, providenciando um compromisso entre a performance do sistema e a mitigaÃÃo de interferÃncia.

We study Social Groups consisting of self-interested inter-connected nodes looking for common content. We can observe Social Groups in various socio-technological networks, such as Cellular Network assisted Device-to-Device communications, Cloud assisted Peer-to-Peer Networks, hybrid Peer-to-Peer Content Distribution Networks and Direct Connect Networks. Each node wants to acquire a universe of segments at least cost. Nodes can either access an expensive link to the content distributor for downloading data segments, or use the well-connected low cost inter-node network for exchanging segments among themselves. Activation of an inter-node link requires cooperation among the participating nodes and reduces the cost of downloading for the nodes. However, due to uploading costs, Non-Reciprocating Nodes are reluctant to upload segments, in spite of their interest in downloading segments from others. We define the Give-and-Take (GT) criterion, which prohibits non-reciprocating behaviour in Social Groups for all nodes at all instants. In the “Full Exchange” case studied, two nodes can exchange copies of their entire segment sets, if each node gains at least one new segment from the other. Incorporating the GT criterion in the Social Group, we study the problem of downloading the universe at least cost, from the perspective of a new node having no data segments. We analyze this NP-hard problem, and propose algorithms for choosing the initial segments to be downloaded from the content distributor and the sequence of nodes for exchange. We compare the performance of these algorithms with a few existing P2P downloading strategies in terms of cost and running time. In the second problem, we attempt to reduce the load on the content distributor by choosing a schedule of inter-node link activations such that the number of nodes with the universe is maximized. Link activation decisions are taken by a central entity, the facilitator, for achieving the social optimum. We present the asymptotically optimal Randomized algorithm. We also present other algorithms, such as the Greedy Links algorithm and the Polygon algorithm, which are optimal under special scenarios of interest. We compare the performances of all proposed algorithms with the optimal value of the objective. We observe that computationally intensive algorithms exhibit better performance. Further, we consider the problem of decentralized scheduling of links. The decisions of link activations are made by the participating nodes in a distributed manner. While conforming to the GT criterion for inter-node exchanges, each node's objective is to maximize its utility. Each node tries to find a pairing partner by preferentially exploring nodes for link formation. Unpaired nodes choose to download a segment using the expensive link with Segment Aggressiveness Probability (SAP). We present linear complexity decentralized algorithms for nodes to choose their best strategy. We present a decentralized randomized algorithm that works in the absence of the facilitator and performs close to optimal for large number of nodes. We define the Price of Choice to benchmark performance of Social Groups (consisting of non-aggressive nodes) with the optimal. We evaluate the performance of various algorithms and characterize the behavioural regime that will yield best results for node and Social Group as well.

Předkládaná disertační práce je zaměřena na "heterogenní propojení mobilních zařízení v bezdrátových systémech 5. generace". Navzdory nepochybnému pokroku v rámci navržených komunikačních řešení postrádají mobilní sítě nastupující generace dostatečnou šířku pásma a to hlavně kvůli neefektivnímu využívání rádiového spektra. Tato situace tedy v současné době představuje řadu otázek v oblasti výzkumu. Hlavním cílem této disertační práce je proto návrh nových komunikačních mechanismů pro komunikaci mezi zařízeními v bezprostřední blízkosti s asistencí mobilní sítě a dále pak návrh a implementace algoritmů pro dynamické přidělování frekvenčního spektra v nastupujících mobilních sítích 5G. Navrhnuté komunikační mechanismy a algoritmy jsou následně komplexně vyhodnoceny pomocí nově vyvinutých simulačních nástrojů (kalibrovaných s využitím 3GPP trénovacích dat) a zejména pak v experimentální mobilní síti LTE-A, která se nachází v prostorách Vysokého učení technického v Brně, Česká Republika. Získané praktické výsledky, které jsou podpořeny zcela novou matematickou analýzou ve speciálně navržených charakteristických scénářích, představují řešení pro vlastníka spektra v případě požadavků na jeho dynamické sdílení. Tato metoda tedy představuje možnost pro efektivnější využití spektra v rámci mobilních sítí 5G bez degradace kvality služeb (QoS) a kvality zážitků (QoE) pro koncové uživatele. Vědecký přínos dosažených výsledků dokazuje fakt, že některé z principů představených v této disertační práci byly zahrnuty do celosvětově uznávaného standardu (specifikace) 3GPP Release 12.

La recherche dans les réseaux de communication cherche à améliorer la capacité et les performances des technologies de réseaux tout en satisfaisant à la fois la demande croissante d’instantanéité des accès et des échanges d’information. Par exemple, les travaux sur les systèmes sans-fil de cinquième génération (5G) visent à augmenter le débit de données et l’efficacité spectrale mais aussi à réduire la latence et la consommation d’énergie. Dans ce contexte, la mise en réseau basée sur la proximité est envisagée afin d’améliorer l’échange d’information entre périphériques proches, même dans le cas où aucune infrastructure n’est disponible. Une composante essentielle de ces solutions est la capacité de rapidement détecter (ou découvrir) les autres systèmes à proximité. Bien que l’utilisation de la découverte des systèmes et de services ne soit pas à proprement parler une nouveauté dans les réseaux, son adoption dans les réseaux sans-fil a augmenté l’importance et la pertinence de ce type de mécanismes. Par conséquence, l’objectif de cette thèse est d’optimiser les performances du processus de découverte en utilisant des mécanismes contextuels. Dans un premier temps, nous commençons par une description préliminaire des défis auxquels sont confrontés les utilisateurs du réseau et comment les solutions actuelles (c’est-à-dire Long Term Evolution (LTE)) ne peuvent pas couvrir leurs besoins. Dans un deuxième temps, nous présentons l’architecture utilisée pour évaluer nos propositions: l’architecture appareil-à-appareil (D2D) qui est définie par le programme de partenariat de troisième génération (3GPP) pour être utilisée dans les réseaux LTE. Nous mettrons tout particulièrement l’accent sur la description du processus de découverte tel qu’il est défini dans les spécifications. Finalement, nous présentons une étude analytique, avec un modèle de mise en oeuvre pour tester et valider les performances de la découverte directe. En utilisant cette analyse, nous proposons un algorithme de transmission adaptatif qui optimise le processus de découverte pour les topologies statiques. Cette contribution sert de base à des algorithmes étendus et améliorés ciblant premièrement des scénarios où la disponibilité de données historiques permet de prédire les fluctuations de la densité des utilisateurs, et deuxièmement des situations entièrement dynamiques sans infrastructure ou support externe, montrant comment les mécanismes contextuels peuvent fournir des performances presque optimales. Toutes ces contributions et ces analyses sont supportées et validées par des modèles de simulation et des expériences qui montrent l’importance et l’exactitude de nos propositions dans l’optimisation de la performance et de la fiabilité dans le cadre de la découverte directe / Research in communication networks aims to improve the capabilities and performance of network technologies, and to satisfy the ever increasing demand for instant information access and exchange. For example, work on Fifth Generation (5G) Wireless Systems aims to increase data rates and spectral efficiency while lowering latency and energy consumption. Within this context, proximity-based networking is being considered in order to improve the data sharing between nearby devices, regardless of the availability of additional infrastructure. An integral component of these solutions is the ability to quickly detect (or discover) other systems in the vicinity. While system and service discovery has been a concept used in networks for some time, its adoption by wireless networks has increased the importance and relevance of this type of mechanisms. Therefore, the goal of this thesis is to optimize the performance of the discovery process by using context-aware mechanisms. First, we start by an introductory description of the challenges faced by network users and how current solutions (i.e. Long Term Evolution (LTE)) are unable to cover their needs. Second, we present the architecture we will use to evaluate our proposals, namely the device-to-device (D2D) architecture defined by the Third-Generation Partnership Program (3GPP) for use in LTE networks, with an emphasis on the description of the discovery process as defined in the standard specifications. Then, we present an analytical study, along with an implementation model to test and validate the performance of direct discovery. Building upon that analysis, we propose an adaptive transmission algorithm that optimizes the discovery process for static topologies. This contribution is used as the foundation for extended and enhanced algorithms targeting scenarios where the availability of historic data allows for predicting user density fluctuations, and fully dynamic situations without external infrastructure or support, showing how context-aware mechanisms can provide almost optimal performance. All these contributions and analysis are supported and validated by simulation models and experiments that showcase the importance and correctness of our proposals in the optimization of the performance and reliability in D2D direct discovery

Cette thèse étudie les communications directes entre les mobiles, appelées communications D2D, en tant que technique prometteuse pour améliorer les futurs réseaux cellulaires. Cette technologie permet une communication directe entre deux terminaux mobiles sans passer par la station de base. La modélisation, l'évaluation et l'optimisation des différents aspects des communications D2D constituent les objectifs fondamentaux de cette thèse et sont réalisés principalement à l'aide des outils mathématiques suivants: la théorie des files d'attente, l'optimisation de Lyapunov et les processus de décision markovien partiellement observable POMDP. Les résultats de cette étude sont présentés en trois parties. Dans la première partie, nous étudions un schéma de sélection entre mode cellulaire et mode D2D. Nous dérivons les régions de stabilité des scénarios suivants: réseaux cellulaires purs et réseaux cellulaires où les communications D2D sont activées. Une comparaison entre ces deux scénarios conduit à l'élaboration d'un algorithme de sélection entre le mode cellulaire et le mode D2D qui permet d'améliorer la capacité du réseau. Dans la deuxième partie, nous développons un algorithme d'allocation de ressources des communications D2D. Les utilisateurs D2D sont en mesure d'estimer leur propre qualité de canal, cependant la station de base a besoin de recevoir des messages de signalisation pour acquérir cette information. Sur la base de cette connaissance disponibles au niveau des utilisateurs D2D, une approche d'allocation des ressources est proposée afin d'améliorer l'efficacité énergétique des communications D2D. La version distribuée de cet algorithme s'avère plus performante que celle centralisée. Dans le schéma distribué des collisions peuvent se produire durant la transmission de l'état des canaux D2D ; ainsi un algorithme de réduction des collisions est élaboré. En outre, la mise en œuvre des algorithmes centralisé et distribué dans un réseau cellulaire, type LTE, est décrite en détails. Dans la troisième partie, nous étudions une politique de sélection des relais D2D mobiles. La mobilité des relais représente un des principaux défis que rencontre toute stratégie de sélection de relais. Le problème est modélisé par un processus contraint de décision markovien partiellement observable qui prend en compte le dynamisme des relais et vise à trouver la politique de sélection de relais qui optimise la performance du réseau cellulaire sous des contraintes de coût. / This thesis considers Device-to-Device (D2D) communications as a promising technique for enhancing future cellular networks. Modeling, evaluating and optimizing D2D features are the fundamental goals of this thesis and are mainly achieved using the following mathematical tools: queuing theory, Lyapunov optimization and Partially Observed Markov Decision Process (POMDP). The findings of this study are presented in three parts. In the first part, we investigate a D2D mode selection scheme. We derive the queuing stability regions of both scenarios: pure cellular networks and D2D-enabled cellular networks. Comparing both scenarios leads us to elaborate a D2D vs cellular mode selection design that improves the capacity of the network. In the second part, we develop a D2D resource allocation algorithm. We observe that D2D users are able to estimate their local Channel State Information (CSI), however the base station needs some signaling exchange to acquire this information. Based on the D2D users' knowledge of their local CSI, we provide an energy efficient resource allocation framework that shows how distributed scheduling outperforms centralized one. In the distributed approach, collisions may occur between the different CSI reporting; thus, we propose a collision reduction algorithm. Moreover, we give a detailed description on how both centralized and distributed algorithms can be implemented in practice. In the third part, we propose a mobile relay selection policy in a D2D relay-aided network. Relays' mobility appears as a crucial challenge for defining the strategy of selecting the optimal D2D relays. The problem is formulated as a constrained POMDP which captures the dynamism of the relays and aims to find the optimal relay selection policy that maximizes the performance of the network under cost constraints.