Abstract: Fast metadata indexing and delivery for broadcast audio-visual (AV) programs by using template, segment-mark and bookmark on the visual spatio-temporal pattern of an AV program during indexing The broadcasting time carried on a broadcast transport stream is used as a locator allowing direct access to a specific temporal position of a recorded AV program

Abstract: In a radio access network, techniques for multicasting information from a radio network controller to radio nodes. The techniques further include broadcasting the information from the radio nodes to mobile access terminals. The information can include content to be delivered to the access terminals.

Abstract: A system and method for controlling the operation of a television using a cable broadcasting network is disclosed. The presence of a viewer in front of the television is sensed, presence information is then transmitted to a cable broadcasting service center via the cable broadcasting network, a control signal is sent to the television adapted to receive same, and regular cable programming is suspended. The present invention allows the cable broadcasting company to provided additional services to the cable subscriber to retain and attract additional customers. These additional services may be tailored to the specific needs of the cable subscriber, thus a higher quality cable service is provided.

Abstract: After decades of distorted stereotyping by the media, Canada's First Peoples began to take control of their own image by creating a broadcast industry to transmit their own representations and perspectives. "Something New in the Air" charts the development of indigenous television broadcasting within the wider context of Canadian contemporary, multicultural society from the 1960s to the present. Lorna Roth focuses on the regional, national, and global implications of Television Northern Canada and the Aboriginal Peoples Television Network (APTN), the only dedicated aboriginal television service in the world available to every household in Canada with cable and satellite. She shows that by making their programming an integral part of the Canadian broadcasting infrastructure, First Peoples have succeeded in mediating their own historically-ruptured pasts and creating a provocative model for media resistance. Concentrating on policy development, Roth explains how First Peoples in Canada have refashioned television broadcasting, indigenizing, and transforming it into a tool for inter-community and national development. "Something New in the Air" valorises the struggle of First Peoples to attain legislated recognition of their collective communications and cultural rights, and shows how this struggle explains, in part, why they are now acknowledged as having the most advanced aboriginal broadcasting network in the world.

Abstract: In this paper, we examine noisy radio (broadcast) networks in which every bit transmitted has a certain probability of being flipped. Each processor has some initial input bit, and the goal is to compute a function of these input bits. In this model, we show a protocol to compute any threshold function using only a linear number of transmissions.

Abstract: National Institute of Information and Communications Technology (NICT) has developed a software defined radio platform that consists of FPGA board, CPU board, and RF boards. On the platform, software packages for W-CDMA, IEEE802.11a/b, and digital terrestrial broadcasting have been developed. Each software package consists of physical layer, MAC/DLC layer, IP layer, and application layer part In this paper the details of SDR platform and its software are introduced. Then, the volume of each software package for FPGAs and CPUs is shown and the minimum size of hardware that realizes communication and broadcasting systems with high-signal-processing-power is discussed. Finally, this paper shows the image and requirement of cognitive radio based on the research results

Abstract: A system and method for a novel broadcasting scheme (NBS) in a wireless local area network are described, which can operate with or without a network connection. The system permits transmission of application-specific data through a specific field in a beacon frame, the Service Set Identity (SSID). By implementing a NBS Processor in an AP and a NBS Parser in stations, the AP can broadcast application-specific data while the stations can automatically act upon the receipt of the broadcast.

Abstract: The present invention is directed specifically to methods for reducing the bandwidth requirements for broadcasting traffic information to a vehicle navigation system. The traffic information broadcast to the system using the bandwidth conserving methods of the present invention generally includes traffic flow information and traffic incident information. In one embodiment, the vehicle navigation system filters traffic information to a certain range to expedite traffic calculation, to save on processing hardware, and to reduce bandwidth needs. Alternately, bandwidth conservation may be achieved by providing weight factors and threshold prioritizing when a broadcast limit is close to being reached or exceeded. In another embodiment, bandwidth reduction is achieved by not broadcasting free-flow traffic information and/or displaying only traffic information that indicates a traffic problem. Another method of the present invention to reduce bandwidth needs is directed to reducing broadcast of static traffic information.

