Driven by the surging need for seamless connectivity, research in the wireless communication area has dramatically evolved over the years to meet the increasing demand for data rate and seamless coverage. Such evolvement concurs with a notable increase in data traffic and the widespread of data-hungry devices, thereby inflicting stringent requirements on terrestrial networks. Despite the tremendous advances achieved through the past generations of wireless systems, almost half of the world's population remains unconnected, leading to an accentuated digital divide problem. Therefore, this work invigorates a new connectivity solution that integrates aerial and terrestrial communications with a high-altitude platform station (HAPS) to promote a sustainable connectivity landscape. The connectivity solution adopted in this thesis specifically integrates terrestrial base stations with hot-air balloons under the framework of a cloud-enabled HAPS via a data-sharing fronthauling strategy. The aerial (hot-air balloons) and terrestrial base stations, grouped into disjoint clusters, coordinate their mutual transmission to serve aerial (i.e., drones) and terrestrial users. This work studies the downlink communication from the cloud-enabled HAPS to the aerial and terrestrial users under practical system considerations, namely the limited transmit power and the limited-capacity fronthaul link, per-base station. To this end, the first part of the thesis devises a specific optimization problem that maximizes the network sum-rate while accounting for system design constraints to determine the user association strategy, i.e., user to terrestrial clusters or user to air clusters, and the associated beamforming vectors. The second part of the thesis, then, designs a different resource allocations optimization problem that accounts for the fairness among the users, thus adopting a proportionally fair scheduling scheme to assign users on frequency tones to maximize the log of the long-term average rate. On this account, the work solves a handful of non-convex intricate optimization problems using techniques from optimization theory, namely, fractional programming and $\ell_0$-norm approximation. The work consequently outlines the gains realized by providing on-demand coverage in crowded and unserved areas. Moreover, the thesis illustrates the benefits of coordinating the operations of aerial and terrestrial base stations for interference management, load-balancing, and fairness measures.

Ce manuscrit est centré sur la conception, l'amélioration et l'évaluation des protocoles des couches RESEAU, MAC et PHY. En particulier, nous nous focalisons sur la conception de nouveaux protocoles distribués pour une utilisation optimale/améliorée des ressources radio disponibles. Par ailleurs, nous caractérisons les performances des réseaux ad hoc à accès aléatoire au canal en utilisant des paramètres de plusieurs couches avec aptitude de transfert d'information (data forwarding). La majeure partie de nos analyses se base sur le concept d'interaction entre les couches OSI (cross-layer). En effet, cette nouvelle et attractive approche est devenue en peu de temps omniprésente dans le domaine de recherche et développement et dans le domaine industriel. Les métriques de performances qui nous intéressent sont la stabilité des files d'attentes de transfert, le débit, le délai et la consommation d'énergie. Principalement, la compréhension de l'interaction entre les couches MAC/PHY et routage du standard IEEE 802.11e DCF/EDCF, d'une part, et l'interaction entre noeuds en terme d'interférences, d'autre part, constituent le coeur central de notre travail / The present dissertation deals with the problem of under-utilization of collision channels and other related problems in wireless networks. It deals with the design of random access protocols for wireless systems and provides a mathematical framework for performance evaluation of multihop based heterogeneous wireless networks. This thesis is divided into three parts. In the first part, we propose new versions of slotted aloha incorporating power control, priority and hierarchy. Our simulations were important to understand the behaviour of such a system and the real impact of involved parameters (transmit power, transmit rate, arrival rate, hierarchy order). Both team problem (common objective function is maximized) and game problem (each user maximizes its own objective) were discussed. Introducing hierarchy seems to provide many promising improvement without/or with a low amount of external information. We also proposed two distributed algorithms to learn the desired throughput. Next, we developed in the second part an analytical Framework to evaluate performances of multihop based heterogeneous Wireless networks. We built a cross-layer model and derived expression of stability, end-to-end throughput and end-to-end delay. Furthermore, we provided an accurate approximation for the distribution of end-to-end delay in multihop ad hoc networks (operating with slotted aloha protocol). As a direct application, we highlighted how streaming and conversational flows could be supported in this class of ubiquitous networks. The third part of this thesis is devoted to understanding and modelling of IEEE 802.11e DCF/EDCF-operated multihop ad hoc networks. We indeed built a complete and simple APPLICATION/NETWORK/MAC/PHY cross-layered model with finite retries per packet per flow. We analyzed the stability of forwarding queues and derived expression of end-to-end throughput. We finally proposed a Fountain code-based MAC layer to improve the throughput/fairness over the network

