Showing papers on "Broadcasting published in 2007"
Book•
18 May 2007
TL;DR: A Multilayered World of Television: An Overview Central Issues Globalization and Culture Complexity, Structuration, and Cultural Agents Structural and Cultural Process Frameworks for World Television Roles and Impacts of Technology Asymmetrical Interdependence and Asymmetric Cultural Interpenetration: A Proposed Model Imported TV Versus Local and National: Producers Localize, Glocalize, and Hybridize Cultural Identification and Proximity Cultural Hybridization 2.
Abstract: 1. A Multilayered World of Television: An Overview Central Issues Globalization and Culture Complexity, Structuration, and Cultural Agents Structural and Cultural Process Frameworks for World Television Roles and Impacts of Technology Asymmetrical Interdependence and Asymmetrical Cultural Interpenetration: A Proposed Model Imported TV Versus Local and National: Producers Localize, Glocalize, and Hybridize Cultural Identification and Proximity Cultural Hybridization 2. Hybridization and the Roots of Transnational, Geocultural and Cultural-Linguistic Markets Precolonial Cultural History and Television Hybridization Emergent Change Versus Hybridization Hybridity and Television The Roots of Transnational, Geocultural, and Cultural-Linguistic Regions and Markets Broadcasting Models: From Colonial to Postcolonial Hybridity and National Development 3. Creating National and Regional Television and Cultural Industries Dependency, the Cold War, and Television Industry Production Cultural Imperialism and Media Imperialism Local Cultural Production Cultural Imports The Nation-State and Television Import Substitution in Cultural Industries Adaptation and Glocalization of Foreign Models The Cultural Role of States: National Security and National Identity Cultural Industries Achieving National Coverage via Satellite Television Above and Below the National Level Glocal Processes and National Identities 4. Creating Global, U.S., and Transnational Television Spaces Globalization, Broadly Defined Economic Globalization Globalization as the Spread of Capitalist Modernity Economic Neoliberalism and American Empire Globalization, Changing National Policy, and the State Global Spread of Market Capitalism Migration as Globalization Transnational Television Asymmetrical Interdependence and World Television 5. Increasing Complexity: The Technology of Creating Global and National Television Spaces Television Technology as a Structuring Force Cycles of Technology Technology and Production Technology and Media Distribution and Flows Satellites TV Technology, Access, and Choice Cable and Satellite TV Relative to Broadcast TV 6. Producing National Television, Glocal and Local Structuring the Producers' World Television Genre and Structure Cultural Industry Producers Economic Boundaries on Television Genre and Program Development Complexity, Patterns, and Genres Cultural Boundaries: Feedback to Producers Complexity, Prefiguration, and Cultural Hybridity Glocalization Localization as Japanization or Brazilianization Structuration and Television Production in Brazil The Hybrid History of the Telenovela National Television Flows and Production TV and Genre Flow Conclusions 7. TV Exporters: From American Empire to Cultural-Linguistic Markets Genre Imperialism? Genres Flowed Before Programs Delocalization Trends Toward Regionalization of Television Overall Trends in Broadcast Television Flows From Program Genre and Idea Flows to Licensed Format Flows Localization of Global and Transnational Television Channels Broadcast Television Genre Flows Versus Satellite, Cable, and Internet Flows 8. Multiple Proximities Between Television Genres and Audiences: Choosing Between National, Transnational, and Global Television Culture-Bound Reception and Multiple Proximities Cultural Capital, Cultural Proximity, and the Audience Layers of Reception Within Brazil and Italy Cultural Proximity Within Culturally Bound Reception Practices 9. Making Sense of World Television: Hybridization or Multilayered Cultural Identities? From Local to Global Multiple Levels of Audience Identity and Cultural Choices The Process of Hybridization Hybridization Versus Multiple Layers of Identity and Culture Multiple Identifications Researching Audiences and Their Identities Cultural Geography: Cultural Distance, Global, National, and Local Identities Language/Culture-Defined Spaces and Markets Multilevel Identities and Social Class Hybridization and Social Class Hybridization: Race and Ethnic Identity Gender Identity and Television Layers of Identity as Boundaries for Choices and Understandings Layers of Identities as Mediators of Media Meaning Reconfiguration and Synthesis of Identities
518 citations
Patent•
20 Aug 2007
TL;DR: In this paper, the authors present a method for providing interactive audience participation at live entertainment events, which includes providing audience members with an interactive device that presents a promotional message and includes a user interface.
Abstract: The present invention relates to a method for providing interactive audience participation at live entertainment events. The method includes providing audience members with an interactive device that presents a promotional message and includes a user interface, broadcasting audio programming to the audience member through the interactive device, querying the audience members, wherein answers to the querying may be entered by the audience member via the user interface of the interactive device, transmitting the answers to a central processor, storing the answers as audience data, processing the audience data into results, storing the results of the processing of the audience data and broadcasting the results of the processing of the audience data.
166 citations
TL;DR: The behavior of PULSE is evaluated under realistic scenarios via simulation and emulation, and the advantages of the approach are presented, namely a best-effort response to system-wide resource scarcity, high resilience to node churn, and good hop-count properties of the average data distribution paths.
Abstract: Large-scale live media streaming is a challenge for traditional server-based approaches. To appropriately support big audiences, broadcasters must be able to allocate huge bandwidth and computational resources. The costs involved with such an infrastructure exclude all but the established content producers from exploiting the Internet as a distribution medium. Publishers of not-yet-popular content, unless they manage to properly predict their maximum audience size, will likely fail to dimension correctly their broadcast infrastructure. Peer-to-peer systems for live streaming allow the users to support content distribution by contributing their unused resources: this increases the scalability of the content distribution while reducing at the same time the economical burden on the streaming provider. This paper presents and evaluates PULSE, an unstructured mesh-based peer-to-peer system designed to support live streaming to large audiences under the arbitrary resource availability as is typically the case for the Internet. PULSE is a highly dynamic system: it constantly optimizes its mesh of data connections using a feedback-driven peer selection strategy that is based on pairwise incentives. We evaluate the behavior of PULSE under realistic scenarios via simulation and emulation, and present the advantages of our approach, namely a best-effort response to system-wide resource scarcity, high resilience to node churn, and good hop-count properties of the average data distribution paths.
138 citations
Patent•
18 May 2007
TL;DR: In this article, a converged communication system at home having the TV set as the main networked device for integrated content search, delivery, and consumption is presented, thus seamlessly integrating in one delivery channel the traditional consumption of TV broadcasting with searching, browsing and consumption of multimedia and non multimedia online resources.
Abstract: The presented invented method realizes a converged communication system at home having the TV set as the main networked device for integrated content search, delivery and consumption. This method delivers online content from the Internet to TV, thus seamlessly integrating in one delivery channel the traditional consumption of TV broadcasting with searching, browsing and consumption of multimedia and non multimedia online resources.
109 citations
TL;DR: This paper studies the fine-tuning of broadcasting strategies by using a cellular multi-objective genetic algorithm (cMOGA) which computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network.
100 citations
TL;DR: The optimal scheduling problem for cooperative broadcast in dense large-scale networks can be solved for dense networks, which is approximate as a continuum of nodes and under the continuum model, the optimal scheduling and the optimal power density are derived.
Abstract: A fundamental problem in large scale wireless networks is the energy efficient broadcast of source messages to the whole network. The energy consumption increases as the network size grows, and the optimization of broadcast efficiency becomes more important. In this paper, we study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In the considered cooperation protocol, a single source initiates the transmission and the rest of the nodes retransmit the source message if they have decoded it reliably. Each node is allocated an-orthogonal channel and the nodes improve their receive signal-to-noise ratio (SNR), hence the energy efficiency, by maximal-ratio combining the receptions of the same packet from different transmitters. We assume that the decoding of the source message is correct as long as the receive SNR exceeds a predetermined threshold. Under the optimal cooperative broadcasting, the transmission order (i.e., the schedule) and the transmission powers of the source and the relays are designed so that every node receives the source message reliably and the total power consumption is minimized. In general, finding the best scheduling in cooperative broadcast is known to be an NP-complete problem. In this paper, we show that the optimal scheduling problem can be solved for dense networks, which we approximate as a continuum of nodes. Under the continuum model, we derive the optimal scheduling and the optimal power density. Furthermore, we propose low-complexity, distributed and power efficient broadcasting schemes and compare their power consumptions with those-of-a traditional noncooperative multihop transmission.
99 citations
TL;DR: Among the hundreds of operation modes to support multi-program SDTV/HDTV terrestrial services in the DTTB standard, the key features and major applications of a series of modes named "PN595 + C1" are described in detail.
Abstract: A digital terrestrial television broadcasting (DTTB) standard named "Frame structure, channel coding and modulation for digital television terrestrial broadcasting system" was published in China in August 2006. This is the first paper of a series that provide a complete and in depth description to the standard including laboratory and field measurement results, detailed analysis on technologies in achieving stable fixed reception and fast mobile reception, as well as methodologies in spectrum allocation, and principles and technologies in performing single frequency network operation. Among the hundreds of operation modes to support multi-program SDTV/HDTV terrestrial services in the standard, the key features and major applications of a series of modes named "PN595 + C1" are described in detail. Measurement results of PN595 + C1 are also presented to demonstrate the satisfactory performances in fixed reception and high speed mobile reception
95 citations
Patent•
6 Nov 2007TL;DR: In this paper, a method for a wireless communication system includes broadcasting that a first service is available in a first MBSFN and a second service is not broadcasted as available.
Abstract: A method for a wireless communication system includes broadcasting that a first service is available in a first MBSFN and a second service is available in a second MBSFN. The method includes supporting a service not broadcasted as available. For example, supporting the first service with the second MBSFN and/or supporting the second service with the first MBSFN. The supporting or reinforcing can be done by echoing. The echoing is scheduled along with the owned service.
92 citations
21 Aug 2007
TL;DR: In this paper, the authors present the results of the first national qualitative research study into Australian community broadcasting audiences and explore why a significant and increasing number of Australians listen to community radio and/or watch community television, what they value about it, and how it meets their needs.
Abstract: This report presents the results of the first national qualitative research study into Australian community broadcasting audiences. It explores why a significant and increasing number of Australians listen to community radio and/or watch community television, what they value about it, and how it meets their needs. Community broadcasting in Australia began in the early 1970s with the establishment of the first metropolitan community radio stations. Community television is a comparatively recent development dating from the early 1990s. Today, Australian community radio is a mature industry catering to a wide variety of interests. This study deals with audiences for ?generalist? stations in metropolitan and regional Australia and explores responses from two major interest groups ? Indigenous and ethnic communities. Audiences for the nascent community television industry provide a further focus.
87 citations
TL;DR: A novel distributed network-wide broadcasting protocol that takes into account the physical layer dependencies that arise with cooperative diversity and shows that computing the optimal solution to the cooperative broadcast problem is NP-complete.
Abstract: Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperative diversity have been extensive, higher layer protocols which translate the achievable reduction in the SNR per bit for a given target BER, into system wide performance enhancements are yet to mature. The challenge is that appropriate higher layer functions are needed in order to enable cooperative diversity at the physical layer. We focus on network-wide broadcasting with the use of cooperative diversity in ad hoc networks. We design a novel distributed network-wide broadcasting protocol that takes into account the physical layer dependencies that arise with cooperative diversity. We perform extensive simulations that show that our protocol can outperform the best of the noncooperative broadcasting protocols by: (a) achieving up to a threefold increase in network coverage and, (b) by decreasing the latency incurred during the broadcast by about 50%. We also construct an analytical model that captures the behavior of our protocol. Furthermore, we show that computing the optimal solution to the cooperative broadcast problem is NP-complete and construct centralized approximation algorithms. Specifically, we construct an O(N epsi)-approximation algorithm with a computational complexity of O(N4/epsi); we also construct a simpler greedy algorithm.. The costs incurred with these algorithms serve as benchmarks with which one can compare that achieved by any distributed protocol
81 citations
15 Oct 2007
TL;DR: This paper focuses on video streaming between vehicles in highway, where the traffic density is adequate to mitigate frequent link disconnections and persistent network partitions, and studies the performance of video streaming under different data forwarding and buffer management schemes.
Abstract: Live video streaming over vehicular ad hoc networks (VANET) is an attractive feature to many applications, such as emergency live video transmission, road-side video advertisement broadcasting and inter-vehicle video conversation. Though vehicles have ample bandwidth, computation and storage capacity to support data intensive communication, the high mobility may cause persistent network partition. The performance of video streaming suffers from the delay and packet loss incurred by the long time disconnection. Although many solutions have been proposed to handle the high mobility problem, few of them addressed the problem in the context of video transmission. In this paper, we focus on video streaming between vehicles in highway, where the traffic density is adequate to mitigate frequent link disconnections and persistent network partitions. We study the performance of video streaming under different data forwarding and buffer management schemes. Real video data and the dedicated short range communications (DSRC) are used in the simulation study to better match the reality. The result of this paper gives insight for the design of the future inter-vehicle video streaming system.
24 Jun 2007
TL;DR: A graph theoretic technique is used and utility graph coloring is proposed for allocating spectrum to different IEEE 802.22 base stations so that they can co-exist and the use of dynamic multiple broadcast messages that resolves the contention among various consumer premise equipments and alleviates the hidden incumbent problem.
Abstract: The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV bands. Two major challenges that are faced by IEEE 802.22 are (i) the issue of self co-existence and (ii) the hidden incumbent problem. In this paper, we discuss these two challenges and provide enhancements to the existing IEEE 802.22 air-interface. We use a graph theoretic technique and propose utility graph coloring for allocating spectrum to different IEEE 802.22 base stations so that they can co-exist. The allocation is done such that objectives such as throughput maximization, proportional fairness, and complete fairness are met. We also propose the use of dynamic multiple broadcast messages that resolves the contention among various consumer premise equipments and alleviates the hidden incumbent problem. Through simulation results, we show that the proposed techniques increase the system spectrum utilization and reduce connection set-up delay.
Patent•
15 Feb 2007TL;DR: In this article, a service provider assigns a personal channel identifier to a broadcaster, which allows viewers to tune to the personal channel and view the personal content on television as though it were broadcast from any network television station.
Abstract: Preferred systems and methods provide a personal channel for broadcasting personal content to televisions over a network, such as a fiber optic access network. A service provider assigns a personal channel identifier to a broadcaster. This identifier allows viewers to tune to the personal channel. The broadcaster sends personal content to the service provider together with a list of authorized viewers for that personal content. The service provider stores the personal content and makes it available as specified by the subscriber for viewing. When requested, the service provider sends the personal content to the specified set top boxes on the assigned personal channel identifier. By tuning the set top box to the broadcaster's channel, viewers may view the personal content on television as though it were broadcast from any network television station.
8 Oct 2007
TL;DR: A cluster-based multipath topology control and channel assignment scheme, which explicitly creates a separation between the channel assignment and topologycontrol functions, thus minimizing flow disruptions and outperforms existing dynamic channel assignment schemes.
Abstract: The aggregate capacity of wireless mesh networks can be improved significantly by equipping each node with multiple interfaces and by using multiple channels in order to reduce the effect of interference. Efficient channel assignment is required to ensure the optimal use of the limited channels in the radio spectrum. In this paper, a cluster-based multipath topology control and channel assignment scheme (CoMTaC), is proposed, which explicitly creates a separation between the channel assignment and topology control functions, thus minimizing flow disruptions. A cluster-based approach is employed to ensure basic network connectivity. Intrinsic support for broadcasting with minimal overheads is also provided. CoMTaC also takes advantage of the inherent multiple paths that exist in a typical WMN by constructing a spanner of the network graph and using the additional node interfaces. The second phase of CoMTaC proposes a dynamic distributed channel assignment algorithm, which employs a novel interference estimation mechanism based on the average link-layer queue length within the interference domain. Partially overlapping channels are also included in the channel assignment process to enhance the network capacity. Extensive simulation based experiments have been conducted to test various parameters and the effectiveness of the proposed scheme. The experimental results show that the proposed scheme outperforms existing dynamic channel assignment schemes by a minimum of a factor of 2.
Patent•
20 Dec 2007TL;DR: In this paper, a method for receiving and processing a digital radio broadcasting signal including content, storing encoded content, and decoding the stored encoded content to recover decoded content is presented. But decoding the encoded content according to a logical protocol stack is not considered.
Abstract: A method is provided for receiving and processing a digital radio broadcasting signal. The method includes the steps of receiving a digital radio broadcasting signal including content, storing encoded content, and decoding the stored encoded content to recover decoded content. The stored encoded content can include protocol data units or packets. The stored encoded content can be recovered by decoding the encoded content according to a logical protocol stack.
Patent•
8 Jan 2007TL;DR: In this paper, the authors proposed a method for transmitting data on contention based resource in a radio communication system comprising steps of: a BS broadcasting a definition of uplink contention-based resource groups and a criterion for a UE selecting a group; the UE selecting uplink based resource to transmit data according to the criterion for selecting a groups.
Abstract: The method for transmitting data on contention based resource in a radio communication system comprising steps of: a BS broadcasting a definition of uplink contention based resource groups and a criterion for a UE selecting a group; the UE selecting uplink contention based resource to transmit data according to the criterion for selecting a group. With the method according to present invention, data transmission service quality of UE in the border area of the cell may be ensured by providing an effective scheme and thus the uplink system capacity is improved.
1 Apr 2007
TL;DR: In this paper, the power of regulation to shape and control broadcasting markets is investigated using the insights of modern microeconomics, and the authors provide a state-of-the-art analysis of these and other issues.
Abstract: Book description: New technology is revolutionizing broadcasting markets. As the cost of bandwidth processing and delivery fall, information-intensive services that once bore little economic relationship to each other are now increasingly related as substitutes or complements. Television, newspapers, telecoms and the internet compete ever more fiercely for audience attention. At the same time, digital encoding makes it possible to charge prices for content that had previously been broadcast for free. This is creating new markets where none existed before. How should public policy respond? Will competition lead to better services, higher quality and more consumer choice - or to a proliferation of low-quality channels? Will it lead to dominance of the market by a few powerful media conglomerates? Using the insights of modern microeconomics, this book provides a state-of-the-art analysis of these and other issues by investigating the power of regulation to shape and control broadcasting markets.
27 Sep 2007
TL;DR: This paper proposes an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement, and results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.
Abstract: In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.
15 Oct 2007
TL;DR: An analytic model for performance evaluation of IEEE 802.11 ad hoc broadcast networks without the assumption of saturation condition that is not true in safety related vehicle-to-vehicle (v2v) communication is proposed.
Abstract: In this paper, we propose an analytic model for performance evaluation of IEEE 802.11 ad hoc broadcast networks without the assumption of saturation condition that is not true in safety related vehicle-to-vehicle (v2v) communication. We use a discrete time M/G/l queue to model occasional occurrences of safety related message in each vehicle. By means of probability generating function (PGF) and a recursive algorithm, we obtain solution to the analytic model. Based on the solution, we derive several important performance indices for IEEE 802.11 broadcast service, such as packet delay, throughput, packet delivery ratio, and service time distribution. The proposed analytic model is validated by extensive simulations. Numerical results also reveal characteristics of the broadcast service in a typical v2v wireless network.
Patent•
21 Aug 2007TL;DR: In this paper, a method for a wireless communication system determining a location in time of a sub-frame when SFN transmission for data will occur is presented, wherein the transmission patterns indicate the symbols and tones of a Sub-frame to use for reference signals.
Abstract: The application discloses a method for a wireless communication system determining a location in time of a sub-frame when SFN transmission for data will occur. Determining a first transmission pattern and a second transmission pattern for reference signals, wherein the transmission patterns indicate the symbols and tones of a sub-frame to use for reference signals. Selecting for use, between the first transmission pattern and second transmission pattern for reference signals depending on whether SFN data will be transmitted in the sub-frame. Broadcasting information about the selected transmission pattern prior to use thereof.
TL;DR: The goal is to establish conditions on feasibility and to estimate the (synchronous) time complexity of almost-safe broadcasting (i.e., broadcasting which is correct with probability at least 1-1/n for n-node graphs and for sufficiently large n) under these scenarios.
Patent•
12 Feb 2007
TL;DR: In this paper, the authors proposed a peer-to-peer (P2P) system for broadcasting/multicasting of media content over a communication network using shared bandwidth available from P2P networking.
Abstract: The present invention relates to broadcasting/multicasting of media content over a communication network using shared bandwidth available from peer-to-peer networking. The system of the present invention includes a plurality of broadcast devices, a plurality of receiving devices, a plurality of databases, and a control center. The control center is the central nerve of the network, and provides a number of services, including but not limited to channel control, ad insertion, conditional access, program guide services, and the like. The broadcast device converts media content, which can be television, radio, and other data, received from various content providers, into digital data packets, having a suitable format for transmission over the Internet. Each receiving device will request the relevant packets, decode the received packets, and display or present the media content contained in the packets via an associated device. Packets may be received directly from the broadcast devices or from peers (other receiving devices) on the network.
TL;DR: This work identifies three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET), and exhibits a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem.
Abstract: Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET). We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN) builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.
TL;DR: For on-demand streaming of nonlinear media, this paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols.
Abstract: A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular files that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers ldquononlinearrdquo video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to be delivered without jitter. An example might be ldquochoose-your-own-endingrdquo movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. For on-demand streaming of nonlinear media, this paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols.
15 Oct 2007
TL;DR: An analytic model is constructed to characterize the operation of the backoff counter in broadcast and closed form expressions of performance indices including throughput, packet delay, and packet deliver ratio are derived.
Abstract: Broadcast communication is important in inter- vehicle communication. Vehicles broadcast safety related messages to pre-warn the vicinity vehicles. The new IEEE 802.11p is being developed based on IEEE 802.11a to address the need for vehicle-to-vehicle and vehicle-to-roadside-unit communication. In this paper, we study the saturation performance of IEEE 802.11 broadcast by developing an analytic model as well as by conducting simulation. Having investigated the literature and studied the features of the broadcast, we point out that the analytic models for IEEE 802.11 unicast cannot be simply applied for broadcast. We construct our model to characterize the operation of the backoff counter in broadcast. Based on solutions to the model, closed form expressions of performance indices including throughput, packet delay, and packet deliver ratio are derived. Numerical results reveal several characteristics of the broadcast service. Our research work provides a new means to approach analysis and enhancement of IEEE 802.11 broadcast performance and reliability in wireless ad hoc networks.
TL;DR: Two new deterministic gossiping algorithms for ad hoc radio networks with large labels are proposed, which are the first such algorithms with subquadratic time for polynomially large N.
Abstract: We study deterministic gossiping in ad hoc radio networks with large node labels. The labels (identifiers) of the nodes come from a domain of size N which may be much larger than the size n of the network (the number of nodes). Most of the work on deterministic communication has been done for the model with small labels which assumes N = O(n). A notable exception is Peleg's paper, where the problem of deterministic communication in ad hoc radio networks with large labels is raised and a deterministic broadcasting algorithm is proposed, which runs in O(n2log n) time for N polynomially large in n. The O(nlog2n)-time deterministic broadcasting algorithm for networks with small labels given by Chrobak et al. implies deterministic O(n log N log n)-time broadcasting and O(n2log2N log n)-time gossiping in networks with large labels. We propose two new deterministic gossiping algorithms for ad hoc radio networks with large labels, which are the first such algorithms with subquadratic time for polynomially large N. More specifically, we propose: a deterministic O(n3/2log2N log n)-time gossiping algorithm for directed networks; and a deterministic O(n log2N log2n)-time gossiping algorithm for undirected networks.
Patent•
19 Mar 2007TL;DR: In this article, a system and method for broadcasting content data to a plurality of mobile devices is disclosed, where content data is arranged into data blocks, and each data block is broadcast using an initial set of rateless transmission symbols.
Abstract: A system and method for broadcasting content data to a plurality of mobile devices is disclosed. The content data may be video, image, or audio data, for example. The content data is arranged into data blocks, and each data block is broadcast using an initial set of rateless transmission symbols. Mobile devices that did not receive a sufficient number of initial symbols respond with a NACK message, and a NACK rate for the broadcast system is monitored. Responsive to the NACK rate, additional symbols may be broadcast or otherwise transmitted to mobile devices, and, the NACK rate is used to determine when to terminate transmission of additional symbols for a particular data block. An initial set of symbols for the next data block may be transmitted concurrently with the additional symbols for one or more previous data blocks. The NACK rate may also be used as feedback to the broadcast system to adjust the transmission scheme.
TL;DR: A reverse fast broadcasting (RFB) scheme is proposed to alleviate the buffer problem, which requires smaller client buffers than the pyramid broadcasting (PB), skyscraper broadcasting (SkB), greedy disk-conserving broadcasting (GDB), BroadCatch, and recursive frequency-splitting schemes.
Abstract: A popular video can be broadcast by partitioning the video into segments, which are broadcast on several channels simultaneously and periodically. This method allows multiple users to share channels, leading to higher bandwidth utilization. Previous studies mainly focus on reducing viewers' waiting time. This work studies another important issue, namely client buffer. When the term "client buffer" is used, it means the worst-case buffer requirements (i.e., the maximum value). savings. A reverse fast broadcasting (RFB) scheme is proposed to alleviate the buffer problem. There are two specific properties for RFB. First, this scheme arranges the segments in descending order of their numeric indices on each channel at the server end. Second, RFB requires a client to receive segments as late as possible, such that the client buffers the smallest number of segments. RFB has the same waiting time as the fast broadcasting (FB) scheme, but just needs a half of buffer spaces required by FB. RFB also requires smaller client buffers than the pyramid broadcasting (PB), skyscraper broadcasting (SkB), greedy disk-conserving broadcasting (GDB), BroadCatch, and recursive frequency-splitting schemes. Moreover, if we apply the same changes to the PB, SkB and GDB schemes, their buffer requirements decrease by 25% to 75%
1 Dec 2007
TL;DR: It is argued that women will be more likely to benefit from technology-mediated opportunities for development if they themselves produce information that contributes to their advancement, rather than simply consuming information created for their use.
Abstract: This paper describes the rationale, design and implementation of a system for increasing the status and involvement of women in developing communities. AIR (Advancement through Interactive Radio) adds interactivity to community radio, giving community radio listeners, especially women, a voice with which to respond to programming, and to participate in the creation of programming content. We first describe the cost of excluding women from Information and Communication Technologies (ICT) for development, and explore how community radio represents a potential antidote to this exclusion. We draw upon ethnographic data collected through feasibility studies and site visits in Southeast Kenya to support the introduction of a mechanism that enables women to ldquotalk backrdquo to the community radio station, in order to better facilitate participation. Using the principles of Participatory Action Research (PAR), we argue that women will be more likely to benefit from technology-mediated opportunities for development if they themselves produce information that contributes to their advancement, rather than simply consuming information created for their use. Finally, we describe the design and implementation of simple communications device that supports this model. This hand-held device enables women to record voice feedback and news for community radio at the touch of a button. This feedback is then routed asynchronously back to the radio station through a probabilistic, delay-tolerant network, where the feedback can inform subsequent broadcasts and facilitate additional discussion. We conclude with a technical summary of the AIR prototype, which will be deployed in Kenya in Fall 2007.
Patent•
22 Jun 2007TL;DR: In this paper, the authors proposed a method for inserting an advertisement segment into a television program of an Internet Protocol Television (IPTV) channel, the method comprises the steps of: receiving a request from a user that asks for viewing the television program, monitoring the viewing behavior of the user toward the IPTV channel according to an advertisement policy of the TV channel, and determining whether the monitored viewing behavior matches the advertisement policy.
Abstract: The present invention relates to a method and apparatus for broadcasting television programs, in particular to a method and apparatus for inserting an advertisement into a broadcast television program. An object of the invention is to provide a method for inserting an advertisement segment into a television program of an Internet Protocol Television (IPTV) channel, the method comprises the steps of: receiving a request from a user that asks for viewing the television program; monitoring the viewing behavior of the user toward the IPTV channel according to an advertisement policy of the IPTV channel, the advertisement policy comprising providing an advertisement segment based on the user's viewing behavior on the IPTV channel; determining whether the monitored viewing behavior matches the advertisement policy; if the monitored viewing behavior matches the advertisement policy, inserting the advertisement segment into the television program. According to the invention, during the process of viewing a program, a user will have to view a certain amount of advertisements according to a predefined advertisement policy even though the user relocates the television program.