An ad hoc wireless network is an infrastructure-less, autonomous system of nodes connected through wireless links. In many current applications of ad hoc wireless networks, individual wireless nodes are autonomous, rational, and intelligent and are often referred to as selfish nodes, following game theoretic terminology. In an ad hoc wireless network, a typical node may be an intermediate node of a route from a source node to a destination node and therefore is often required to forward packets so as to enable communication to be established. Selfish nodes may not always forward the packets since the forwarding activity consumes the node’s own resources. Such behavior by individual nodes may lead to suboptimal situations where nodes, through their actions, lead to a state that is undesirable from an overall network viewpoint. To counter this, there is a need to stimulate cooperation through methods such as providing appropriate incentives. In this thesis, our interest is in designing rigorous incentive based methods for stimulating cooperation among wireless nodes, in the specific context of broadcast. In particular, we address the Incentive Compatible Broadcast problem: how do we design broadcast protocols that induce truth revelation by the individual wireless nodes? We do this using a game theory and mechanism design framework. Incentive compatibility of broadcast protocols could manifest in two forms: (1) Dominant Strategy Incentive Compatibility (DSIC) (also called strategy-proofness) and (2) Bayesian incentive compatibility (BIC). A DSIC broadcast protocol is one which makes it a best response for every wireless node to reveal its true type, regardless of what the other nodes reveal. A BIC broadcast protocol is one which makes truth revelation a best response for a node, given that the other nodes are truthful. The DSIC property is stronger and more desirable but more difficult to achieve. On the other hand, the BIC property is much weaker and easier to achieve. In this thesis, we first design a DSIC broadcast protocol for ad hoc networks using the well known VCG (Vickrey-Clarke-Groves) mechanisms and investigate its properties and performance. Next, we design a BIC broadcast protocol, investigate its properties, and compare its performance with that of the DSIC broadcast protocol. Both the protocols developed in this thesis provide an elegant solution to the incentive compatible broadcast problem in ad hoc networks with selfish nodes and help stimulate cooperation among the selfish wireless nodes.

Title from first page of PDF document. Includes bibliographical references (p. 94-105).

This thesis describes digital television transition in the United States. Its goal is to introduce the way how digital television broadcasting in the United States was formed and analog broadcasting was switched off, and how these changes affected American television market and usage of broadcasting spectrum. In the first part I explain a context in which American television market has been formed and has developed until the beginning of 1990s, when the debate about digital television broadcasting commenced. Reason for a development of the new television norm was a desire to broadcast in high definition. Establishment of ATSC norm is explained in 4th chapter. Following chapter describes how digital television coverage grew and what the expenses were for viewers. The thesis then describes spectrum auctions and changes in the television market which digital television transition brought. When the transition ended need for a new debate about television emerged because current norm is becoming obsolete and did not allow broadcasting in ultra high definition. This lead to the development of ATSC 3.0 norm which allows broadcasting more programs in terrestrial television broadcasting and allows expanding terrestrial broadcasting to other mobile devices.

Synopsis The aim of this diploma paper is to explain and demonstrate censorial practice of the communist regime in the Czechoslovak Radio. The paper demonstrates via narrators' memories the way the transmission in the Czechoslovak Radio was affected after its takeover by the Communist Party in 1948, namely on the part of both the operational technical staff members and editors. Historical experience of narrators is presented in the context of formerly known events amended by published articles or sources including those of radio archive.

The inequality of women in the workforce has been an ongoing issue. The 19th amendment granted women the right to vote in 1920. Since then, women have continued to fight for their equality in its entirety. Specifically, in the 21st-century women continue to fight for equality in the work place. Studies have shown that the amount of women in the workplace has exponentially increased. In fact, “they caught up with men in the rates of higher-education graduation, they increased their training and representation in formerly male-dominated professional fields and they entered many previously male dominated occupations” (Vokić, 2017). However the increase of representation doesn’t necessarily positively correlate with the treatment of women in the workforce. In many countries the most prominent journalists remain male. The purpose of this paper is to detect if Spanish-language journalism is male dominated in regard to the kinds of stories male and female reporters are assigned. Through the observation of which gender gets assigned hard/soft news stories we will examine if this pattern continues in Spanish-language broadcast journalism. We will determine if stereotypes and gender roles are being reinforced in the media through the assignment of stories to reporters.

No description available.

本研究為探討數位化後台灣廣播電台的節目產製模式與流程之改變，依據生產流程管理與廣播節目產製理論觀點，析論廣播節目邁向數位化產製模式之可能性，並依據分析所得描繪可能之模式與流程。 透過對台灣廣播產業的現況分析，指出目前台灣廣播電台的節目產製模式大多偏向「需求導向」產製模式的描述；少數電台則是比較偏向「創意導向」產製模式。雖然自動播出系統已經普遍使用，但只是簡化了播出作業。在節目數位化產製程度上，仍在建立資料庫階段，還未扭轉過去的製播經驗，對於進入數位化產製抱持傳統的心態，減低了邁入數位化的可能性。 因此，研究建議首先廣播電台繼續豐富資料庫的資源，還要提升資料庫的功能性。其次，結合聯播網的產製經驗，擴大資料庫網絡，與其它傳播媒介合作，形成一個「需求與資料庫導向」的產製模式，作為達到數位化產製模式與流程的基礎。 / This research aims to understand the digitizing influence the production model & process for broadcast program. Based on the viewpoint of production management theory and the broadcast programming theory, analyze the current broadcast program production model & process and evaluate the possibility of digitization. According to the result, describe the possible digitalized production model & process for broadcast program. By the current situation analysis of Taiwan broadcast industry, point out their production model is mostly inclined to “effect-to-cause” model, and few are inclined to “cause-to-effect” model. Although the “Radio Computing Service” is generally used, but only simplified the program broadcasting stage. On broadcast program production’s digitization level, Taiwan radio stations are still in establishment database stage, but also retain the traditional production experience. This result showed that reduces the advance possibility of the digitization. Therefore, the research suggests the broadcasting continue enrich the database resource; also enhance the functions of database for strategy-planning. Then, by combining the experience of radio network, expand the database network and cooperate with other mass media. The broadcast production will shift to the "effect-database" model which is the relative concept of digitalized production model.