Heterogeneous wireless networking technologies such as satellite, UMTS, WiMax and WLAN are being used to provide network access for both voice and data services. In big cities, the densely populated areas like town centres, shopping centres and train stations may have coverage of multiple wireless networks. Traditional Radio Access Technology (RAT) selection algorithms are mainly based on the 'Always Best Connected' paradigm whereby the mobile nodes are always directed towards the available network which has the strongest and fastest link. Hence a large number of mobile users may be connected to the more common UMTS while the other networks like WiMax and WLAN would be underutilised, thereby creating an unbalanced load across these different wireless networks. This high variation among the load across different co-located networks may cause congestion on overloaded network leading to high call blocking and call dropping probabilities. This can be alleviated by moving mobile users from heavily loaded networks to least loaded networks. This thesis presents a novel framework for load balancing in heterogeneous wireless networks incorporating the IEEE 802.21 Media Independent Handover (MIH). The framework comprises of novel load-aware RAT selection techniques and novel network load balancing mechanism. Three new different load balancing algorithms i.e. baseline, fuzzy and neural-fuzzy algorithms have also been presented in this thesis that are used by the framework for efficient load balancing across the different co-located wireless networks. A simulation model developed in NS2 validates the performance of the proposed load balancing framework. Different attributes like load distribution in all wireless networks, handover latencies, packet drops, throughput at mobile nodes and network utilization have been observed to evaluate the effects of load balancing using different scenarios. The simulation results indicate that with load balancing the performance efficiency improves as the overloaded situation is avoided by load balancing.

In recent years, there has been a rapid growth in deployment and usage of realtime network applications, such as Voice-over-IP, video calls/video conferencing, live network seminars, and networked gaming. The continued increase in the popularity of realtime applications requires a more intense focus on the provision of strict guarantees for Quality of Service (QoS) parameters such as delay, jitter and packet loss in access networks. At the same time, wireless networking technologies have become increasingly popular with a wide array of devices such as laptop computers, Personal Digital Assistants (PDAs), and cellular phones being sold with built-in WiFi and WiMAX interfaces. For realtime applications to be popular over wireless networks, simple, robust and effective QoS mechanisms suited for a variety of heterogeneous wireless networks must be devised. Implementing the same QoS mechanisms across multiple neighbouring networks aids seamless handover by ensuring that a flow will be treated in the same way, both before and after handover. To provide guaranteed QoS, an access network should limit load using an admission control algorithm. In this research, we propose a method to provide effective admission control for variable bit rate realtime flows, based on the Central Limit Theorem. Our objective is to estimate the percentage of packets that will be delayed beyond a predefined delay threshold, based on the mean and variance of all the flows in the system. Any flow that will increase the percentage of delayed packets beyond an acceptable threshold can then be rejected. Using simulations we have shown that the proposed method provides a very effective control of the total system load, guaranteeing the QoS for a set of accepted flows with negligible reductions in the system throughput. To ensure that flow data is transmitted according to the QoS requirements of a flow, a scheduling algorithm must handle data intelligently. We propose methods to allow more efficient scheduling by utilising existing Medium Access Control mechanisms to exchange flow information. We also propose a method to determine the delay-dependent "value" of a packet based on the QoS requirements of the flow. Using this value in scheduling is shown to increase the number of packets sent before a predetermined deadline. We propose a measure of fairness in scheduling that is calculated according to how well each flow's QoS requirements are met. We then introduce a novel scheduling paradigm, Delay Loss Controlled-Earliest Deadline First (DLC-EDF), which is shown to provide better QoS for all flows compared to other scheduling mechanisms studied. We then study the performance of our admission control and scheduling methods working together, and propose a feedback mechanism that allows the admission control threshold to be tuned to maximise the efficient usage of available bandwidth in the network, while ensuring that the QoS requirements of all realtime flows are met. We also examine heterogeneous/vertical handover, providing an overview of the technologies supporting seamless handover. The issues studied in this area include a method of using the Signal to Noise Ratio to trigger handover in heterogeneous networks and QoS Mapping between heterogeneous networks. Our proposed method of QoS mapping establishes the minimum set of QoS parameters applicable to individual flows, and then maps these parameters into system parameter formats for both 802.11e and 802.16e networks.