Abstract: We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy algorithm may be coupled with our proposed greedy heuristics as well as with the greedy heuristics proposed for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3 percent and 328.9 percent) when compared with network lifetime using the base greedy heuristics in isolation.

Abstract: Disclosed are an apparatus for distributing same/different digital broadcasting streams in a heterogeneous home network and a method thereof The apparatus includes a home gateway, and a home server, connected to the home gateway through Ethernet and also connected to a PC, a second IP STB, a 1394 STB, an HAS (Home Auto System) and an HDTV receiver, for outputting a ground-wave broadcast, a satellite broadcast and a cable broadcast to their HDTV receivers, respectively, through the second IP STB and the 1394 STB if the ground-wave broadcast, the satellite broadcast and the cable broadcast are received through coaxial cables, interworking with the HAS in order to control home appliances, and directly outputting the broadcast to the HDTV receiver through a built-in STB function. According to the apparatus, a user having a plurality of HDTV receivers at home can simultaneously view a plurality of HDTV broadcasts irrespective of the broadcasting systems when a plurality of heterogeneous home networks match through a home network matching device.

Abstract: We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks has running time $\cO$ (n log2 n). Our main result is a broadcasting algorithm working in time $\cO$ (n log n log D) for arbitrary n-node ad hoc radio networks of radius D. The best currently known lower bound on broadcasting time in ad hoc radio networks is $\Omega$ (n log D); hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary radius to a logarithmic factor. We also show a broadcasting algorithm working in time $\cO$ (n log D) for complete layered n-node ad hoc radio networks of radius D. The latter complexity is optimal.

Abstract: A broadcasting base station device transmits broadcast signals modulated by a hierarchical modulation scheme to a mobile terminal device. A hierarchical modulation setup section compares the reception quality of the broadcast signals at the location of the mobile terminal device to predetermined reference quality. Based on the result of the comparison, the hierarchical modulation setup section specifies a hierarchical modulation scheme. For example, the constellation in each quadrant is reduced or enlarged. Accordingly, the broadcasting base station device can transmit optimal broadcast signals that match with actual reception quality to each mobile terminal device.

Abstract: Mobile ad-hoc networks (MANETs) are composed of a set of communicating devices, which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcast strategy in MANETs is a multi-objective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we study the fine-tuning of broadcast strategies by using a cellular multi-objective genetic algorithm (cMOGA) that computes a Pareto front of the solutions to empower a human designer with the ability of choosing the preferred configuration for the network. We define two formulations of the problem, one with three objectives and another one with two objectives plus a constraint. Our experiments using a complex and realistic MANET simulator reveal that using cMOGA is a promising approach to solve the optimum broadcast problem.

Abstract: As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is of prime importance. One of the best known algorithm, named BIP (broadcast incremental power), constructs a spanning tree rooted at a given node. This protocol offers very good results in terms of energy savings, but its computation is unfortunately centralized, as the source node needs to know the entire topology of the network to compute the tree. Many localized protocols have since been proposed, but none of them has ever reached the performances of BIP. Even distributed versions of the latter have been proposed, but they require a huge transmission overhead for information exchange and thus waste energy savings obtained thanks to the efficiency of the tree, in this paper, we propose and analyze a localized version of this protocol. In our method, each node is aware of the position of all the hosts in the set of its 2-hop neighborhood and compute the BIP tree on this set, based on information provided by the node from which it got the packet. That is, a tree is incrementally built thanks to information passed from node to node in the broadcast packet. Only the source node computes an initially empty tree to initiate the process. We also provide experimental results showing that this new protocol has performances very close to other good ones for low densities, and is very energy-efficient for higher densities with performances that equal the ones of BIP.

Abstract: Disclosed is a digital broadcast receiving apparatus for informing a user that multi-channel broadcasting of a plurality of programs is scheduled to start, prior to the start of the multi-channel broadcasting. The digital broadcast receiving apparatus receives and executes an application that a broadcast station transmits a predetermined time period (five minutes, for example) before the start of multi-channel broadcasting. In accordance with the application, the digital broadcast receiving apparatus displays a listing of preview images of the programs.

