The work intends to present two concepts undeveloped in legal science and that while developed with different objectives and also distant historical, help explain one another. The fundamental right to communication is understood in this text as a political right, and is the ability to experience a balanced access to the media. It is political, since formatting ideas, social values and symbols in contemporary society develops largely through the media outlets that are controlled, in turn, for a very small portion of society. The concentration of ownership in the mass media form an opinion control with results similar to the imbalance of political representation at the institutional level. The possibility of an oligopoly, in turn, is given by both the weak regulation as by chronic disrespect to the existing, and it is the latter factor that is highlighted here. This legal anomie, where all powers disregard both Constitution as to the law that regulates it called unconstitutional standing, well represented in the situation of brazilian audiovisual broadcasting, which this work seeks to develop by analyzing the legislation and data on the sector. / O trabalho pretende apresentar dois conceitos pouco trabalhados na ciência jurídica e que, embora desenvolvidos com objetivos distintos e com históricos também distantes, ajudam a explicar um ao outro. O direito fundamental à comunicação é compreendido neste texto como um direito político, e consiste na possibilidade de experimentar um acesso equilibrado aos meios de comunicação. É político, dado que formatação de ideias, valores e símbolos sociais na sociedade contemporânea se desenvolve em grande parte através dos veículos de mídia que são comandados, por seu turno, por uma parcela ínfima da sociedade. A concentração da propriedade na comunicação de massa forma um controle de opinião com resultados semelhantes ao desequilíbrio da representação política a nível institucional. A possibilidade de existência de um oligopólio, por seu turno, se dá tanto pela fraca regulação quanto pelo desrespeito crônico em relação à existente, e é este o último fator que é aqui destacado. Esta anomia jurídica, em que todos os poderes desconsideram tanto o texto Magno quanto à legislação que o regula chama-se estado de coisas inconstitucional, bem representado na situação da radiodifusão audiovisual brasileira, que o trabalho procura desenvolver através da análise da legislação e dados sobre o setor.

