Les réseaux de capteurs sans-fil sont composés de dispositifs électroniques conçus pour mesurer une grandeur physique de l’environnement dans lequel ils sont déployés et pour acheminer ces mesures à un système d’information. Dans nos travaux, nous étudions les architectures de réseau et les protocoles de communication associés afin de déterminer les configurations adéquates à un scénario de réseau de capteurs pour la Ville Intelligente. Après avoir recensé les applications et leurs exigences de Qualité de Service attendue, nous avons construit des modèles analytiques permettant de comparer les différentes familles de protocoles MAC en terme de taux de livraison et de consommation d’énergie. Ces travaux permettent ainsi de motiver le choix d’un protocole synchrone ou asynchrone, à contention ou à accès direct, en fonction du scénario applicatif et du déploiement de réseau considéré : longue portée ou multi-sauts. Sur la base des résultats de cette étude, nous proposons ensuite un ensemble d’optimisation des protocoles de communication permettant d’améliorer la Qualité de Service et la dépense énergétique des compteurs. Nous proposons une méthode d’accès au médium de communication permettant l’allocation de plusieurs instants de transmission en une phase unique de tournoi. Cette optimisation vise à réduire le pôle de consommation majoritaire des réseaux multi-sauts, tel qu’identifié dans l’étude précédente. Le protocole résultant, CT-MAC, résout l’allocation de plusieurs instants de transmission en une unique phase de compétition et de manière distribuée. CT-MAC réduit ainsi la consommation d’énergie de l’arbitrage du médium. Nous proposons ensuite un mécanisme de relayage adaptatif pour l’architecture de réseau longue-portée. Le protocole, nommé SARI-MAC, est conçu de manière à pallier aux ‘trous’ de couverture que présentent les systèmes radio longue-portée lorsqu’ils sont déployés dans un habitat urbain dense. Pour cela, SARI-MAC propose d’exploiter certains nœuds du réseau, choisis pour leurs ressources en énergie, en tant que relais pour leurs voisins dont le bilan radio est insuffisant pour respecter les exigences de Qualité de Service de l’application. SARI-MAC est un protocole MAC asynchrone, initié récepteur dont les paramètres s’adaptent automatiquement aux conditions de trafic et aux contraintes de cycle d’activité imposées par la durée de vie souhaitée des nœuds capteurs et par la législation. Finalement, nous proposons un schéma de routage opportuniste appelé QOR. QOR est un protocole de routage qui tire profit des liens radio longue portée, opportunistes afin d’améliorer la fiabilité et la latence des transmissions de données dans un réseau de collecte. Pour cela, QOR propose une structure de routage combinée à un schéma d’adressage permettant d’identifier un ensemble de nœuds relais entre une source et la passerelle de collecte. / Wireless Sensors are small electronic devices made for measuring physical properties of their environment and communicating them wirelessly to an information system. In this thesis, we study existing network architectures and to devise the best-suited configuration for typical urban wireless Sensor Network use-cases. To that effect, we provide comprehensive analytical models to compare the different families of MAC protocols in terms of Delivery Rate and Energy Consumption, e.g. synchronous vs asynchronous, contention-based vs direct access etc. Headlines results a mathematical framework to devise the least energy-cost contention algorithm for a given Delivery Rate and closed-form expressions of the Energy Consumption and Delivery Rate for popular access control protocols. These results are then synthesised in a comparison study of the two prevailing urban sensors network architectures, i.e. long-range and multihop. We show that long-range sensor networks are best-suited for low-traffic and sparser network topologies while higher traffic loads and denser network topologies demand switching to a multihop network operating a synchronous MAC protocol on higher bitrate radios. Based on the analysis of the architectures best suited for each use-case scenario, i.e. low traffic loads/sparse network and high traffic loads/dense network, we identify suitable optimisations to improve the QoS performance and energy efficiency of said architectures. First, we improve on the energy efficiency of the arbitration of the medium access by defining a cascading tournament contention algorithm. This protocol, CT-MAC, resolves multiple timeslots allocation in a single, energy efficient contention tournament. Second, we propose an adaptive relaying scheme for the long-range network architecture named SARI-MAC. This scheme is an attempt to cope with coverage holes that occurs when using long-range in a dense urban habitat by letting sensor nodes relay communications of nodes whose link budgets are incompatible with the QoS requirements of the network. To that effect, we propose a receiver-initiated MAC protocol that self-adapts to the traffic condition so that the duty-cycle of relayers is kept as low as possible with respect to the load of frames to relay. Finally, we propose an opportunistic relaying scheme named QOR. QOR is a routing protocol that exploits long-range, opportunistic radio links to provide faster and more reliable transmissions. To that effect, QOR proposes a joint routing structure and addressing scheme that allows identifying a limited set of nodes than can become opportunistic relayers between a source sensor and the sink. Those nodes then follow an original cascaded acknowledgement mechanism that brings reliable acknowledgment and ensures a replication-free forwarding of the data frames.