Made available in DSpace on 2014-12-17T15:25:15Z (GMT). No. of bitstreams: 1 DiegoS_DISSERT.pdf: 2501564 bytes, checksum: 1ce0c357f86295afda264e5d574a9147 (MD5) Previous issue date: 2011-09-05 / Universidade Federal do Rio Grande do Norte / This work, from a perspective that thinks the space as a historical category, and especially as a relationship which stresses the role of objects, proposes an analysis of the construction of a Republican memory in the city of Natal in the early twentieth century. This research will focus mainly on two objects: the obelisk opened in 1917, and the Andre de Albuquerque Square on the occasion of the celebration of Frei Miguelinho?s death centenary and the paint Julgamento de Frei Miguelinho ordered by the State Government to the painter Antonio Parreiras, picture that was in the Sal?o Nobre do Pal?cio do Poder Executivo of that time. In a geral way this work intend to analyse the construction of this memory as well as the role of these objects in this process. To achieve that, we propose to trace ways and networks to follow the possible associations(between people, events, images, discourses, objects, institutios etc.) in the constitution of mutual belongings. Thus, our procedure was to follow these objects through the pathways in which they became possible, so that in the end we could defend the idea that they are active participants of the process that establish them. / O presente trabalho, partindo de uma perspectiva que pensa o espa?o como categoria hist?rica e, sobretudo, como rela??o na qual se destaca o papel dos objetos, visa propor uma an?lise do processo de constru??o de uma mem?ria republicana na cidade do Natal, no come?o do s?culo XX, a partir de dois objetos: o obelisco inaugurado em 1917, na Pra?a Andr? de Albuquerque, na ocasi?o das comemora??es do 1? centen?rio da morte de Frei Miguelinho; e o quadro intitulado Julgamento de Frei Miguelinho , encomendado pelo Governo do Estado ao pintor fluminense Ant?nio Parreiras, para figurar no Sal?o Nobre do Pal?cio do Poder Executivo de ent?o. A proposta mais geral ? a de analisar a constru??o dessa mem?ria a partir desses objetos ao mesmo tempo em que se tenta pensar o papel destes objetos na constru??o dessa mem?ria. Para tanto, nos propomos a tra?ar percursos nos quais fosse poss?vel estabelecer rela??es associativas (entre pessoas, eventos, imagens, discursos, objetos, institui??es etc.) que concorrem nesse processo, nesse caminho constitutivo de pertencimentos. Assim, o nosso procedimento foi o que acompanhar esses objetos atrav?s dos percursos dentro dos quais eles se tornaram poss?veis, para que ao fim pud?ssemos defender a ideia de que de que eles s?o participantes ativos dos processos que os instituem.