Submitted by Marta Toyoda (1144061@mackenzie.br) on 2018-02-16T18:40:42Z No. of bitstreams: 2 Vitor Chaves de Oliveira.pdf: 3871136 bytes, checksum: ecb40f1164646a21127f6de607806793 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Paola Damato (repositorio@mackenzie.br) on 2018-02-22T13:39:12Z (GMT) No. of bitstreams: 2 Vitor Chaves de Oliveira.pdf: 3871136 bytes, checksum: ecb40f1164646a21127f6de607806793 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-02-22T13:39:12Z (GMT). No. of bitstreams: 2 Vitor Chaves de Oliveira.pdf: 3871136 bytes, checksum: ecb40f1164646a21127f6de607806793 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-08-11 / In the current IP video scenario, the lack of mechanisms that record two technical parameters that influence the commercial chain that sustains this ecosystem related to the Internet, are: availability and audience. And the expressive growth of this type of transmission, continually rivals it with TV. Thus, with the objective of measuring this new medium of audiovisual offer, this work has developed methodologies to acquire such information at this consumer's point and to compare the viability of transitioning from traditional TV to IP Stream. And, this was accomplished through a technical-mathematical comparison and by the construction of two softwares each with a purpose, with their respective requirements analysis, as well as the method of how to interpret the results and infer how these parameters are related. One was programmed to verify the availability of any IP connections through an application that can be used on any browser platform. And the other, implemented as an extension to one of the most used browsers, Google Chrome, to capture the audience of Internet videos on the leading supplier of videos exists today, Google's YouTube. In this work, the abstractions of considerations around the Quality of Service (QoS) concept, is proposed to be interpreted as a measure of Quality of Experience (QoE) assimilated from the quantities of times and interactions with a video. This justification is founded on the concept that quality translates into a particular subjectivity for each user and their individual expectations, so a measure of time is shown to be an effective valuation. Such effectiveness is justified by a principle consolidated within TV broadcast for decades, audience measurement. That is, building something analogous to the People's meter, similar to the Television Rating Points, TRP, running to capture information that brings assertiveness to all stakeholders in this new delivery method. In this way, we can measure the reliability of the content for the Customer, the Content Producer, the Advertiser, the Platform holder, the Content Delivery Network owner (CDN) and the Internet Service Provider (ISP)). / No atual cenário de vídeo IP se destaca a falta de mecanismos que registrem dois parâmetros técnicos que influenciam a cadeia comercial que sustenta todo este ecossistema relativo à Internet, são eles: disponibilidade e audiência. E o expressivo crescimento deste tipo de transmissão, rivaliza-a continuamente com a TV. Sendo assim, e com o objetivo de metrificar esse novo meio de oferecimento de audiovisual, este trabalho desenvolveu metodologias para adquirir tais informações nesta ponta do consumidor e para comparar a viabilidade da transição de broadcast tradicional de TV por Stream IP. E, isto foi realizado através de um comparativo técnicomatemático e da construção de dois softwares cada qual com uma finalidade, com suas respectivas análises de requisitos, bem como o método de como interpretar os resultados e inferir como estes parâmetros se relacionam. Um foi concebido para aferir a disponibilidade de quaisquer conexões IP sendo uma aplicação passível de ser utilizada em diversas plataformas de navegadores, denominados Browsers. E, o outro, implementado como extensão para um dos Browsers mais utilizados, o Google Chrome, para capturar a audiência de vídeos da Internet no maior fornecedor de vídeos existente hoje, o YouTube do Google. Neste trabalho, a extração de considerações ao redor da Qualidade de Serviço, QoS, é proposta a ser interpretada como medida da Qualidade da Experiência, QoE a partir dos diversos tempos e interações totais de um vídeo. Para tanto, dado que o conceito de qualidade se traduz em uma subjetividade particular de cada usuário e suas expectativas individuais, a medida do tempo se mostra como uma eficaz valoração. Tal eficácia é justificada através do princípio da consolidada medida de audiência da difusão de TV há décadas. Isto é, a construção de algo análogo ao ‘People’s meter’ similarmente ao ‘Television Rating Points’, TRP, executando a captura de informações que tragam assertividade para todas as partes interessadas neste novo método de entrega. Propiciando, desse modo, a aferição com este mesmo nível confiabilidade para o usuário, o produtor de conteúdo, o anunciante, o detentor da plataforma, o proprietário da rede de entrega de conteúdo (CDN) e o provedor de acesso à internet (ISP).

Pesquisa em Comunicação na área de Meios de Processos Audiovisuais que estuda as estratégias de grade de programação de domingo na TV aberta brasileira. Ênfase no domingo em virtude de ser o dia com maior número de telespectadores ligados e por ser um dos dias com maior visibilidade dos produtos veiculados. As principais linhas teóricas utilizadas na interpretação da pesquisa tratam da formação do hábito de ver televisão, do contrato afetivo entre o fluxo da grade de programação e o telespectador e do Princípio da Razão Durante através da teoria do Metáporo. Texto multidisciplinar que reúne teóricos de Comunicação, Estudo de TV, Estudos Culturais, Sociologia, Filosofia para construir um corpo teórico que trata de entender estratégias utilizadas pelas emissoras para montar a grade de programação e de como a grade se torna um específico da TV, um produto audiovisual único e fluído e uma forma discursiva estratégica das empresas de comunicação. / Research in Communication within the Audiovisual Media Process area focused on the broadcast Sunday Brazilian TV programming strategies. It emphasizes the Sunday programming due to be the day with the largest number of viewers watching TV and due to one of the days that gets more visibility to the media products and production. The main theoretical lines used in the research are about the habit of watching TV, the emotional contract established between the programming flow and the TV viewer and also the Princípio da Razão Durante (Ongoing Principle) through the Metaporo´s theory. Multidisciplinary text gathering theories from Communication, TV Studies, Cultural Studies, Sociology and Philosophy to build a theoretic body of work to understand the strategies used by the TV stations and networks to form the programming grid and how the grid becomes TV´s specific language, one fluid and exclusive audiovisual product and also an strategic discursive form belonging to the communication enterprises.