Orientador: Akebo Yamakami / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T20:32:53Z (GMT). No. of bitstreams: 1 Resende_RaulisonAlves_D.pdf: 558127 bytes, checksum: 8c65274e70573045a52e4b1101a2c32e (MD5) Previous issue date: 2006 / Resumo: A teoria de conjuntos fuzzy provê um ferramental para desenvolver processos aproximados de raciocínio quando a informação disponível é incerta, incompleta, imprecisa ou vaga. Com as novas ferramentas emergentes na área de inteligência computacional, tais como lógicas não padronizadas, redes neurais e raciocínio simbólico, esta nova teoria é um acréscimo bem-vindo ao repertório de ferramentas tradicionais apropriadas. Neste sentido, esta tese propõe três estratégias para o provimento de qualidade de serviço em redes IP, usando lógica fuzzy. Como primeira proposta é implementado um módulo inteligente para gerenciamento da QoS por meio da criação de políticas para roteadores do tipo DiffServ. A segunda estratégia consiste em um algoritmo fuzzy que resolve o problema de roteamento baseado em restrição de tempo com mínimo custo. Esta proposta apresentou resultados satisfatórios quando comparada com a solução sem lógica fuzzy. E, por último, se propõe um controlador de admissão de conexão para tratar as informações com certo grau de incertezas em redes IP com MPLS. O controlador apresenta as seguintes vantagens: flexibilização da admissão de conexão e possibilidade de incluir mais informações da rede e do tráfego na tomada da decisão sem aumentar consideravelmente a complexidade do controlador / Abstract: Fuzzy set theory provides a machinery for carrying out approximate reasoning processes when available information is uncertain, incomplete, imprecise, or vague. With the emergence of new tools in the area of computational intelligence, such as non standard logics, neural networks, and symbolic reasoning, this new theory is a welcome addition to the repertoire of traditional appropriate tools. In this sense, this thesis proposes three different strategies to apply Fuzzy Logic to provide QoS in IP Networks. The first one is the implementation of an intelligent, policy-based module for QoS management. The module permits the creation of policies to configure QoS in routers and a practical implementation has been performed for a DiffServ router. The second strategy proposes a fuzzy algorithm to solve the problem of routing based on time restrictions with minimum costs. The results obtained from this algorithm were satisfactory when compared to similar solutions that did not involve fuzzy logic. Finally, the third strategy proposes a Connection Admission Controller to process information that contains a high level of uncertainty in IP networks over MPLS. The controller offers the following advantages: flexibility for connections admission and the possibility of including more network and traffic information in the decision making process without considerably increasing the controller complexity / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Coreografias de serviços Web representam uma forma mais escalável e flexível de compor serviços do que uma abordagem centralizada como a orquestração, e seu papel na integração e comunicação de sistemas de larga escala é vital para os objetivos da SOC (Computação Orientada a Serviços) e da Internet do Futuro. Atualmente coreografias de serviços Web possuem vários desafios de pesquisa, dos quais a qualidade de serviço (QoS) e o monitoramento de coreografias de serviçosWeb são linhas importantes. O objetivo deste trabalho é propor e implementar um mecanismo de monitoramento não intrusivo de coreografias de serviços Web baseado em SLAs (Acordos de Nível de Serviço) que especificam as restrições de atributos de QoS de maneira probabilística. Esta dissertação propõe um mecanismo para coreografias de serviços Web que: (1) define requisitos de QoS; (2) especifica contratos probabilísticos sobre parâmetros de QoS usando SLA; e (3) realiza um monitoramento não intrusivo de coreografias de serviços Web para detectar violações de SLA. / Web services choreographies are a more scalable and flexible way to compose services than a centralized approach like orchestrations, and its role in the integration and communication of large-scale systems is vital for the goals of SoC (Service Oriented Computing) and Future Internet. Currently,Web services choreographies have several research challenges. From all challenges, quality of service (QoS) and monitoring of Web services choreography are important research lines. The goal of this work is to propose and implement a mechanism for non-intrusive monitoring of Web services choreography based on SLAs (Service Level Agreements) that define constraints of QoS attributes in a probabilistic way. This thesis proposes a mechanism for Web services choreographies that:(1) defines QoS requirements; (2) specifies probabilistic contracts on QoS parameters using SLAs; and (3) monitors, non-intrusively, the enactment of Web services choreographies to detect SLA violations.

