Economics of Domestic Cultural Content Protection in Broadcasting, The

We analyze the economics of domestic cultural content protection in terrestrial broadcasting, the most widespread policy instrument used in broadcasting. Using the love-of-variety approach, we model a representative consumer deriving utility from broadcasting services net of advertising,and allocating scarce time between consuming the various broadcasting services and leisure. Advertising is a nuisance; it costs time yet brings no utility. Broadcasting is a pure public good; broadcasters make profit in the monopolistic competition environment by bundling advertising with valuable cultural content. We impose a discrete domestic content requirement and then investigate the effects of its marginal changes on consumption of domestic broadcasting. Domestic content requirement may reduce (increase) consumption of domestic programs when consumer's demand is highly elastic (inelastic), the degree of preference for foreign content over domestic content is high (low) and opportunity cost of listening time is high (low). The reduction occurs because the consumer reshuffles her consumption bundle towards leisure away from high domestic-content stations thereby reducing the overall aggregate consumption of broadcasting, and subsequently, the overall aggregate consumption of domestic programs.boradcasting; domestic content; radio; cultural protection

“Point of View: Now Is Not the Time to Cut Funding for Public Broadcasting,” POV, BU Today

President Trump’s proposed budget threatens to pull the plug on federal funding for the Corporation for Public Broadcasting (CPB), the major funder of Public Broadcasting Service (PBS) programming and National Public Radio (NPR) and the supporter of 350 local member public television stations. This proposed cut will do very little to fix the US budget deficit, but it will contribute mightily to the shortage of reliable public information available to citizens at a time when they need it most.http://www.bu.edu/articles/2017/pov-funding-for-public-broadcasting/Published versio

Latency Optimal Broadcasting in Noisy Wireless Mesh Networks

In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise parameter $p\in [0,1],$ any sender has a probability of $p$ of transmitting noise or any receiver of a single transmission in its neighborhood has a probability $p$ of receiving noise. In this paper, we first propose a new asymptotically latency-optimal approximation algorithm (under faultless model) that can complete single-message broadcasting task in $D+O(\log^2 n)$ time units/rounds in any WMN of size $n,$ and diameter $D$. We then show this diameter-linear broadcasting algorithm remains robust under the noisy wireless network model and also improves the currently best known result in CHHZ17 by a $\Theta(\log\log n)$ factor. In this paper, we also further extend our robust single-message broadcasting algorithm to $k$ multi-message broadcasting scenario and show it can broadcast $k$ messages in $O(D+k\log n+\log^2 n)$ time rounds. This new robust multi-message broadcasting scheme is not only asymptotically optimal but also answers affirmatively the problem left open in CHHZ17 on the existence of an algorithm that is robust to sender and receiver faults and can broadcast $k$ messages in $O(D+k\log n + polylog(n))$ time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author

An adaptive quasi harmonic broadcasting scheme with optimal bandwidth requirement

The aim of Harmonic Broadcasting protocol is to reduce the bandwidth usage in video-on-demand service where a video is divided into some equal sized segments and every segment is repeatedly transmitted over a number of channels that follows harmonic series for channel bandwidth assignment. As the bandwidth of channels differs from each other and users can join at any time to these multicast channels, they may experience a synchronization problem between download and playback. To deal with this issue, some schemes have been proposed, however, at the cost of additional or wastage of bandwidth or sudden extreme bandwidth requirement. In this paper we present an adaptive quasi harmonic broadcasting scheme (AQHB) which delivers all data segment on time that is the download and playback synchronization problem is eliminated while keeping the bandwidth consumption as same as traditional harmonic broadcasting scheme without cost of any additional or wastage of bandwidth. It also ensures the video server not to increase the channel bandwidth suddenly that is, also eliminates the sudden buffer requirement at the client side. We present several analytical results to exhibit the efficiency of our proposed broadcasting scheme over the existing ones.Comment: IEEE International Conference on Informatics, Electronics & Vision (ICIEV), 2013, 6pages, 8 figure

Performance evaluation of flooding in MANETs in the presence of multi-broadcast traffic

Broadcasting has many important uses and several mobile ad hoc networks (MANETs) protocols assume the availability of an underlying broadcast service. Applications, which make use of broadcasting, include LAN emulation, paging a particular node. However, broadcasting induces what is known as the "broadcast storm problem" which causes severe degradation in network performance, due to excessive redundant retransmission, collision, and contention. Although probabilistic flooding has been one of the earliest suggested approaches to broadcasting. There has not been so far any attempt to analyse its performance behaviour in MANETs. This paper investigates using extensive ns-2 simulations the effects of a number of important parameters in a MANET, including node speed, pause time and, traffic load, on the performance of probabilistic flooding. The results reveal that while these parameters have a critical impact on the reachability achieved by probabilistic flooding, they have relatively a lower effect on the number of saved rebroadcast packets

Message and time efficient multi-broadcast schemes

We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459

A Quantum Broadcasting Problem in Classical Low Power Signal Processing

We pose a problem called ``broadcasting Holevo-information'': given an unknown state taken from an ensemble, the task is to generate a bipartite state transfering as much Holevo-information to each copy as possible. We argue that upper bounds on the average information over both copies imply lower bounds on the quantum capacity required to send the ensemble without information loss. This is because a channel with zero quantum capacity has a unitary extension transfering at least as much information to its environment as it transfers to the output. For an ensemble being the time orbit of a pure state under a Hamiltonian evolution, we derive such a bound on the required quantum capacity in terms of properties of the input and output energy distribution. Moreover, we discuss relations between the broadcasting problem and entropy power inequalities. The broadcasting problem arises when a signal should be transmitted by a time-invariant device such that the outgoing signal has the same timing information as the incoming signal had. Based on previous results we argue that this establishes a link between quantum information theory and the theory of low power computing because the loss of timing information implies loss of free energy.Comment: 28 pages, late