A channel change in digital television is usually conducted at a reference frame, which are sent at certain intervals. A higher compression ratio could however be obtained by sending reference frames at arbitrary long intervals. This would on the other hand increase the average channel change time for the end user. This thesis investigates various approaches for reducing the average channel change time while using arbitrary long intervals between reference frames, and presents an implementation and evaluation of one of these methods, called Baydec. The approach of Baydec for solving the channel switch problem is to statistically estimate what the original image looked like, starting with an incoming P-frame and estimate an image between the original and current image. Baydec gathers statistical data from typical video sequences and calculates expected likelihood for estimation. Further on it uses the Simulated Annealing search method to maximise the likelihood function. This method is more general than the requirements of this thesis. It is not only applicable to channel switches between video streams, but can also be used for random access in general. Baydec could also be used if an I-frame is dropped in a video stream. However, Baydec has so far shown only theoretical result, but very small visual improvements. Baydec produces images with better PSNR than without the method in some cases, but the visual impression is not better than for the motion compensated residual images. Some examples of future work to improve Baydec is also presented.

Abstract This thesis concentrates on the design and evaluation of spatial user multiplexing methods via linear transmit-receive processing for wireless cellular multi-user multiple-input multiple-output (MIMO) communication systems operating in the time-division duplexing (TDD) mode. The main focus is on the acquisition of effective channel state information (CSI) that facilitates decentralized processing so that the network nodes – base stations (BS) and user terminals (UT), each employing an arbitrary number of antenna elements – are able to locally participate in the network adaptation. The proposed methods rely on the uplink-downlink channel reciprocity and spatially precoded over-the-air pilot signaling. Considering (single-cell) multi-user MIMO systems, coordinated zero-forcing transmit-receive processing schemes for the uplink (UL) are proposed. The BS computes the transmission parameters in a centralized manner and employs downlink (DL) pilot signals to convey the information of the beamformers to be used by the UTs. When coexisting with the DL zero-forcing, the precoded DL demodulation pilots can be reused for UL beam allocation, and the precoded UL demodulation pilots are reused in turn for partial channel sounding (CS). As a result, only the precoded pilot symbols are needed in both UL and DL. Moreover, a concept for reducing the number of the required orthogonal UL CS pilot resources is presented. Based on their DL channel knowledge, the multi-antenna UTs form fewer pilot beams by spatial precoding than conventionally needed when transmitting antenna-specific pilots. In the context of DL zero-forcing, when taking into account the CSI estimation error at the BS, the overhead reduction turns out to improve robustness and increase the average system capacity. Considering multi-cell multi-user MIMO systems, decentralized coordinated DL beamforming strategies based on weighted sum rate (WSR) maximization are proposed. An optimization framework where the WSR maximization is carried out via weighted sum mean-squared-error minimization is utilized, and the approach is generalized by employing antenna-specific transmit power constraints. The iterative processing consists of optimization steps that are run locally by the BSs. In one novel strategy, the coordinating cells update their transmit precoders and receivers one cell at a time, which guarantees monotonic convergence of the network-wide problem. The strategy employs separate uplink CS and busy burst pilot signaling to reveal the effective channels of the UTs to the neighboring BSs. In another novel strategy, the monotonic convergence is sacrificed to devise a faster scheme where the BSs are allowed to optimize their variables in parallel based on just the CS responses and additional low-rate backhaul information exchange. The numerical results demonstrate that WSR maximization has the desirable property that spatial user scheduling is carried out implicitly. Finally, methods for UL CS overhead reduction are presented, and the effect of CSI uncertainty is addressed. / Tiivistelmä Tämä väitöskirja keskittyy lineaarisella lähetys- ja vastaanottoprosessoinnilla toteutettavien tilajakomonikäyttömenetelmien suunnitteluun ja arviointiin langattomissa moniantennisissa solukkoverkoissa, jotka hyödyntävät aikajakodupleksointia (TDD). Erityisesti tarkastellaan efektiivisen kanavatiedon hankintaa, joka mahdollistaa hajautetun prosessoinnin siten että verkkoelementit – tukiasemat ja terminaalit, jotka kukin hyödyntävät useaa antennielementtiä – voivat osallistua paikallisesti verkon adaptaatioon. Esitetyt menetelmät perustuvat ylä- ja alalinkin kanavien resiprookkisuuteen ja tilatasossa esikoodattuun opetus- eli pilottisignalointiin ilmarajapinnan yli. Yksisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään ylälinkin koordinoituja nollaanpakottavia lähetys- ja vastaanottomenetelmiä. Tukiasema laskee lähetysparametrit keskitetysti ja käyttää pilottisignaaleja kertomaan millaista lähetyskeilanmuodostusta terminaalien tulee käyttää. Alalinkin nollaanpakotuksen yhteydessä esikoodattuja demodulaatiopilotteja voidaan uudelleenkäyttää ylälinkin lähetyskeilojen allokointiin, ja esikoodattuja ylälinkin demodulaatiopilotteja uudelleenkäytetään puolestaan osittaiseen kanavan luotaukseen (sounding). Näin ollen molempiin suuntiin tarvitaan vain esikoodatut pilotit. Lisäksi työssä esitetään menetelmä ylälinkin luotauspilottiresurssitarpeen vähentämiseksi. Kanavatietoon perustuen moniantenniset terminaalit muodostavat tilatasossa esikoodattuja pilottilähetyskeiloja, joita tarvitaan vähemmän kuin perinteisiä antennikohtaisia pilotteja. Kun otetaan huomioon kanavanestimointivirhe tukiasemassa, resurssiensäästömenetelmä parantaa häiriösietoisuutta ja nostaa järjestelmän keskimääräistä kapasiteettia alalinkin nollaanpakotuksen yhteydessä. Monisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään hajautettuja koordinoituja alalinkin keilanmuodostusstrategioita, jotka perustuvat painotetun summadatanopeuden (WSR) maksimointiin. Valitussa optimointikehyksessä WSR:n maksimointi toteutetaan painotetun summaneliövirheen minimoinnin kautta, ja työssä menettelytapa yleistetään antennikohtaisten lähetystehorajoitusten tapaukseen. Iteratiivinen prosessointi koostuu optimointiaskelista, jotka tukiasemat paikallisesti suorittavat. Yhdessä esitetyssä strategiassa yhteistoiminnalliset solut päivittävät lähettimensä ja vastaanottimensa yksi solu kerrallaan, mikä takaa verkonlaajuisen ongelmanratkaisun monotonisen konvergenssin. Tämä strategia käyttää erillisiä ylälinkin luotaussignaaleja sekä varattu-signaaleja ilmaistakseen terminaalien efektiiviset kanavat naapuritukiasemille. Toisessa strategiassa monotoninen konvergenssi uhrataan ja kehitetään nopeammin adaptoituva menetelmä, jossa tukiasemat saavat optimoida muuttujansa rinnakkain, perustuen vain luotaussignaaleihin ja tukiasemien väliseen informaationvaihtoon. Numeeriset tulokset osoittavat, että WSR:n maksimointi toteuttaa aktiivisten käyttäjien valinnan tilatasossa implisiittisesti. Lopuksi esitetään menetelmiä luotauspilottiresurssitarpeen vähentämiseksi ja käsitellään kanavatiedon epävarmuuden vaikutusta.