Made available in DSpace on 2014-07-29T15:08:17Z (GMT). No. of bitstreams: 1 Dissertacao_mestrado_josemar.pdf: 1807801 bytes, checksum: b47a17ed3732deb7f34a3e310ec05477 (MD5) Previous issue date: 2011-09-29 / The multifractal modeling is more appropriate in describing some features finding in traffic flows in real networks than other models. This work investigates the behavior of the traffic modeling based policing algorithms found in the literature (Leaky Bucket, Fractal Leaky Bucket, Gaussian Multifractal Leaky Bucket) regarding the buffer utilization, the efficiency for the use of buffer efficiency in describing the accumulated traffic (envelope process), packet dropping and data loss (bytes). First, we compare the envelope process of the considered policing algorithms and the proposed algorithm MAPM (Multifractal Arrival Policing Mechanism), with traffic without policing. Next, it was calculated the system loss rate for a finity buffer system with and without policing algoritm. Using the deterministic Network Calculus, it is also estimated the average queue length (backlog) and delay of bytes by applying the concept of the Min-Plus algebra that presents some differences against the conventional algebra. The proposed policing algorithm was applied to a transmission system based on OFDM (Orthogonal Frequency - Division Multiplexing) / TDMA (Time Division Multiplexing Access) system, where it was evaluated the network performance of the considered policing algorithms. Simulations were carried out with real wireless network trace (Wi-Fi) and wired network trace in order to demonstrate the efficiency of the algorithm proposed in relation to policing algorithms in the literature. The simulations shown the efficiency of the MAPM policing algorithm with traces from wired and wireless networks. We also propose the use of deterministic Network Calculus associated to multifractal envelope process to analyze the traffic behavior in terms of delay and backlog before policing algorithms application in the network. Finally we present the results of buffer utilization, link utilization, delay and backlog to a WiMAX system where the policing algorithm MAPM in general shown delay and backlog increasing in the traffic compared with anothers algorithms and low link utilization / A modelagem multifractal tem se mostrado mais apropriada para descrever algumas características encontradas nos fluxos de tráfego de redes reais que outros modelos, tais como o modelo de Poisson e Markov. Este trabalho investiga o comportamento dos algoritmos de policiamento baseados em modelagem de tráfego (Balde Furado, Balde Furado Fractal, Balde Furado Multifractal Gaussiano) em relação à utilização do buffer, eficiência em descrever o tráfego acumulado (processo envelope) e descarte de pacotes e perda de dados (bytes). Primeiramente, compara-se o processo envelope dos algoritmos de policiamento considerados e do algoritmo proposto neste trabalho, o MAPM (Multifractal Arrival Policing Mechanism), com o tráfego sem policiamento. Em seguida, a taxa de perda em um enlace simples com buffer finito com e sem algoritmo de policiamento é calculada. Utilizando o Cálculo de Rede Determinístico, estima-se o tamanho da fila (backlog) e retardo (delay) de bytes, conforme o conceito da álgebra Min-Plus. O algoritmo de policiamento proposto foi aplicado em um sistema de transmissão OFDM (Orthogonal Frequency - Division Multiplexing) / TDMA (Time Division Multiplexing Access) baseado no sistema WiMAX simplificado, onde se avaliou o desempenho da rede com os algoritmos de policiamento considerados. Realizam-se simulações com séries reais de tráfego de redes sem fio (Wi-Fi) e de redes com fio a fim de demonstrar a eficiência do algoritmo proposto em relação aos algoritmos de policiamento encontrados na literatura. As simulações realizadas evidenciam a eficiência do algoritmo MAPM em policiar séries reais de tráfego de redes com fio e redes sem fio. Propôs-se também, a utilização do Cálculo de Rede Determinístico associado ao processo envelope multifractal para se analisar o comportamento do tráfego em termos de retardo e backlog após a aplicação dos algoritmos de policiamento de rede. Por fim, são apresentados os resultados de retardo, backlog, utilização média do buffer e utilização do enlace para um sistema WiMAX onde o algoritmo de policiamento MAPM que apresentou em geral, acréscimo no retardo e backlog do tráfego em relação aos outros algoritmos e baixa utilização do enlace.

