Provider authentication is necessary in bidirectional broadcasting services, and a digital signature scheme is often used to prevent an adversary from attempting impersonation. The cost of secure signing key management is extremely high. In addition, the key has to be updated very often, since it is frequently used. The result is that the verification key also has to be updated very often, and its redistribution cost is huge. These costs are real and substantive problems, especially when the number of users is large. In this paper, we propose a system that dramatically reduces these costs. In the system, the signing key is updated, but the corresponding verification key does not have to be updated. This means that the signing key can be updated without any cost for redistributing the verification key and that the system is secure against the threat of signing key leakage, since the key can be frequently updated. Moreover, we propose a new key management method that divides a conventional key management server's role into two. The use of a key-insulated signature (KIS) scheme enables low-cost and more secure key management with two servers. Finally, to make a bidirectional broadcasting service more secure even if the signing key is leaked, we developed a new strong KIS scheme. We performed an experiment that assessed the cost of our strong KIS scheme and found that it is sufficiently low. Accordingly, a provider authentication system employing this scheme would be more efficient and would have lower key redistribution and network costs in comparison with conventional authentication systems.

Recently, network coding has been applied to the loss recovery of reliable multicast in wireless networks, where multiple lost packets are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. In this paper, we first prove that maximizing the number of lost packets for XOR-ing, which is the key part of the available network coding-based reliable multicast schemes, is actually a complex NP-complete problem. To address this limitation, we then propose an efficient heuristic algorithm for finding an approximately optimal solution of this optimization problem. Furthermore, we show that the packet coding principle of maximizing the number of lost packets for XOR-ing sometimes cannot fully exploit the potential coding opportunities, and we then further propose new heuristic-based schemes with a new coding principle. Simulation results demonstrate that the heuristic-based schemes have very low computational complexity and can achieve almost the same transmission efficiency as the current coding-based high-complexity schemes. Furthermore, the heuristic-based schemes with the new coding principle not only have very low complexity, but also slightly outperform the current high-complexity ones.

A multicast content service, including numerous devices, requires an efficient group key management scheme as one of its core components. The purpose of group key management is to provide a secure key-sharing scheme among the members of a group so that messages transmitted via broadcasting or multicasting are not exposed to non-members. The Chinese Remaindering Group Key (CRGK) is an efficient group key management scheme based on the Chinese Remainder Theorem (CRT). It optimizes the number of re-key messages, the user-side key computation cost, and the number of stored keys. However, CRGK is not fit for a group with a large number of members because of the high computation complexity of the CRT. In this paper, we propose a Hierarchical CRGK (HCRGK) scheme that supports a group with a large number of members. We improved CRGK by adopting it to include an n-ary tree structure. The tree approach simplifies the group key management by distributing the group key computation to subgroups. Our scheme requires at most (log m N + 1) re-key messages for a group with N members and a short computation time even when the group is very large.

We present a 60-GHz wireless through-repeater system based on self-heterodyne transmission scheme with the potential to optimize the carrier-to-interference and noise ratio (CINR) performance according to the transmission distance. The phase-noise degradation through a 60-GHz repeater link is not a serious concern when we employ the self-heterodyne transmission scheme. Multichannel interferences caused by third-order intermodulation distortions are efficiently suppressed by setting a high power ratio of LO carrier to RF signals in the self-heterodyne transmission. However, this high power ratio results in a lower carrier-to-noise ratio (CNR) and becomes unsuitable for improving link performance if the transmission distance increases. In order to facilitate a solution, we propose and make an embodiment of 60 GHz self-heterodyne transmitters that provide flexible control over the power ratio of LO to RF in a range of 10 dB ranges. With them, we successfully demonstrate terrestrial digital broadcasting signals on five channels and optimize their performance for wireless through-repeater applications.

The R&D in satellite communications in Korea has been driven mainly by KCC (Korea Communications Commission) but in a small scale compared to Korea space development program organized by MEST (Ministry of Education, Science and Technology). Public and civilian satcom sector R&D has been led mainly by ETRI with small/medium companies contrary to rare investment in private sector while military sector R&D has been orchestrated by ADD with defense industry. By the COMS (Communication, Ocean and Meteorological Satellite) experimental Ka-band payload, Korea pursues a space qualification of own technology for national infrastructure evolution as well as industrialization of space R&D results. Once COMS launched and space qualified in 2009, subsequent application experiments and new technology R&D like UHDTV will entail service and industry promotion. The payload technology is expected for the next Korean commercial satellites or for new OBP satellites. The COMS ground control system and GNSS ground station technologies are under development for COMS operation and enhanced GNSS services along with advent of Galileo respectively. Satellite broadband mobile VSAT based on DVB-S2/RCS (+M) and low profile tracking antennas have been developed for trains, ships, and planes. While APSI is developing GMR-1 based Thuraya handset functions, ETRI is designing IMT-Advanced satellite radio interface for satellite and terrestrial dual-mode handheld communication system like Japanese STICS, with universities' satellite OFDM researches. A 21 GHz Ka-band higher-availability scalable HD broadcasting technology and SkyLife's hybrid satellite IPTV technology are being developed. In near term Korea will extend R&D programs to upgrade the space communication infrastructure for universal access to digital opportunity and safer daily life from disaster, and to promote space green IT industrialization, national security, and space resources sovereign. Japanese stakeholders are invited to establish a collaborative R&D with Korea for mutual benefit of the future.