Abstract: A method and system for performing chaincast communication to multiple communication systems (e.g., computer systems) within a system of coupled electronic devices (e.g., the Internet). The present invention provides a system wherein a broadcast source communicates primary broadcast information (e.g., encoded audio radio content, encoded audio/video television content, etc.) to a first group of electronic devices. The first group of electronic devices can be instructed by a chaincast manager to then communicate (e.g., forward or re-transmit) the broadcast information to other electronic devices which devices can also be instructed to communicate to more devices, etc., thereby reducing the bandwidth requirements of the communication channel between the broadcast source and the first group of electronic devices. The chaincast manager, coupled to the Internet, is used to track and manage which devices are forwarding broadcast information to which other devices. The chaincast manager is also used to monitor the packet rates between the electronic devices. In response to the packet rates falling below a pre-determined threshold value, the transmission re-routes communications to provide better communication load sharing across the system. The chaincast communication system may also include a number of secondary broadcast servers for broadcasting secondary information content (e.g., advertisement, emergency information, community information, etc.) to be rendered independently of the primary broadcast information content.

Abstract: A random access apparatus for supporting a variety of access service classes includes a radio frequency (RF) transmitting/receiving unit for receiving a preamble introduction broadcasting signal from a base station and transmitting a random access preamble to the base station, an introduction broadcasting signal processing unit for extracting a random access usage relating to M-sequences and hadamard sequences from the received preamble introduction broadcasting signal, a selecting unit for selecting a plurality of M-sequences and a hadamard sequence corresponding to a random access purpose based on the extracted random access usage, and a preamble producing unit for generating the random access preamble using the selected plurality of M-sequences and the selected hadamard sequence.

Abstract: The present invention features a network-based in-store media broadcasting system comprising one or more, and preferably, a plurality of client player devices placed at a plurality of business locations, each of the client player devices being independently supported and in communication with the internal audio/visual system installed in the business location; a customizable broadcast supported on each of the client player devices and comprising informational content thereon (music, advertisements, etc.) that is specific to the particular business location; a central server system comprising one or more central servers in communication with each of the independent client player devices; and a network configuration connecting the client player devices to the central server network to provide an exchange of information between the two. The in-store media broadcasting system also comprises several proprietary software application modules functioning to allow the in-store media broadcasting system to operate. The present invention also features a unique method of doing business to provide in-store media broadcasting to one or more business locations. Not only is the business model capable of providing in-store media broadcasting, but a national radio-advertising platform or network focusing on major retailers and service providers throughout the country is also contemplated. The present invention system and service gives retailers and service providers the ability to broadcast customized music and messaging to their customers. In addition, the radio-advertising network provides a targeted advertising venue for consumer marketing companies and, unlike any other media, allows them to advertise products to select and targeted customers at the point of sale.

Abstract: In all-wireless networks, minimizing energy consumption is crucial as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of radio transmissions can be exploited to optimize energy consumption. This problem appears to be difficult to solve [30]. We provide a formal proof of NP-completeness for the general case and give an NP-completeness result for the geometric case; in the former, the network topology is represented by a generic graph with arbitrary weights, whereas in the latter a Euclidean distance is considered. For the general case, we show that it cannot be approximated better than O(log N), where N is the total number of nodes. We then describe an approximation algorithm that achieves the O(log N) approximation ratio. We also describe a new heuristic, Embedded Wireless Multicast Advantage. We show that it compares well with other proposals and we explain how it can be distributed.

Abstract: A real-time music information retrieval system and methods for providing desired music information via text message to radio or television stations listeners through wireless communication devices. Listeners could retrieve information for the song that is currently being played at the radio and television station, or the songs that have previously been played. A system and method is provided to automatically send an alert message the radio and television station listeners of upcoming music broadcasting events.

Abstract: A message is automatically broadcast to a plurality of recipients from a mobile wireless communications device. A recipient list of recipient names and addresses is preprogrammed and stored in the wireless communications device. Recorded voice and text messages are sent to recipients and recipient telephones, voicemail systems, and email and Internet addresses from the recipient list Delivery status options can be selected to identify the recipient addresses receiving the message, the recipient addresses with answering machines receiving the message, the recipient addresses not accepting the message, or non-communicating recipient addresses. In addition, recipient message response options can be selected including accepting, displaying or storing the responses. Recipient non-receipt options also can be selected, such as rebroadcasting the message, displaying a status message, or doing nothing in response to recipient addresses not receiving the message.