Atualmente, as concessionárias de energia enfrentam vários desafios na tentativa de fornecer energia com qualidade e confiabilidade, por exemplo, redes de distribuição com pouco monitoramento e controle, envelhecimento dos ativos, atender a crescente demanda dos consumidores e satisfazer padrões de qualidade, entre outros. No Brasil, para atingir os índices de qualidade no fornecimento de energia estabelecidos pela Agência Nacional de Energia Elétrica (ANEEL), tem-se como alternativa aumentar a inteligência da rede com sistemas de tecnologia de informação (TI), além de utilizar Dispositivos Eletrônicos Inteligentes (IEDs), medidores inteligentes e sensores. Adicionalmente é necessário o emprego de uma infraestrutura de comunicação que forneça uma visibilidade abrangente das condições de carga e do estado do sistema de distribuição, permitindo fazer uso de técnicas de otimização e tomada de decisão para aumento da inteligência. O controle da tensão e o gerenciamento da potência reativa (Volt/VAr) são práticas de automação que podem ser empregadas nos sistemas de distribuição. Estas práticas ajudam a aumentar o benefício, a confiabilidade e a eficiência no fornecimento da qualidade do produto, minimizando os custos de operação e manutenção nas concessionárias. Na presente dissertação foi desenvolvida uma metodologia de controle Volt/VAr descentralizado (subestação), por meio da coordenação e controle dos transformadores com mudança de tap sob carga - LTC, dos bancos de capacitores localizados na subestação e ao longo dos alimentadores, bem como dos reguladores de tensão instalados ao longo dos alimentadores. Destaca-se a utilização da técnica de Estimação de Estados, a qual possibilita o uso da metodologia de controle Volt/VAr em tempo real. O algoritmo de otimização desenvolvido neste trabalho foi implementado através de simulações numa rede teste e numa rede real que permitem mostrar o potencial da formulação matemática desenvolvida. Os resultados da metodologia proposta comprovam a melhoria do perfil de tensão dos alimentadores da rede testada ao longo do dia, assim como uma diminuição das perdas técnicas, as quais chegaram a diminuir 7% em energia. Estes resultados foram alcançados sem ultrapassar a quantidade de operações definidas por dia nos diferentes dispositivos de controle. / Currently, power utilities face challenges in order to provide energy considering minimum requirements of power quality and reliability due to the absence of control and monitoring infrastructure, aging assets, growing demand, amongst others. In Brazil, the Agência Nacional de Energia Elétrica (ANEEL) establishes specific power quality and reliability indices. Power utilities should attend the limits for those indices by improving intelligence of network using IT systems, installing Intelligent Electric Devices (IEDs), smart meters and sensors, amongst others. Additionally, communication infrastructure is needed to provide the monitoring of load conditions and distribution system state. Optimization and decision-making tools are important for developing smart grids. Voltage control and reactive power management (Volt/VAr) are automation techniques that can be used in distribution systems. These practices lead to benefits for the utilities such as improvement of reliability and efficiency of the system, minimization of operation and maintenance costs, amongst others. In the present dissertation a methodology for decentralized control (Volt/VAr) was developed, through the coordination and control of load tap changers (LTCs) in power transformers and capacitors banks located at the substation, as well as capacitor banks and voltage regulators scattered throughout the feeders. State Estimation was utilized, which allows the application of the Volt/VAr Control methodology in real time environment. The optimization algorithm developed in this work was implemented through simulations in a test network and in a real network which validated the proposed methodology showing the potentiality of the mathematical model. The results of the proposed method showed voltage profile improvement over the day for the network tested as well as a 7% decrease in power energy losses. These results were achieved without exceeding the number of operations per day defined for all control devices.