Orientador: Luiz Eduardo Buzato / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-22T08:23:33Z (GMT). No. of bitstreams: 1 Cason_Daniel_M.pdf: 1133475 bytes, checksum: 2c269ea2aec943999c502cd1944b09ae (MD5) Previous issue date: 2013 / Resumo: Protocolos de Difusão Totalmente Ordenada (DTO) constituem o núcleo de diversas soluções que dão suporte ao desenvolvimento de aplicações distribuídas tolerantes a falhas. O longo período no qual este problema vem sendo objeto de pesquisa e a quantidade de algoritmos que foram para ele propostos atestam, não só a sua importância, mas também a dificuldade de se obter soluções eficientes para DTO. Este trabalho apresenta um novo algoritmo de DTO, que explora a sincronia e a confiabilidade inerentes ao ambiente dos aglomerados ou clusters de alto desempenho para construir uma solução bastante simples de Difusão Totalmente Ordenada, cujo desempenho experimental mostrou-se comparável ao obtido por soluções de DTO projetadas para modelos assíncronos de computação. O protocolo proposto destina-se ao modelo assíncrono temporizado de computação, aumentado com um mecanismo simples, baseado na difusão de pulsos, para sincronizá-la a execução dos processos. A hipótese que sustenta este mecanismo de sincronização é que os aglomerados modernos, dado que se controle a carga a eles aplicada, podem executar por períodos razoavelmente longos sem que ocorram falhas de processos e apresentando um comportamento bastante similar ao de sistemas síncronos. Dada esta hipótese, os processos que realizam Difusão Totalmente Ordenada tornam-se capazes de construir visões globais da computação distribuída, e a construção de visões globais, por sua vez, torna trivial a resolução de Difusão Totalmente Ordenada. O protocolo proposto tolera uma quantidade ilimitada de falhas de desempenho, que previnem o progresso da solução de DTO, mas que não levam à violação de suas propriedades de segurança, que são asseguradas na presença de assincronia e de falhas de processos. O protocolo foi implementado em Java e o seu desempenho foi avaliado em um aglomerado com máquinas interconectadas via Ethernet. A comparação dos resultados obtidos com os resultados de desempenho publicados para as principais soluções de DTO existentes nos permite afirmar que nossa solução representa um interessante compromisso entre desempenho experimental e simplicidade de projeto e implementação de soluções de Difusão Totalmente Ordenada. Além dos resultados de desempenho, esta pesquisa também revela que ainda há espaço para a exploração prática da interação entre sincronia e assincronia na engenharia de protocolos distribuídos / Abstract: Total order broadcast algorithms are at the core of several toolkits for the construction of fault-tolerant applications. The importance and the difficulty of finding efficient total order broadcast (TOB) algorithms is attested by the long period that such algorithms have been the object of intense research and by the large number of algorithms already proposed. This work presents a new algorithm for total order broadcast that takes advantage of the inherent reliability and timeliness of high performance clusters in its design. Experimental results show that the performance of this very simple TOB is on a par with the performance of TOBs designed for asynchronous computing models. The proposed protocol has been designed for the timed asynchronous computing model, enhanced with a simple pulse-based mechanism that is used to synchronize the processes' execution. The assumption behind the pulse-based synchronization is that modern clusters, given some workload conditioning, can maintain reasonably long failure-free execution periods in which they behave very much as synchronous system. This assumption allows the processes that engage in total order broadcasts to build a global view of their joint computation and this global view, in its turn, allows them to solve total order broadcast in a straightforward way. The protocol tolerates an unbounded number of timing failures, that can prevent its progress but have no impact on its safety, it is also safe in the in the presence of asynchrony, and processes failures. The protocol has been implemented in Java and tested on an Ethernet-based cluster. A comparison of the results obtained in the experiments with results published for other well-known TOBs allow us to conclude that our solution represents an interesting trade-o_ between performance and simplicity of design and implementation for total order broadcasts protocols. Beyond performance, this research seems to indicate that there is still room for the practical exploration of the interplay between synchronicity and asynchronicity in the engineering of distributed protocols / Mestrado / Ciência da Computação / Mestre em Ciência da Computação