It is an almost classical problem to develop an efficient broadcast mechanism in multi-hop networks. However, the problem is far from solved though a lot of research till recently has been focused on it. In this letter, we analyze the optimal distribution of forwarding nodes that can doubly cover the network with the minimum transmission overlapped area in a multi-hop wireless network where nodes are ideally distributed. On this basis we propose a simple and effective broadcast method to significantly increase the transmission efficiency and deliverability. In this method, the total number of retransmissions is quite low since each node only needs to select three forwarding nodes, and high deliverability can be achieved for the set of forwarding nodes provide nearly double coverage to the whole network. In addition, the method has excellent scalability in large scale networks and highly dynamic environment.

Wireless LAN access is now being offered by small personal terminals in addition to laptops. Since these terminals have very limited battery capacity, wireless LAN interfaces that offer some form of power saving are essential. IEEE802.11. specifies PSM (Power save management); it reduces power consumption by suspending some communications functions. However, since Multicasting and Broadcasting are invariably received by all terminals regardless of PSM, the terminals unnecessarily consume electric power, even if the terminal is not multicast subscriber. This paper clarifies this problem, and proposes a scheme for reducing power consumption. The results of an experiment confirm its excellent performance.

Multi-source broadcasting is one of the information dissemination problems on communication networks such that some units disseminate distinct messages to all other units. In this paper, we study multi-source broadcasting on the de Bruijn and Kautz digraphs which are the models of interconnection networks. In [8] and [12], a cycle-rooted tree which has a large root-cycle is constructed by composition of isomorphic factors, and the multi-source broadcasting is executed on the cycle-rooted tree. On the other side, we execute multi-source broadcasting on each isomorphic factors at the same time. We present a method for multi-source broadcasting using isomorphic cycle-rooted trees which factorize these digraphs, and investigate its efficiency.

This letter proposes a busy-tone based scheme for reliable and efficient broadcasting in mobile ad hoc networks. Control packets such as RTS, CTS and ACK are ignored in the broadcast scheme, and two busy tones are used, one for channel reservation and the other for negative acknowledgement. Unlike traditional schemes for reliable broadcasting, the proposed scheme is highly efficient as it achieves both collision avoidance and fast packet loss recovery. Simulation results are presented which show the effectiveness of the proposed scheme.

Considering digital multimedia broadcasting (DMB) with reverse channels, we propose a novel scheduling algorithm for data dissemination as a combination of push and pull schemes. After collecting statistics of requests from clients, the server partitions the data items into hot and cold sets, according to the number of requests. The broadcast server schedules and broadcasts hot items periodically based on a push algorithm. On an empty slot between hot items scheduled, the server broadcasts a cold item based on an on-demand pull mechanism. Simulations show that our proposed algorithm achieves high successful response ratio with a response time small enough to be practical.

In order to improve the synchronization performance of the OFDM-based FM broadcasting system, this letter addresses the problem of delay selection when the system uses a cyclic delay diversity (CDD) scheme. By proper selection of the amount of cyclic delay, an improved fine carrier frequency offset estimator is derived. By computer simulation, the proposed estimator is shown to benefit from properly chosen delay parameter and perform robustly.

Flooding is an indispensable operation for providing control or routing functionalities to mobile ad hoc networks (MANETs). Previously, many flooding schemes have been studied with the intention of curtailing the problems of severe redundancies, contention, and collisions in traditional implementations. A recent approach with relatively high efficiency is 1HI by Liu et al., which uses only 1-hop neighbor information. The scheme achieves local optimality in terms of the number of retransmission nodes with time complexity Θ(nlog n), where n is the number of neighbors of a node; however, this method tends to make many redundant transmissions. In this paper, we present a novel flooding algorithm, 2HBI (2-hop backward information), that efficiently reduces the number of retransmission nodes and solves the broadcast storm problem in ad hoc networks using our proposed concept, "2-hop backward information." The most significant feature of the proposed algorithm is that it does not require any extra communication overhead other than the exchange of 1-hop HELLO messages but maintains high deliverability. Comprehensive computer simulations show that the proposed scheme significantly reduces redundant transmissions in 1HI and in pure flooding, up to 38% and 91%, respectively; accordingly it alleviates contention and collisions in networks.

In a multi-hop mobile ad-hoc network, broadcasting is an elementary operation to support many applications. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in mobile ad-hoc network. How to decide whether rebroadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose an enhanced broadcasting scheme, which can reduce rebroadcast packets without loss of reachability. Simulation results show that the proposed scheme offers better reachability and efficiency than other previous schemes.

