Abstract: We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to carry out a broadcast process. The status of each node, forward or nonforward, is determined either by the node itself or by other nodes. Node status can be determined at different snapshots of network state along time (called views) without causing problems in broadcast coverage. Therefore, the forward node set can be constructed and maintained through either a proactive process (i.e., "up-to-date") before the broadcast process or a reactive process (i.e., "on-the-fly") during the broadcast process. A sufficient condition, called coverage condition, is given for a node to take the nonforward status. Such a condition can be easily checked locally around the node. Several existing broadcast algorithms can be viewed as special cases of the generic framework with k-hop neighborhood information. A comprehensive comparison among existing algorithms is conducted. Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the generic framework.

Abstract: Evolution of Satellite Technology and Applications: Satellite Network Fundamentals. Satellite Application Types. Satellite Links and Access Methods: Design of the Satellite Link. Link Budgets. Multiple Access Systems. Frequency Band Tradeoffs -- L, S, C, Ku, and Ka. Issues in Satellite System Management: Satellite System Implementation. Communications Payload Configurations. Spacecraft Bus Configurations. Contingency Planning. Television Applications and Standards: Entertainment Programming. Educational TV. Business TV. Analog TV Standards. Digital Video Compression Systems and Standards: Compression Technology. Joint Photographic Experts Group (JPEG). Motion Picture Experts Group (MPEG). Digital Video Broadcasting (DVB) Standard. Direct-to-Home TV Broadcasting by Satellite: Differences Among DTH Systems. History of DTH Systems. Relative Cost of Satellite DTH Versus Cable. DTH Satellite Design Options. Digital Compression Systems and Suppliers. Orbital Interference Limitations. Data Communication and Very Small Aperture Terminal Networks: Interactive Data Networks. VSAT Star Networks. Capacity Planning and Sizing. Hub Implementations. Suppliers of VSAT Networks. Advanced VSAT Networks and Technology. Fixed Telephony Satellite Networks: Role of Satellites in Telephone Services. Demand Assignment SCPC Network Architecture. Preassigned Point-to-Point Links. Application in Rural Telephony. Mobile Satellite Service (GEO and Non-GEO): Foundation of the Mobile Satellite Service. GEO MSS Systems. Advanced MSS Services. Non-GEO MSS Systems. Application of Multiple Access Techniques. Network Access Control and Security. Digital Speech Compression. Economic Comparison of MSS Systems. Prospects for Global MSS Service. Frequency Coordination and Regulation of Services: Regulatory Background. Sharing of Radio Frequencies. Structure of the ITU. The ITU Radio Regulations. International Frequency Coordination. World Radio Communication Conference. Additional Regulatory Approvals. The Business of Satellite Communication: The Satellite Marketing Challenge. Selling the Space Segment. Value Added Service Offerings. The Marketing Organization. Financing a Satellite System.

Abstract: The digitization of traditional broadcast systems has made significant progress in recent years. This development could be observed recently with respect to the standard for digital terrestrial television, DVB-T (Digital Video Broadcasting – Terrestrial), which is already in operation in many countries throughout the world. Currently, the system is being rolled out in Germany and the UK (the Freeview DTT platform). DVB-T has also started in the Netherlands and Italy and was announced to start in France in early 2005; further countries have plans to start services in the near future. In many countries, the decision to select DVB-T as the terrestrial television system was based on the exceptional features of the DVB-T standard, among them the possibility to receive broadcast services also with portable devices and even in cars.

Abstract: Techniques for targeting advertisements based on consumer purchasing data are described. Consumer purchasing data is used to generate a profile associated with a subscriber to a broadcast television system. Consumer profile characteristics may also be associated with an advertisement that is to be targeted. Prior to broadcasting a targeted advertisement, a message is broadcast that notifies a client device of the consumer profile characteristics associated with the upcoming targeted advertisement. If the consumer profile characteristics associated with the targeted advertisement match the subscriber profile associated with the subscriber of the client device, then the client device tunes to an alternate data stream over which the targeted advertisement is broadcast. Otherwise, a default advertisement is received over the originally tuned data stream.