The study determines and evaluates changes in the 10:00 p.m. newscasts of the Dallas-Fort Worth network affiliates following personnel and ownership changes, and a reduction in length of one station's newscast. Scripts and audio recordings of the newscasts were collected during four-week periods before and after the changes. The data were analyzed and supplemented with interviews conducted with the stations' news directors and producers. Conclusions drawn were that ownership changes had more impact on the presentation of the news than on its content, changes in anchormen and producers had more effect on presentation than on content, and a reduction in news time caused changes in the content of a television newscast.

Approved for public release, distribution is unlimited / This thesis presents a simulation and performance evaluation analysis of the various routing protocols that have been proposed for the Mobile Ad Hoc Network (MANET) environment using the Network Simulator-2 (NS-2) tool. Many routing protocols have been proposed by the academic communities for possible practical implementation of a MANET in military, governmental and commercial environments. Four (4) such routing protocols were chosen for analysis and evaluation: Ad Hoc On-demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector routing (DSDV) and Optimized Link State Routing (OLSR). NS-2 is developed and maintained by the University of Southern California's Information Sciences Institute (ISI). Leveraging on NS-2's simulation capabilities, the key performance indicators of the routing protocols were analyzed such as data network throughput, routing overhead generation, data delivery delay as well as energy efficiency or optimization. The last metric is explored, especially due to its relevance to the mobile environment. Energy is a scare commodity in a mobile ad hoc environment. Any routing software that attempts to minimize energy usage will prolong the livelihood of the devices used in the battlefield. Three important mobility models are considered, namely, Random Waypoint, Manhattan Grid, and Reference Point Group Mobility. The application of these three models will enhance the realism of simulation to actual real life mobility in an urban or military setup scenario. The performance of the routing protocols in varied node density, mobility speed as well as loading conditions have been studied. The results of the simulation will provide invaluable insights to the performance of the selected routing protocols. This can serve as a deciding factor for the U.S. Department of Defense (DoD) in their selection of the most suitable routing protocols tailored to their specific needs. / Civilian, Defence Science Technology Agency, Singapore

Nos travaux se positionnent dans le cadre de l'algorithmique distribuée et plus particulièrement des réseaux ad hoc. Les réseaux ad hoc sont auto-organisés en permettant des échanges directs entre nœuds mobiles et ne reposent sur aucune infrastructure. Chaque nœud peut se déplacer librement et indépendamment des autres impliquant une modification perpétuelle de la topologie. Dans ce contexte, la probabilité que des défaillances surviennent dans le réseau est importante. Ces défaillances gênent le bon fonctionnement du réseau et peuvent même entrainer une paralysie de celui-ci. C'est pourquoi la conception de solutions pour de tels réseaux nécessitent des mécanismes de gestion de fautes. Parmi ceux-ci, l'approche d'auto-stabilisation permet à un système de gérer les fautes transitoires. Nous étendons cette approche pour répondre aux principaux problèmes liés à la mobilité des nœuds. Notre objectif est de répondre à un double besoin d'auto-organisation du réseau et d'optimisation du nombre de messages échangés. Notre approche consiste à découper le réseau en clusters afin de lui donner une structure hiérarchique. Cette dernière rend l'utilisation du réseau plus efficace et plus performante. L'algorithme que nous avons développé à cet effet est auto-stabilisant et n'est basé que sur des connaissances locales. Nous exploitons cette solution pour proposer deux utilisations efficaces : la diffusion d'informations dans le réseau et le routage. La diffusion d'informations exploite un arbre couvrant inter-clusters, construit sans surcoût, en parallèle de la clusterisation. Le routage quant à lui exploite cet arbre pour permettre à la fois d'optimiser le délai de bout en bout et le nombre de messages échangés. / Our work relies in the domain of distributed system, more preciselly ad hoc networks. Ad hoc networks are self-organized allowing direct exchanges between mobile nodes and do not rely on any infrastruture. Each node can move freely and independently of each others involving continuous topology variability. In this context, the probability that a failure occurs in the network is high. These failures hinder the proper functioning of the network and even causes its paralysis. Therefore, designing solutions for such networks requires fault management mechanisms. Among these, a self-stabilizating approach allows the system to withstand transient faults. We extend this approach to answer the problems induced by nodes mobility. We have two main objectives: a self-organizing network and optimizing number of exchanged messages. Our approach consists in dividing the network into clusters in order to give it a hierarchical structure. This solution allows a more efficient and effective network use. The algorithm that we developed for this purpose is a self-stabilizing algorithm based only on local informations. Based on this solution, we propose two efficient use cases: Information broadcast and a routing protocol. Information broadcast uses an inter-cluster spanning tree, generated without any overhead. In the same time as the clustering process. The routing protocol uses this tree for both round trip and number of exchanged messages optimization.