We present a partial implementation of King and Saia 2016’s expected polyno- mial time byzantine agreement algorithm, which which greatly speeds up Bracha’s Byzantine agreement algorithm by introducing a shared coin flip subroutine and a method for detecting adversarially controlled nodes. In addition to implementing the King-Saia algorithm, we detail a new version of the “blackboard” abstraction used to implement the shared coin flip, which improves the subroutine’s resilience from t < n/4 to t < n/3 and leads to an improvement of the resilience of the King-Saia Byzantine agreement algorithm overall. We test the King-Saia algorithm, and detail a series of adversarial attacks against it; we also create a Monte Carlo simulation to further test one particular attack’s level of success at biasing the shared coin flip / Graduate

Developmental disabilities (DEVDIS) such as attention deficit hyperactivity disorder (ADHD), autism spectrum disorders (ASD), developmental delay (DD), and learning disabilities, affect 14% of US youth, who also experience higher rates of obesity, approximately 19%, than youth without these conditions. Screen time is a risk factor for obesity, though it is not well-studied among youth with developmental disabilities. Youth with developmental disabilities experience challenges with learning, have underdeveloped social skills, and problematic behaviors. These predispositions can often result in peer rejection. The resulting social isolation may make these youth particularly vulnerable to engaging in solitary activities such as screen time. The objectives of this dissertation were to compare screen time rates among youth with developmental disabilities to typically developing youth and to examine the associations between social and family engagement with screen time among youth with developmental disabilities. Data from the 2007 National Survey of Children’s Health (NSCH), a national cross-sectional study that assesses the physical and emotional health of US children (N = 91,642), were used. Youth 6-17 years, with ADHD (n = 7,024), ASD (n = 1,200), DD (n = 3,276), LD (n = 7,482), and without special health care needs (n = 44,461) were studied. Unadjusted analyses found that children with DEVDIS engage in higher rates of screen time than youth without special health care needs. For youth with DEVDIS who were medicated for their ADHD, these associations attenuated. Thus ADHD symptoms, a common comorbidity across developmental disabilities, drove associations between the other developmental disabilities and screen time. Across all developmental disability groups, television in the bedroom was a significant screen time risk factor in both children and adolescents. Among children with ADHD, additional screen time risk factors included lack of caregiver knowledge of the child’s friends and any social engagement outside of the household. Among adolescents with ADHD, additional screen time risk factors included lower frequency that caregiver attends adolescent’s events and sport social engagement. Findings of this dissertation elucidate modifiable screen time risk factors that could potentially be adapted to decrease screen time among youth with developmental disabilities.