Quality of Service is major factor for a successful business in modern and future network services. A minimum level of services is assured indulging quality of Experience for modern real time communication introducing user satisfaction with perceived service quality. Traffic engineering can be applied to provide better services to maintain or enhance user satisfaction through reactive and preventive traffic control mechanisms. Preventive traffic control can be more effective to manage the network resources through admission control, scheduling, policing and traffic shaping mechanisms maintaining a minimum level before it get worse and affect user perception. Accuracy, dynamicity, uniformity and reproducibility are objectives of vast research in network traffic. Real time tests, simulation and network emulation are applied to test uniformity, accuracy, reproducibility and dynamicity. Network Emulation is performed over experimental network to test real time application, protocol and traffic parameters. DummyNet is a network emulator and traffic shaper which allows nondeterministic placement of packet losses, delays and bandwidth changes. KauNet shaper is a network emulator which creates traffic patterns and applies these patterns for exact deterministic placement of bit-errors, packet losses, delay changes and bandwidth changes. An evaluation of KauNet with different patterns for packet losses, delay changes and bandwidth changes on emulated environment is part of this work. The main motivation for this work is to check the possibility to delay and drop the packets of a transfer/session in the same way as it has happened before (during the observation period). This goal is achieved to some extent using KauNet but some issues with pattern repetitions are still needed to be solved to get better results. The idea of history and trace-based traffic shaping using KauNet is given to make this possibility a reality.

Avec l'utilisation grandissante des technologies distribuées sans fil pour la modernisation des services, les déploiements d'infrastructures radio dédiées ne permettent plus de garantir des communications fiables, à grande échelle et pour un bas coût. Cette thèse vise à permettre à un opérateur de déployer une infrastructure de réseau radio pour plusieurs applications clientes de l'Internet des Objets (IoT). Nous étudions la mutualisation d'une architecture pour différents flux de trafic afin de rentabiliser le déploiement du réseau en partageant la capacité des nœuds et une large couverture. Nous devons alors garantir une Qualité de Service (QoS) différenciée pour les flux de chaque application. Nous proposons de spécifier des contrats de QoS nommés Service Level Agreements (SLA) dans le domaine de l'IoT. Ceux-ci définissent les indicateurs clés de performance (KPI) de délai de transit et de taux de livraison pour le trafic provenant d'objets connectés distribués géographiquement. Dans un second temps, nous détaillons les fonctionnalités nécessaires à la mise en œuvre des SLA sur le réseau opéré, sous la forme d'une architecture de gestion de SLA. Nous envisageons l'admission de nouveaux flux, l'analyse des performances courantes et la configuration des relais de l'opérateur. Sur la base d'une technologie robuste, multi-saut, IEEE Std 802.15.4-2015 mode TSCH, nous proposons un mécanisme d'observation de réseau permettant de vérifier les différents KPI. Nous utilisons les trames de données existantes comme support de collecte afin de réduire le surcoût en termes de ressources de communication. Nous comparons différentes stratégies de piggybacking afin de trouver un compromis entre la performance et l'efficacité de l'observation. Puis nous détaillons KAUSA, un algorithme d'allocation de ressources sous contraintes de QoS multi-flux. Nous dédions des ressources temps-fréquences ajustées saut-par-saut pour chaque message. KAUSA prend en compte les interférences, la fiabilité des liens radio et la charge attendue afin d'améliorer la répartition des ressources allouées et ainsi prolonger la durée de vie du réseau. Nous montrons les gains et la validité de nos contributions par simulation, sur la base de scénarios réalistes de trafic et d'exigences. / With the growing use of distributed wireless technologies for modern services, the deployments of dedicated radio infrastructures do not enable to ensure large-scale, low-cost and reliable communications. This PhD research work aims at enabling an operator to deploy a radio network infrastructure for several client applications, hence forming the Internet of Things (IoT). We evaluate the benefits earned by sharing an architecture among different traffic flows, in order to reduce the costs of deployment, obtaining a wide coverage through efficient use of the capacity on the network nodes. We thus need to ensure a differentiated Quality of Service (QoS) for the flows of each application. We propose to specify QoS contracts, namely Service Level Agreements (SLAs), in the context of the IoT. SLAs include specific Key Performance Indicators (KPIs), such as the transit time and the delivery ratio, concerning connected devices that are geographically distributed in the environment. The operator agrees with each client on the sources and amount of traffic for which the performance is guaranteed. Secondly, we describe the features needed to implement SLAs on the operated network, and we organize them into an SLA management architecture. We consider the admission of new flows, the analysis of current performance and the configuration of the operator's relays. Based on a robust, multi-hop technology, IEEE Std 802.15.4-2015 on TSCH mode, we provide two essential elements to implement the SLAs: a mechanism for the monitoring of the KPIs, and KAUSA, a resource allocation algorithm with multi-flow QoS constraints. The former uses existing data frames as a transport medium to reduce the overhead in terms of communication resources. We compare different piggybacking strategies to find a tradeoff between the performance and the efficiency of the monitoring. With the latter, KAUSA, we dedicate adjusted time-frequency resources for each message, hop by hop. KAUSA takes into account the interference, the reliability of radio links and the expected load to improve the distribution of allocated resources and prolong the network lifetime. We show the gains and the validity of our contributions with a simulation based on realistic traffic scenarios and requirements.