In this letter, we propose a multi-cell cooperation method for broadcast packet transmission in the OFDM-based cellular system with multiple transmit antennas. In the proposed method, to transmit two streams of spatially demultiplexed or transmit diversity coded symbols, we divide a coded packet into subparts to each of which different cell group and antenna pairs are assigned. It is shown that the proposed method reduces the outage probability with only negligible increase in channel estimation.

This paper proposes an adaptive transmission control method for massive and intensive telecommunication traffic generated by communication-broadcasting integrated services. The proposed method adaptively controls data transmissions from viewers depending on the congestion states, so that severe congestion can be effectively avoided. Furthermore, it utilizes the broadcasting channel which is not only scalable, but also reliable for controlling the responses from vast numbers of viewers. The performance of the proposed method is evaluated through experiments on a test bed where approximately one million viewers are emulated. The obtained results quantitatively demonstrate the performance of the proposed method and its effectiveness under massive and intensive traffic conditions.

The performance of speech translation systems combining automatic speech recognition (ASR) and machine translation (MT) systems is degraded by redundant and irrelevant information caused by speaker disfluency and recognition errors. This paper proposes a new approach to translating speech recognition results through speech consolidation, which removes ASR errors and disfluencies and extracts meaningful phrases. A consolidation approach is spun off from speech summarization by word extraction from ASR 1-best. We extended the consolidation approach for confusion network (CN) and tested the performance using TED speech and confirmed the consolidation results preserved more meaningful phrases in comparison with the original ASR results. We applied the consolidation technique to speech translation. To test the performance of consolidation-based speech translation, Chinese broadcast news (BN) speech in RT04 were recognized, consolidated and then translated. The speech translation results via consolidation cannot be directly compared with gold standards in which all words in speech are translated because consolidation-based translations are partial translations. We would like to propose a new evaluation framework for partial translation by comparing them with the most similar set of words extracted from a word network created by merging gradual summarizations of the gold standard translation. The performance of consolidation-based MT results was evaluated using BLEU. We also propose Information Preservation Accuracy (IPAccy) and Meaning Preservation Accuracy (MPAccy) to evaluate consolidation and consolidation-based MT. We confirmed that consolidation contributed to the performance of speech translation.

In this letter, we propose a novel singular value decomposition zero-forcing beamforming (SVD-ZFBF) relaying scheme in the multiuser downlink MIMO broadcasting channel with fixed relays. Based on the processing scheme, we apply SUS [5] to select users at the relay station (RS) and develop a joint power allocation strategy at the base station (BS) and RS. By increasing the power at RS or selecting active users to obtain more multiuser diversity, SVD-ZFBF can approach an upper bound and outperform SVD-ZFDPC [1] with much lower complexity. Moreover, we show that the noise power ratio of RS to users significantly impacts the performance.

This paper proposes a method of improving reception of digital satellite broadcasting in a moving vehicle. According to some studies, the antennas used for mobile reception will be smaller in the next generation and reception will be more difficult because of a fading multipath channel with delays in a low carrier-to-noise ratio. Commonly used approaches to reduce the inter symbol interference caused by a fading multipath channel with delays are pilot sequences and diversity reception. Digital satellite broadcasting, however, does not transmit pilot sequences for channel estimation and it is not possible to install multiple antennas in a vehicle. This paper does not propose any change to the broadcasting standards but discusses how to process currently available digital satellite signals to obtain better results. Our method does not rely on the pilot sequences or diversity reception, but consists of channel estimation and stochastic inference methods. For each task, two methods are proposed. The maximum likelihood estimation and higher order statistics matching methods are proposed for the estimation, and the marginal with the joint probability inference methods are proposed for the stochastic inference. The improvements were confirmed through experiments with numerical simulations and real data. The computational costs are also discussed for future implementation.

Broadcasting is an elementary operation in wireless multi-hop networks. Flooding is a simple broadcast protocol but it frequently causes serious redundancy, contention and collisions. Probability based methods are promising because they can reduce broadcast messages without additional hardware and control packets. In this paper, the counter-based scheme which is one of the probability based methods is focused on as a broadcast protocol, and the RAD (Random Assessment Delay) Extension is proposed to improve the original counter-based scheme. The RAD Extension can be implemented without additional hardware, so that the strength of the counter-based scheme can be preserved. In addition, we propose the additional algorithm called Hop Count Aware RAD Extension to establish shorter path from the source node. Simulation results show that both of the RAD Extension and the Hop Count Aware RAD Extension reduce the number of retransmitting nodes by about 10% compared with the original scheme. Furthermore, the Hop Count Aware RAD Extension can establish almost the same path length as the counter-based scheme.

This letter proposes a Cell-based Hybrid Index (CHI) for energy conserving k Nearest Neighbor search on air. The proposed CHI provides global knowledge on data distribution for fast decision of the search space and local knowledge for efficient pruning of data items. Simulations show that CHI outperforms the existing indexing schemes in terms of tuning time and energy efficiency. With respect to access time, it outperforms them except the distributed indexing scheme optimized for access time.