Dans les systèmes répartis asynchrones, l'horloge logique et le vecteur d'horloges sont deux outils fondamentaux pour gérer la communication et le partage de données entre les entités constitutives de ces systèmes. L'objectif de cette thèse est d'exploiter ces outils avec une perspective d'implantation. Dans une première partie, nous nous concentrons sur la communication de données et contribuons au domaine de la diffusion uniforme à ordre total. Nous proposons le protocole des trains : des jetons (appelés trains) circulent en parallèle entre les processus participants répartis sur un anneau virtuel. Chaque train est équipé d'une horloge logique utilisée pour retrouver les train(s) perdu(s) en cas de défaillance de processus. Nous prouvons que le protocole des trains est un protocole de diffusion uniforme à ordre total. Puis, nous créons une nouvelle métrique : le rendement en termes de débit. Cette métrique nous permet de montrer que le protocole des trains a un rendement supérieur au meilleur, en termes de débit, des protocoles présentés dans la littérature. Par ailleurs, cette métrique fournit une limite théorique du débit maximum atteignable en implantant un protocole de diffusion donné. Il est ainsi possible d'évaluer la qualité d'une implantation de protocole. Les performances en termes de débit du protocole des trains, notamment pour les messages de petites tailles, en font un candidat remarquable pour le partage de données entre coeurs d'un même processeur. De plus, sa sobriété en termes de surcoût réseau en font un candidat privilégié pour la réplication de données entre serveurs dans le cloud. Une partie de ces travaux a été implantée dans un système de contrôle-commande et de supervision déployé sur plusieurs dizaines de sites industriels. Dans une seconde partie, nous nous concentrons sur le partage de données et contribuons au domaine de la RFID. Nous proposons une mémoire répartie partagée basée sur des étiquettes RFID. Cette mémoire permet de s'affranchir d'un réseau informatique global. Pour ce faire, elle s'appuie sur des vecteurs d'horloges et exploite le réseau formé par les utilisateurs mobiles de l'application répartie. Ainsi, ces derniers peuvent lire le contenu d'étiquettes RFID distantes. Notre mémoire répartie partagée à base de RFID apporte une alternative aux trois architectures à base de RFID disponibles dans la littérature. Notre mémoire répartie partagée a été implantée dans un jeu pervasif qui a été expérimenté par un millier de personnes. / In asynchronous distributed systems, logical clock and vector clocks are two core tools to manage data communication and data sharing between entities of these systems. The goal of this PhD thesis is to exploit these tools with a coding viewpoint. In the first part of this thesis, we focus on data communication and contribute to the total order broadcast domain. We propose trains protocol: Tokens (called trains) rotate in parallel between participating processes distributed on a virtual ring. Each train contains a logical clock to recover lost train(s) in case of process(es) failure. We prove that trains protocol is a uniform and totally ordered broadcast protocol. Afterwards, we create a new metric: the throughput efficiency. With this metric, we are able to prove that, from a throughput point of view, trains protocol performs better than protocols presented in literature. Moreover, this metric gives the maximal theoretical throughput which can be reached when coding a given protocol. Thus, it is possible to evaluate the quality of the coding of a protocol. Thanks to its throughput performances, in particular for small messages, trains protocol is a remarkable candidate for data sharing between the cores of a processor. Moreover, thanks to its temperance concerning network usage, it can be worthwhile for data replication between servers in the cloud. Part of this work was implemented inside a control-command and supervision system deployed among several dozens of industrial sites. In the second part of this thesis, we focus on data sharing and contribute to RFID domain. We propose a distributed shared memory based on RFID tags. Thanks to this memory, we can avoid installing a computerized global network. This is possible because this memory uses vector clocks and relies on the network made by the mobile users of the distributed application. Thus, the users are able to read the contents of remote RFID tags. Our RFID-based distributed shared memory is an alternative to the three RFID-based architectures available in the literature. This distributed shared memory was implemented in a pervasive game tested by one thousand users.