Les Réseaux Orientés Contenus (Information Centric Networking (ICN)) représentent un nouveau paradigme qui se développe de plus en plus dans le monde de l’Internet. Ils mettent en avant de nouvelles approches centrées sur le contenu pour concevoir une nouvelle architecture pour le réseau Internet du futur dont l’usage bascule aujourd’hui d’une communication orientée machines (hosts) vers une distribution et une récupération de contenus à large échelle.Dans ce cadre, plusieurs architectures de type ICN ont été proposées par la communauté scientifique dans le cadre de plusieurs projets internationaux : DONA, PURSUIT, SAIL, COMET, CONVERGENCE, Named Data Networking (NDN), etc.Nos travaux de thèse se sont focalisés sur la problématique du routage dans les réseaux de ce type, au travers d’une architecture de type NDN qui représente aujourd’hui une des architectures ICN les plus évoluées.En particulier, nous nous sommes intéressés à concevoir et à mettre en œuvre des solutions de routage qui intègrent les métriques de qualité de service (QdS) dans les architectures NDN au regard de usages courants dans le réseau Internet. Celui-ci est en effet caractérisé par une hétérogénéité des liaisons et des conditions de trafic hautement dynamiques.Dans ce type d’architectures, la diffusion des paquets de données est organisée en deux plans : le plande routage et le plan d’acheminement. Ce dernier est responsable de l’acheminement des paquets sur l’ensemble des chemins disponibles au moyen d’une stratégie identifiée en amont. Le plan du routage est quant à lui utilisé uniquement pour soutenir le plan d’acheminement. De fait, les solutions que nous proposons consistent en de nouvelles stratégies d’acheminement avec QdS que nous qualifions d’adaptatives. Ces stratégies sont capables de transmettre les paquets sur de multiples chemins tout en considérant les paramètres de QdS liés à l’état du réseau et collectés en temps réel.La première approche proposée est conçue sur la base d’une méthode d’apprentissage inductif,du type Q-learning en ligne, et est utilisée pour estimer les informations collectées sur l’état dynamique du réseau.La deuxième contribution consiste dans une stratégie d’acheminement adaptatif conçue pour les architectures NDN et prenant en compte les métriques liées à la QdS. Elle est basée sur les similarités entre le processus d’acheminement des paquets dans les architectures NDN et le comportement des fourmis lors de la recherche du plus court chemin entre leur nid et les sources de nourriture. Les techniques utilisées pour concevoir cette stratégie sont inspirées des approches d’optimisation utilisées dans les algorithmes de type « colonies de fourmis ».Enfin, dans la dernière partie de la thèse, nous généralisons l’approche décrite ci-dessus pour l’étendre à la prise en compte simultanée de plusieurs paramètres de QdS. Sur la base de ces mêmes principes, cette approche a ensuite été étendue à la résolution des problèmes liés à la congestion.Les résultats obtenus montrent l’efficacité des solutions proposées dans une architecture NDN et permettent ainsi de considérer les paramètres de QdS dans les mécanismes d’acheminement des paquets ouvrant la voie à diverses applications orientées contenus sur ce type d’architecture / The Information Centric Networking (ICN) represents a new paradigm that is increasingly developed within the Internet world. It brings forward new content-centric based approaches, in order to design a new architecture for the future Internet, whose usage today shifts from a machine oriented communication (hosts) to a large-scale content distribution and retrieval.In this context, several ICN architectures have been proposed by the scientific community, within several international projects: DONA, PURSUIT, SAIL, COMET, CONVERGENCE, Named Data Networking (NDN), etc.Our thesis work has focused on the problems of routing in such networks, through a NDN architecture, which represents one of the most advanced ICN architectures nowadays.In particular, we were interested in designing and implementing routing solutions that integrate quality-of-service metrics (QoS) in the NDN architecture in terms of current Internet usage. This latter is indeed characterized by a heterogeneity of connections and highly dynamic traffic conditions.In this type of architecture, data packets broadcast is organized in two levels: the routing planand the forwarding plane. The latter is responsible for routing packets on all available paths through an identified upstream strategy. The routing plan is meanwhile used only to support the forwarding plane. In fact, our solutions consist of new QoS routing strategies which we describe as adaptive. These strategies can transmit packets over multiple paths while taking into account the QoS parameters related to the state of the network and collected in real time.The first proposed approach is designed on the basis of a on-line Q-learn type inductive learning method, and is used to estimate the information collected on the dynamic state of the network.The second contribution is an adaptive routing strategy designed for NDN architectures which considers the metrics related to QoS. It is based on the similarities between the packet forwarding process in the NDN architecture and the behavior of ants when finding the shortest path between their nest and food sources. The techniques used to design this strategy are based on optimization approaches used "ant colonies" algorithms.Finally, in the last part of the thesis, we generalize the approach described above to extend it to the simultaneous consideration of several QoS parameters. Based on these principles, this approach was later extended to solving problems related to congestion.The results show the effectiveness of the proposed solutions in an NDN architecture and thus allow to consider QoS parameters in packet delivery mechanisms paving the way for various content-oriented applications on this architecture