Français:La notion de réseaux hétérogènes correspond à l’intégration de plusieurs technologies de transmission de données sans-fil dans le but d’accroitre la qualité de service des communications dans les réseaux mobiles.Historiquement, les mécanismes de sécurité des réseaux mobiles et sans-fil ont été largement focalisés sur la protection d’équipement utilisateur au niveau du dernier saut de communication et sur base d’une connectivité simple et unique. Cette connectivité, réduite à sa plus simple expression, a restraint le développement des protocoles de sécurité à des protocoles bi-parties, qui couvrent l’authentification des équipements utilisateurs et le chiffrement sur des communicationsLes mécanismes de sécurité et de cryptographie ne sont donc pas suffisants pour protéger correctement et efficacement des connections parallèles ou leur mobilité au sein de réseaux hétérogènes. Le but de cette thèse de doctorat, à travers quatre contributions personnelles, est d’apporter de nouveaux mécanismes et protocoles de sécurité afin de protéger au mieux les réseaux hétérogènes:• La première contribution se focalise sur le développement d’une nouvelle primitive cryptographique pour la protection des transmissions sans-fil. La propriété principale de celle-ci est de protéger les trames en cas de capture. Cette primitive introduit, notamment, la notion de force brute probabiliste (ce qui veut dire qu’un attaquant ne peut pas choisir parmi différentes clés équiprobables laquelle est effectivement utilisée).• La seconde contribution propose un nouveau protocole pour gérer d’une manière sure et efficace la mobilité des équipements utilisateurs entre différentes technologies au sein de réseaux hétérogènes.• La troisième contribution couvre la gestion des clés maîtres des utilisateurs, embarqués au sein des cartes SIM, utilisées au sein des réseaux d’opérateurs mobiles. Nos protocoles et mécanismes automa- tisent des changements réguliers et sûrs de la clé maître, et ajoutent de la diversité dans la gestion des clés de sessions pour minimiser l’impact en cas de révélation de ces dernières (par le biais d’un vol de base de donnée, par exemple)• La quatrième contribution introduit un nouveau paradigme de connectivité pour les réseaux mo- biles basé sur des communications 1−à−n. Le paradigme redéfinit les frontières de sécurité et place l’équipement utilisateur au centre d’un groupe authentifié mobile. Par conséquent, le changement de paradigme mène à la création de nouveaux protocoles pour l’authentification, la gestion de la mo- bilité et la négociation protégées de clés afin de fournir une protection de bout en bout entre deux équipements utilisateurs ou plus. / English:Heterogeneous Networks (HetNets) is the integration of multiple wireless technologies to increase the quality of service of the communications in mobile networks. This evolution is the next generation of Public Land Mobile Networks (PLMNs).Mobile and wireless network security mechanisms have largely focused on the protection of the User Equipment (UE) within the last mile (the last hop of the communication in the chain of connected devices) and on single connections. The single connectivity has reduced the development of the security to two party protocols, and they cover the authentication of the UE to the mobile network and the encryption on a single channel based on homogeneous communications through a unique technology.The current security and cryptographic mechanisms are not sufficient to protect correctly, and efficiently, parallel connections or their mobility in HetNets. The purpose of the PhD Thesis is to bring new security protocols and mechanisms to protect HetNets.The contributions, that are brought by the thesis, follow the evolution of HetNets through 4 contributions by starting from the wireless transmissions to the largest frame of HetNets architecture:• The first contribution focuses on the development of an new cryptographic primitives for wireless transmissions. The main property is to protect the frame from eavesdropping. The primitive introduces the notion of probabilistic brute force (meaning that an attacker cannot decide among different keys which the used one).• The second contribution proposes a new protocol to manage efficiently and securely the mobility of the UEs between different technologies inside HetNets.• The third contribution covers the management of the master secrets, embedded within the Universal Subscriber Identity Module (USIM), in large PLMNs. Our mechanisms and protocols automate regular and secure changes of the master secret, and they add diversity in the management of session keys to minimize the impact of key leakages (in case of credential database theft, for instance).• The fourth contribution introduces a new connectivity paradigm for mobile networks based on one-to- many communications. The paradigm redesigns the security borders and puts the UE in the center of a mobile authenticated group. Therefore, the paradigm shift leads to new security protocols for authentication, mobility management, and secure negotiation to provide end-to-end encryption between two or more UEs. / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Abstract As mobile Internet access traffic continues to grow at an explosive rate and wireless networks continue to diverge into multiple access technologies with partly overlapping sets of features, new solutions for efficient use of these networks are vital. Cognitive network management provides tools to tackle this challenge by automatically learning from past experience the characteristics and usage patterns of the connected devices, thus enabling autonomic optimization of those connections. Cognitive network management requires a vast amount of information in order to function effectively, making collaboration of the networked devices essential as the best sources of information are scattered throughout the network. This makes efficient information dissemination one of the key enablers for autonomic networking. This dissertation studies managing control information related to autonomic selection of access networks and adapting services in a heterogeneous wireless network environment. It presents a solution to simple and efficient information dissemination in the form of Distributed Decision Engine— a CEP-like system enabling the building of a highly scalable and dynamic messaging system enabling dissemination, analysis and control of the complex series of interrelated events in the network. The dissertation also presents results showing a clear benefit in using cross-layer and cross-domain information in a modern wireless environment and validates the final prototype implementation of DDE with laboratory measurements. Effective use of disseminated cross-layer information is another key element in autonomic wireless networking. This dissertation also focuses on intelligent decision-making based on cross-layer information by presenting test results which attest that the performance of an autonomic wireless networking system can be improved by using cognitive techniques in its management algorithms, and that hierarchy and coordination can be utilized to minimize the effect of conflicting decisions of the system. / Tiivistelmä Mobiilin Internet-liikenteen räjähdysmäinen kasvu ja langattomien verkkojen jatkuva jakautuminen useisiin tekniikoihin vaativat uusia ratkaisuja näiden verkkojen tehokkaaseen käyttöön. Kognitiivinen verkon hallinta mahdollistaa oppimisen, minkä avulla laitteiden yhteyksiä voidaan optimoida autonomisesti aiemman kokemuksen perusteella. Tällainen optimointi vaatii kuitenkin valtavan määrän verkosta ja laitteista kerättyä tietoa, mikä tekee tehokkaasta tiedonjakelusta keskeisen elementin autonomisessa verkon hallinnassa. Tässä väitöskirjassa tutkitaan verkon valintaan ja palveluiden sopeuttamiseen vaadittavan tiedon välittämistä ja hallintaa autonomisissa langattomissa verkoissa. Ratkaisuna yksinkertaiseen ja tehokkaaseen tiedonvälitykseen esitellään hajautettu Distributed Decision Engine -komponentti, joka mahdollistaa skaalautuvan tiedon jakelu-, analysointi- ja hallintajärjestelmän rakentamisen. Lisäksi väitöskirjassa kuvataan myös tuloksia, jotka osoittavat, että verkkokerrosten välisen tiedon käyttämisellä voidaan saavuttaa selvää etua, sekä tuloksia, jotka vahvistavat DDE-prototyyppitoteutuksen toimivuuden laboratoriomittauksin. Verkkokerrosten välisen tiedon tehokas hyödyntäminen on toinen keskeinen tekijä autonomisessa langattomien verkkojen hallinnassa. Väitöskirjassa käsitellään myös älykästä päätöksentekoa kyseisen informaation pohjalta sekä esitellään tuloksia, jotka osoittavat, että päätöksentekoa autonomisessa langattomien verkkojen hallinnassa voidaan parantaa kognitiivisilla tekniikoilla. Lisäksi esitetyt tulokset osoittavat, että hierarkialla sekä koordinoinnilla voidaan minimoida ristiriitaisten päätösten vaikutukset järjestelmään.