Abstract: A new national standard for digital multimedia broadcasting (DMB) has been announced in Korea to provide high quality digital audio, video, and data broadcasting services to fixed, mobile, and portable receivers. We have developed the world's first DSP/FPGA implementation of the portable DMB receiver, complete with an RF receiver, a 6.4-inch LCD display, and audio/video/data decoders. In this paper, we present the design, implementation, and performance of this portable DMB receiver. First, we provide a brief overview of the DMB system and the audio/video coding tools supported by it, i.e., MPEG-4 BSAC and MPEG-4 Part 10 AVC/H.264. We discuss the low-power high-performance design of the DMB receiver, focusing particularly on the audio/video decoding parts. Finally, we illustrate the performance of the portable DMB receiver that operates in real-time at the overall frequency of 25 MHz.

Abstract: A mobile terminal is provided for achieving continuous program viewing/listening by appropriately switching between program reception through broadcasting and program reception through communication with a broadcast receiving function and a communication function working cooperatively. A receiver receives a program broadcasted from a broadcasting station. A reception state monitoring section monitors a state of receiving the broadcast program in the receiver. If the reception state is in a satisfactory state, the broadcast program is reproduced by the reproducing section. Upon determination by the reception state monitoring section that the reception state has been deteriorated, a program information generating section generates program information specifying the broadcast program being currently received by the receiver, and then gives the program information to a communication section. The communication section communicates with a program distribution center to receive program data corresponding to the generated program information by streaming. The program data received through communication is reproduced instead of the broadcast program by the reproducing section.

Abstract: A method and system for providing information on mobile communication network-WLAN interworking are provided. In the mobile communication network-WLAN interworking system, interworking WLAN information is broadcast from a mobile communication network to a dual terminal, which has a mobile communication network interface and a WLAN interface. Upon receipt of a broadcasting message including information on an interworking WLAN, the dual terminal turns on its WLAN module and periodically scans for a nearby WLAN in a power save mode. Upon receipt of a broadcasting message including no interworking WLAN information, the dual terminal turns off the WLAN module.

Abstract: Many essential multimedia applications rely on video-on-demand technology to deliver a video to different users. A number of periodic broadcast techniques have been proposed for the cost-effective implementation of such systems. Most of these techniques would either try to minimize the server bandwidth, user bandwidth, user storage, user access latency to the video, or a combination of some of the aforementioned parameters. On the other hand, the implementation strategies of these broadcast schemes would necessitate a minimum bandwidth requirement for all users. Multi-resolution techniques address the heterogeneity problem by sacrificing user video quality. In this paper, we consider a different approach that does not possess this disadvantage. Using an incremental channel design at the server side, and a specific broadcast schedule, users can choose among a range of bandwidths to use to download the video at the cost of their access latency and not to the video quality. We prove the correctness of the proposed solution; provide mathematical analysis to demonstrate its heterogeneous behavior, and present performance studies to illustrate its efficiency.