Ce travail de thèse présente une stratégie de transmission exploitant la diversité spatiale pour la transmission d'images sur canal sans fil. On propose ainsi une approche originale mettant en correspondance la hiérarchie de la source avec celle des sous-canauxSISO issus de la décomposition d'un canal MIMO. On évalue les performances des précodeurs usuels dans le cadre de cette stratégie via une couche physique réaliste, respectant la norme IEEE802.11n, et associé à un canal de transmission basé sur un modèle de propagation à tracé de rayons 3D. On montre ainsi que les précodeurs usuels sont mal adaptés pour la transmission d'un contenu hiérarchisé. On propose alors un algorithme de précodage allouant successivement la puissance sur les sous-canaux SISO afin de maximiser la qualité des images reçues. Le précodeur proposé permet d'atteindre un TEB cible compte tenu ducodage canal, de la modulation et du SNR des sous-canaux SISO. A partir de cet algorithme de précodage, on propose une solution d'adaptation de lien permettant de régler dynamiquement les paramètres de la chaîne en fonction des variations sur le canal de transmission. Cette solution détermine la configuration de codage/transmission maximisant la qualité de l'image en réception. Enfin, on présente une étude sur la prise en compte de contraintes psychovisuelles dans l'appréciation de la qualité des images reçues. On propose ainsi l'intégration d'une métrique à référence réduite basée sur des contraintes psychovisuelles permettant d'assister le décodeur vers la configuration de décodage offrant la meilleure qualité d'expérience. Des tests subjectifs confirment l'intérêt de l'approche proposée. / This thesis presents a transmission strategy for exploiting the spatial diversity for image transmission over wireless channel. We propose an original approach based on the matching between the source hierarchy and the SISO sub-channels hierarchy, resulting from the MIMO channel decomposition. We evaluate common precoder performance in the context of this strategy via a realistic physical layer respecting the IEEE802.11n standard and associated with a transmission channel based on a 3D-ray tracer propagation model. It is shown that common precoders are not adapted for the transmission of a hierarchical content. Then, we propose a precoding algorithm which successively allocates power over SISO subchannels in order to maximize the received images quality. The proposed precoder achieves a target BER according to the channel coding, the modulation and the SISO subchannels SNR. From this precoding algorithm, we propose a link adaptation scheme to dynamically adjust the system parameters depending on the variations of the transmission channel. This solution determines the optimal coding/transmission configuration maximizing the image quality in reception. Finally, we present a study for take into account some psychovisual constraints in the assessment of the received images quality. We propose the insertion of a reduced reference metric based on psychovisual constraints, to assist the decoder in order to determine the decoding configuration providing the highest quality of experience. Subjective tests confirm the interest of the proposed approach.