L'un des challenges le plus important pour les opérateurs des réseaux mobiles est de dimensionner le réseau de la manière la plus efficace possible, c'est-à-dire, bien planifier les ressources pour fournir une bonne couverture et une meilleure capacité. Afin de mieux gérer le trafic généré dans le réseau, les opérateurs déploient des petites cellules pour aider les macro-cellules à délester les zones de la cellule où le trafic de données est significativement supérieur au trafic moyen dans la cellule. Cependant, le problème majeur de ces réseaux hétérogènes consiste à bien localiser ces hotspots et puis de mettre en place la meilleure solution pour les absorber. Dans cette thèse, on traite le sujet de localisation de hotspot et on étudie l'impact de son imperfection sur les performances des déploiements des réseaux hétérogènes. Dans une première étape, on propose une nouvelle méthode de localisation de hotspot. Puis, on propose d'évaluer l'impact d'une mauvaise localisation de trafic sur le déploiement des petites cellules à travers une analyse de performances au niveau statique et dynamique. Sachant qu'une grande quantité de trafic de données dans le réseau mobile est générée par des utilisateurs qui sont en mouvement, on propose d'évaluer les performances des petites cellules mobiles. Enfin, la quatrième étape consiste à améliorer encore la solution de déploiement de petites cellules en utilisant les drones. On propose un mécanisme de décongestion du réseau et on discute les avantages et les points à explorer. Une analyse de performance est aussi réalisée pour comparer cette solution avec les solutions classiques de macro cellules et de petites cellules / The continuous increasing traffic in cellular networks has forced the mobile operators to look for efficient and viable options to manage their networks so as to ensure more efficiency over the network life cycle while also evolving with the implementation of new technologies. Traffic hotspot localization can help operators to identify the areas where deploying small cells can reduce the congestion. We firstly propose and assess a new traffic hotspot localization method based on the projection of O&M KPIs on the coverage map. Compared to probing methods, the computational costs and the equipment expenditures are reduced. Moreover, the localization accuracy is improved. Next, in order to evaluate the impact of the limited accuracy of traffic localization tools on small cell deployment, we study the performances of three different scenarios. The first one considers a network of macrocells only and represents a benchmark to decide about the usefulness of small cells. The second one is based on a network of macrocells with a perfectly deployed small cell allowing to identify the limitations of small cell deployment and the last one is with an imperfectly deployed small cell. Realizing that a significant amount of cellular demand is generated on the go and suffers deteriorating quality, we investigate the potential performance gains of using moving small cells. The major outcome is to understand if moving cells leverage the relative operators' investments. Finally, we propose a new mobile data offloading mechanism which capitalizes on drone small cells to alleviate the data traffic load. We realize a performance evaluation and comparison with classic small cell deployment