Abstract: We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of their neighbors. In every step every node acts either as a transmitter or as a receiver. A node acting as a transmitter sends a message which can potentially reach all of its neighbors. A node acting as a receiver in a given step gets a message if and only if exactly one of its neighbors transmits in this step. Bar-Yehuda, Goldreich, and Itai [J. Comput. System Sci., 45 (1992), pp. 104--126] considered broadcasting in this model. They claimed a linear lower bound on the time of deterministic broadcasting in such radio networks of diameter 3. This claim turns out to be incorrect in this model (although it is valid in a more pessimistic model [R. Bar-Yehuda, O. Goldreich, and A. Itai, Errata Regarding "On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization," http://www.wisdom.weizmann.ac.il/mathusers/oded/p\_bgi.html, 2002]). We construct an algorithm that broadcasts in logarithmic time on all graphs from the Bar-Yehuda, Goldreich, and Itai paper (BGI). Moreover, we show how to broadcast in sublinear time on all n-node graphs of diameter $o(\log \log n)$. On the other hand, we construct a class of graphs of diameter 4, such that every broadcasting algorithm requires time $\Omega(\sqrt[4]{n})$ on these graphs. In view of the randomized algorithm from BGI, running in expected time ${\cal O}(D \log n + \log ^2 n)$ on all $n$-node graphs of diameter D (cf. also a recent ${\cal O}(D \log (n/D) + \log ^2 n)$-time algorithm from [D. Kowalski and A. Pelc, Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, Boston, 2003, pp. 73--82; A. Czumaj and W. Rytter, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 492--501]), our lower bound gives the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting, under the considered model of radio communication.

Abstract: We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the network. Aim of the proposed techniques is to define broadcasting mechanisms that are simple, thus generating low overhead, energy efficient, for deployment in resource-constrained networks, and reliable, in that all the nodes receive the intended message with very high probability. The three schemes follow two different approaches for data dissemination. The first approach relies on the idea of identifying local rules for sparsifying the network topology. The resulting virtual topology is the actual structure through which broadcasting is performed. While techniques for sparsifying the network topology have been proposed before, our solution makes no use of location information. The second approach follows the line of on-line algorithms for the implementation of probabilistic flooding. In this case, the proposed algorithm has been studied analytically, which lead to asymptotic proofs that all nodes are successfully reached by the broadcast message with very high probability. A comparative performance evaluation has been performed via simulations among the three proposed techniques and a previous solution for ad hoc broadcast. We have evaluated various metrics of interests versus different nodes distributions, which include the uniform and a more realistic ``Hill distribution" that takes into consideration certain characteristics of sensor nodes deployment in uneven areas.Our results show that the on-line approach and one of the proposed virtual topology-based solutions offer the desirable compromise between energy saving, network load and reliability.

Abstract: This paper investigates the soft decision decoding techniques for wireless COFDM systems. A new method to estimate the channel state information (CSI) for the Viterbi decoder is proposed, which overcomes the problem of reliability metric of transmitted signals in wireless as well as mobile channels. The CSI for each subcarrier is calculated as a properly defined squared Euclidean distance. On the basis of which, a soft decision decoding scheme to improve reception performance under multipath fading interference and co-channel interference (CCI) from existing analog broadcasting signals is also proposed. The simulation results show that the scheme can provide a compatible improvement to the terrestrial digital video broadcasting (DVB-T) system. The proposed scheme is also suitable for other wireless COFDM transmission systems.

Abstract: Methods and apparatus are presented for efficient broadcasting in wireless packet data systems. A single MAC_ID is used for broadcasting to a group of subscribers. By using the channel quality information of the group of subscribers, a base station determines the identity of the subscriber with the worst channel conditions. The timing and the transmission format of the multi-cast are then tailored so that the subscriber with the worst channel conditions is capable of recovering the transmission. If the timing and the transmission format is chosen in relation to subscriber with the worst channel conditions, it is probable that other subscribers will be able to recover the transmission as well. Hence, only a single MAC_ID need to be used to make a single broadcast, rather than sending multiple transmissions to multiple subscribers.

Abstract: Conditional access system (CAS) is one of the key techniques in digital television (DTV) broadcast, which is used to charge the subscriber for subscribing fee by scrambling the program information. Scrambling algorithm and key distribution are the most important parts for CAS. In this paper, we proposed a new key distribution scheme based on hierarchical access control for conditional access system in digital television broadcast. Our key distribution scheme can greatly reduce the encrypting computation and acquire higher efficiency and security. Moreover, the proposed scheme is more flexible in processing joining and leaving of subscriber, which is very important for service provider to manage the subscriber.

Abstract: Data communication for wired and or for wireless communication and broadcasting systems for broadband, ultra wideband and ultra Narrowband (UWN) reconfigurable, interoperable communication and broadcasting system architectures. Combinations and hybrids of ultra wideband (UWB), ultra narrowband (UNB) and efficient broadband wireless, baseband, intermediate frequency (IF) and radio frequency (RF) implementations for Bit Rate Agile (BRA) reconfigurable and interoperable systems. Processing the data signals, of clock signals, and/or carrier cycles waveforms leads to shaped radio-frequency (RF) cycles, waveforms and wavelets.

Abstract: Systems and methods for intelligent data broadcasting techniques are disclosed. A data broadcasting system receives profile information representative of information desired by subscribers to the data broadcasting system. Broadcast content in one or more broadcast regions may be adjusted in response to changes in aggregate user preferences in the region.

Abstract: Methods and apparatus are described for broadcasting content. Encoding the content to be multicast/broadcast into multiple streams, wherein at least one stream provides a base portion of the content, and additional streams provide enhancements to the content. A wireless communication device receives the broadcast and decodes streams in accordance with the reception capabilities of the wireless device. The configuration of the wireless device can be determined based on the wireless device's capability to decode multiple streams. In addition, the configuration of the wireless device can be determined based on a subscriber level of the wireless device.

Abstract: The invention discloses a transmitting process for realizing multimedia broadcast and multiple broadcast services comprising at least, A. the wireless network controller assigning a group mark for each user in the subzone, B. the base station creating a group mark disturbance sequence according to the group mark, forming the first time slot information of the multimedia broadcast and multiple broadcast service control channel, C. the base station assigning the descendent channel to the multimedia broadcast and multiple broadcast services according to the channel quality of the present receiving signal by the group users. The invention realizes the high speed data broadcasting service under the condition of limited wireless resources.

Abstract: A TV broadcasting system comprises: an outward broadcast link to reach each of a plurality of user receiver installations via satellite or via a terrestrial channel, and a return link from each of said plurality of users, said return channel being a terrestrial channel via a wide area network, typically a WAN, of which WAN said user receiver installations form a node. The WAN may also support an uplink. A satellite or terrestrial receiver installation is modified with an extra terrestrial antenna for the WAN and a splitter combiner allows the already installed cable link to the TV receiver to be retained. A residential gateway allows a household LAN and communication enabled devices to be supported via the TV/WAN infrastructure.

Abstract: In this paper, we propose an efficient method to broadcast digital television signals using single frequency networks (SFNs) within the Advanced Television Systems Committee (ATSC) transmission systems. In implementing the SFNs of an 8-vestigial side band (8-VSB) Digital Television (DTV) system, the ambiguity problem of the trellis coder is unavoidable in a conventional ATSC transmission system. We propose a memory initialization of the trellis coder to resolve this ambiguity problem. Since the proposed scheme to synchronize multiple transmitters minimizes the changes from the conventional ATSC system, the hardware complexity for these changes is very low. Our simulation results show that the proposed scheme makes a less than 0.1 dB degradation at the threshold of visibility with a bit error rate of 3 ×10 -6 in the additive white

Abstract: An audio/visual programming content broadcasting service is provided to a user. Programming content ('content data') is prestored on storage module (7) of a user's storage terminal I and/or content data is downloaded from content data provider (19). The content data is encrypted and is of no use to the user in the forrn stored in storage module (7). Schedule data provider (15) transmits to the user's storage terminal (1), via mobile telecominunications network (17), data controlling the times and dates at which the content data is to be made available to the user. The schedule data also includes data enabling decryption of the content data. Schedule data therefore controls the distribution of the content data to the user's television monitor (3) and/or audio system (5) so that the video/audio programming available to the user can be controlled. Advantageously, the CPU (13) of the storage module I provides a graphical user interface (23) by means of the television monitor (3) in order to allow the user to respond to particular content data - for example, to purchase that content data for unrestricted future viewing/listening or to purchase a product or service advertised by the content data.

Abstract: We study an algorithm, originally defined by Lyui (1991), for assigning collision-free broadcast transmissions for packet radio networks. The method has a number of advantages - it is distributed, fair, permits each terminal to calculate a different frame size, requires only a limited exchange of information, and does not require a contention-based channel-access protocol. These properties make the assignment algorithm particularly useful for dynamic ad hoc networks because the transmission assignments can be easily and quickly adapted to local changes in the topology. An improved description of Lyui's algorithm is given and new simulation results are presented to demonstrate the properties of the transmission assignments for a variety of large networks.

Abstract: A method and apparatus of broadcasting is provided that has a geographic identifier memory, an overlay memory storing an overlay, a receiver circuit for receiving a broadcast signal and a control circuit. The control circuit displays the overlay on the broadcast signal in response to the geographic identifier.

Abstract: The DVB-S2 standard (ETSI: EN 302 307. Digital Video Broadcasting (DVB): second generation framing structure, channel coding and modulation systems for Broadcasting, Interactive Services, News Gathering and other broadband satellite applications (DVB-S2)) has been conceived for several satellite broadband applications: Television Broadcast Services, Interactive Services including Internet Access by consumers, Professional Applications such as Digital Satellite News Gathering (DSNG) and TV distribution, data trunking. This paper focuses on the profiles supporting interactive type of services, for which Adaptive Coding and Modulation (ACM) has been included in the new generation of the standard. Following the DVB-S2 specifications, a number of modem configurations and tools are made available for implementing ACM in interactive systems. However, the different approaches have important impacts on the design of the system architecture and of the scheduling/resource management algorithms. The aim of the present contribution is providing a first discussion on the critical issues at system and MAC level, which need to be addressed when implementing a DVB-S2 ACM system. A general introduction to ACM is also provided, as well as an illustration of the key elements included in the DVB-S2 standard for supporting physical layer adaptivity. Copyright © 2004 John Wiley & Sons, Ltd.

Abstract: The present invention provides a terminal capable of receiving information corresponding to scenes of a television broadcast while the television broadcast is being viewed on a television set. A contents delivery system includes the terminal and an output device for receiving and displaying broadcast data delivered from a broadcasting station. The terminal has an identification information acquisition section for acquiring identification information displayed on the screen of the output device, the identification information being included in the broadcast data and changing with time. A relevant information extractor extracts relevant information, relating to contents to be broadcast according to the broadcast data, from the identification information. An output section outputs the relevant information extracted by the relevant information extraction section.

Abstract: A method for permitting mobile stations in idle mode to select a cell based on services provided by the cell. Network control of service based selection is regulated by a new broadcast parameter broadcasting whether a particular cell will allow service based cell selection.

Abstract: The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies like GPS, this opens up an exciting domain of location based services, allowing a mobile user to query for objects based on its current position. Main bottlenecks in such infrastructures are the draining of power of the mobile devices and the limited network bandwidth available. To alleviate these problems, broadcasting spatial information about relevant objects has been widely accepted as an efficient mechanism. An important class of queries for such an infrastructure is the k-nearest neighbor (kNN) queries, in which users are interested in k closest objects to their position. In this paper, we describe mechanisms to perform exact kNN search on conventional sequential-access R-trees, and optimize established kNN search algorithms. We also propose a novel use of histograms for guiding the search and derive analytical results on maximum queue size and node access count. In addition, we discuss the effects of different broadcast organizations on search performance and challenge the traditional use of Depth-First (dfs) organization. We also extend our mechanisms to support kNN search with non-spatial constraints. While we demonstrate our ideas using a broadcast index, they are equally applicable to any kind of sequential access medium like tertiary tape storage. We validate our mechanisms through an extensive experimental analysis and present our findings.

Abstract: Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.

Abstract: A broadcast method and communication system of a wireless network is disclosed. In a wireless network consisting of a plurality of connected devices in which one device is selected to be a coordinator and the rest of the devices are synchronized to a synchronous signal broadcasted by the coordinator, the broadcast method includes the steps of checking whether one of a current channel and a PAN ID of the wireless network needs to be changed; and inserting a change information for changing one of the channel and the PAN ID in the synchronous signal and broadcasting the synchronous signal, when one of the channel and the PAN ID is determined to be changed in the checking step.

Abstract: The present invention includes methods in an interoperability system for: notifying a user in a first communication system that a trunked radio system is ready to receive data; broadcasting or distributing an emergency announcement from a trunked radio system to the other radio systems in the interoperability system; a user of one communication system using vocalic commands to establish a patch with another radio system; and enabling a PSTN device to more effectively communicate with radio systems in the interoperability system.