Aujourd’hui, le renforcement de la sécurité des systèmes de communications devient une nécessité, par anticipation du développement des ordinateurs quantiques et des nouvelles attaques qui en découleront. Cette thèse explore deux techniques complémentaires permettant d’assurer la confidentialité des données transmises sur des liens sans-fils. Dans la première partie de ce travail, nous nous intéressons au schéma de cryptographie à clé publique basée sur des réseaux de points, qui représente une des techniques les plus prometteuses pour la cryptographie post-quantique. En particulier, nous considérons le cryptosystème Goldreich-Goldwasser-Halevi (GGH), pour lequel nous proposons un nouveau schéma utilisant les GLD. Dans la seconde partie de ce travail, nous étudions la sécurité des canaux de diffusion multi-utilisateur, ayant accès à des mémoires de caches, en présence d'un espion. Nous considérons deux contraintes de sécurité: la contrainte de sécurité individuelle et la contrainte de sécurité jointe. Nous dérivons des bornes supérieure et inférieure pour le compromis sécurisé capacité-mémoire en considérant différentes distributions de cache. Afin d'obtenir la borne inférieure, nous proposons plusieurs schémas de codage combinant codage wiretap, codage basé sur la superposition et codage piggyback. Nous prouvons qu'il est plus avantageux d'allouer la mémoire de cache aux récepteurs les plus faibles. / Today, there is a real need to strengthen the communication security to anticipate the development of quantum computing and the eventual attacks arising from it. This work explores two complementary techniques that provide confidentiality to data transmitted over wireless networks. In the first part, we focus on lattice-based public-key cryptography, which is one of the most promising techniques for the post-quantum cryptography systems. In particular, we focus on the Goldreich-Goldwasser-Halevi (GGH) cryptosystem, for which we propose a new scheme using GLD lattices. In the second part of this work, we study the security of multi-user cache-aided wiretap broadcast channels (BCs) against an external eavesdropper under two secrecy constraints: individual secrecy constraint and joint secrecy constraint. We compute upper and lower bounds on secure capacity-memory tradeoff considering different cache distributions. To obtain the lower bound, we propose different coding schemes that combine wiretap coding, superposition coding and piggyback coding. We prove that allocation of the cache memory to the weaker receivers is the most beneficial cache distribution scenario.