Heterogeneous wireless networking technologies such as satellite, UMTS, WiMax and WLAN are being used to provide network access for both voice and data services. In big cities, the densely populated areas like town centres, shopping centres and train stations may have coverage of multiple wireless networks. Traditional Radio Access Technology (RAT) selection algorithms are mainly based on the ¿Always Best Connected¿ paradigm whereby the mobile nodes are always directed towards the available network which has the strongest and fastest link. Hence a large number of mobile users may be connected to the more common UMTS while the other networks like WiMax and WLAN would be underutilised, thereby creating an unbalanced load across these different wireless networks. This high variation among the load across different co-located networks may cause congestion on overloaded network leading to high call blocking and call dropping probabilities. This can be alleviated by moving mobile users from heavily loaded networks to least loaded networks. This thesis presents a novel framework for load balancing in heterogeneous wireless networks incorporating the IEEE 802.21 Media Independent Handover (MIH). The framework comprises of novel load-aware RAT selection techniques and novel network load balancing mechanism. Three new different load balancing algorithms i.e. baseline, fuzzy and neural-fuzzy algorithms have also been presented in this thesis that are used by the framework for efficient load balancing across the different co-located wireless networks. A simulation model developed in NS2 validates the performance of the proposed load balancing framework. Different attributes like load distribution in all wireless networks, handover latencies, packet drops, throughput at mobile nodes and network utilization have been observed to evaluate the effects of load balancing using different scenarios. The simulation results indicate that with load balancing the performance efficiency improves as the overloaded situation is avoided by load balancing.

Design trade-offs between estimation performance, processing delay and communication cost for a sensor scheduling problem is discussed. We consider a heterogeneous sensor network with two types of sensors: the first type has low-quality measurements, small processing delay and a light communication cost, while the second type is of high quality, but imposes a large processing delay and a high communication cost. Such a heterogeneous sensor network is common in applications, where for instance in a localization system the poor sensor can be an ultrasound sensor while the more powerful sensor can be a camera. Using a time-periodic Kalman filter, we show how one can find an optimal schedule of the sensor communication. One can significantly improve estimation quality by only using the expensive sensor rarely. We also demonstrate how simple sensor switching rules based on the Riccati equation drives the filter into a stable time-periodic Kalman filter. ￜ 2008 IEEE. / <p>QC 20110224</p>