Cette thèse s'intéresse aux stratégies de transmission de contenu multimédia des réseaux sans fil. L'intérêt d'une stratégie repose sur sa capacité à gérer les ressources selon les objectifs des applications visées. On propose ainsi un schéma de transmission, qui garantit la qualité de service (QdS), quelles que soient les conditions du canal et suivant les spécificités du contenu multimédia. On exploite pour cela les diversités (spatiales, fréquentielles, etc.) du canal radio. A ce titre, l'association MIMO-OFDM apparaît comme une solution idéale pour accroitre les performances du système. On propose ainsi un système MIMO-OFDMA, qui intègre des stratégies inter-couches. Celles-ci se basent sur des techniques d'adaptation de lien pour régler dynamiquement les paramètres du système. On développe en premier un schéma inter-couches PHY 1 APPL, associé à un système MIMO-OFDM mono-utilisateur, qui transmet une vidéo H.264/SVC. L'adaptation de lien permet de définir le jeu de paramètres optimaux, qui minimise la distorsion de la vidéo reçue. On introduit ainsi une politique d'optimisation sous contraintes de puissance et de taux d'erreurs binaires. Pour tenir compte d'aspects de transmission réalistes, on propose un schéma inter-couches PHY/MAC, dédié à un système MIMO-OFDMA, multi-utilisateurs et multi-services. Ce dernier associe un algorithme d'ordonnancement, au paramétrage optimal, pour fournir au maximum d'utilisateurs des débits utiles respectant les exigences des services demandés. Enfin, on combine les deux premières solutions pour définir les paramètres optimaux minimisant la distorsion de la vidéo reçue par utilisateur, tout en garantissant la QdS des autres services. / This thesis focuses on the transmission strategies of the multimedia content in wireless networks. The advantage of a such strategy is its ability to manage the resources, according to the objectives of the targeted applications. We propose a transmission scheme, which guarantees the quality of service (QoS), depending on the channel state information and on the multimedia content specifications. We take advantage of the radio channel diversities (spatial, frequency, etc.). ln fact, the association of MIMO and OFDM techniques appears as effective solution to increase the system performance. For this reason, we propose a MIMO-OFDMA system, which considers cross-layer srtategies based on link adaptation schemes to dynamically adjust the system parameters. Firstly, we develop a PHY/APPL cross-layer strategy, dedicated to a single user of a MIMO-OFDMA system, which transmits an H.264/SVC video. The Iink adaptation scheme allows to define the optimum parameters, which minimize the end-ta-end video distortion by using an optimization algorithm under power and bit error rate constraints. To consider the realistic transmission aspects, we propose a PHY/MAC cross-layer strategy, dedicated to a multi-user, multi-service, MIMOOFDMA system. This scheme combines a scheduling policy with optimal parameterization to provide a satisfied troughput to a maximum number of users, acheiving the required services. Finally, the first two solutions are combined to determine the optimal parameters which minimize the end-ta-end distortion of the received video by user, and also acheive QoS requirements of the other services.