Abstract: A method and apparatus for managing radio resources in one or more wireless communication networks. At least one radio resource manager (RRM) is provided within a network node, or as an independent entity. The RRM monitors performance on wireless communication links of the network(s) and interacts with nodes associated with those links to change the configuration on a particular wireless communication link if its performance (i.e., quality) falls below an established threshold. Information regarding current resource usage of the network is sent to the RRM by the nodes. Each of the nodes may send a quality report to the RRM including wireless communication link quality measurements and performance statistics. Alternatively, the RRM may perform the wireless communication link quality measurements. The RRM facilitates the broadcasting of information regarding current resource usage of one network to other networks to avoid collisions and interference.

Abstract: In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree is used to implement this operation, and the objective is to find the tree, which maximizes the throughput, i.e. the average number of slices sent by the source processor every time-unit. We introduce several heuristics to solve this problem. The good news is that the best heuristics perform quite efficiently, reaching more than 70% of the absolute optimal throughput, thereby providing a simple yet efficient approach to achieve very good performance for broadcasting on heterogeneous platforms.

Abstract: Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single or multiple channels. Since mobile units have limited battery power, the minimization of the access and tuning times for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access and tuning times by providing indexes on the broadcast data. We have studied an efficient index allocation method for broadcast data with skewed access frequencies over multiple physical channels which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques have one of two problems. The first problem is that they require equal size for both index and data. The second problem is that their performance degrades when the number of given physical channels is not enough. These two problems result in an increased average access time for the broadcast data. To cope with these problems, we propose a tree-structured index allocation method. Our method minimizes the average access time by broadcasting the hot data and their indices more frequently than the less hot data and their indexes over the dedicated index and data channels. We present an in-depth experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decreases the average access and tuning times for the broadcast data over existing methods.

Abstract: Summary form only given. We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy algorithm may be coupled with our proposed greedy heuristics as well as with the greedy heuristics proposed earlier in the literature for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3% and 328.9%) when compared with network lifetime using the base greedy heuristics in isolation.

Abstract: Video broadcast services have become increasingly popular on packet-based wireless networks, such as 1xEV-DO and HSDPA which support high data rate. In this paper we propose a resource allocation algorithm for scalable video broadcast over such wireless networks. Our algorithm allocates time slots among the video layers of a scalable video and applies adaptive modulation and coding (AMC) to each video layer to maximize the sum of utilities for heterogeneous users with varying QoS requirements. It also considers competing video sessions and allocates time slots among them according to user preferences. Additionally, its polynomial time-complexity allows for online resource allocation that is necessary for real-time video services. Simulation experiments show that our algorithm outperforms a single-layer video broadcast with fixed modulation and coding (FMC), used in broadcast and multicast services (BCMCS) in the CDMA2000 system, and produce a near-optimal allocation.

Abstract: A system to provide media to broadcast informational advertising or any other kind of ad campaign by using portable devices carried by users, such as mobile telephones, PDA devices, hybrid devices and, in general, any device that permits a multimedia reproduction of content received in the device, either in the form of a call or in the form of a message. The system provides for the implementation of an application in the mobile device, whose application involves a call management and campaign broadcast module, a configuration and storage management module, and server data communication modules. The interrelationships between the application modules and the modules in the mobile device are done through interfaces. The system allows users to configure parameters and also incorporates point generating media depending on the broadcast performed.

Abstract: This article investigates the scalability of DVB-H deployment on existing wireless infrastructure for digital broadcasting and cellular networks. Three deployment strategies are investigated: when only the broadcasting and the cellular infrastructure are used separately, and the case when both can be used jointly. The outcomes show that, in general, the investment needed for increasing the service capacity by switching to higher order modulation, or for increasing the coverage level over a given service area, lead to a higher annualized cost per Mb/s