• Journal of Broadcast Engineering
• /
• v.21 no.5
• /
• pp.689-703
• /
• 2016

A dispute over price for retransmitting terrestrial channels between Terrestrial Television Systems and Cable TV System Operator(SO)s has been underway up to now since 2007 and expected to last unless there is a measure of extraordinary countermeasures. Thus, in this paper, we present a scheme for calculating the reasonable price on retransmitting terrestrial channels. Re-transmission price calculation scheme is presented in two ways. One is to calculate the price for the extent to which Terrestrial broadcasters and Cable broadcasters contribute, and the other is to calculate the price for terrestrial channels retransmitted by applying the method of Cable TV PP program fee basis. In addition, on profit-sharing scheme and criteria for program fee we present two ways of subscription, which are flat sum system and fixed rate system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1043-1049
• /
• 2009

Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.77-85
• /
• 2015

This paper presents our performance evaluation after the way of minimizing waiting times between channel switching for eMBMS(evolved Multimedia Broadcast/Multicast Services) technique in LTE-Advanced systems. Existing composition of MBMS using IGMP(Internet Group Management Protocol) transfers the data with Multicast from BM-SC(Broadcast Multicast Service Center) to eNB(evolevd Node B) and with Broadcast from eNB to UE(User Equipment). Therefore, in case of channel switching, IGMP Join report should be transferred to BM-SC and then wait user's contents to be retransferred from eNB. To achieve this, Subscriber Channel technique of priorities is used for minimizing waiting times between channel switching as UE broadcasts favorite channels in advance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.35-43
• /
• 2014

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels in the environment where multiple-data queries are submitted, and proposes a new data allocation scheme named DAMA. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the moving average of its access probability. DAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly according to the query size. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of DAMA is superior to other schemes in terms of the average response time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.11-12
• /
• 2007

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.103-110
• /
• 2009

We are witnessing rapid increase of the number of wireless devices available today such as cell phones, PDAs, Wibro enabled devices. Because of the inherent limitation of the bandwidth available for wireless channels, broadcast systems have attracted the attention of the research community. The main problem in this area is to develop an efficient broadcast program. In this paper, we propose a dynamic broadcast method that overcomes the limitations of static broadcast programs. It optimizes the scheduling based on the probabilistic model of user requests. We show that dynamic broadcast system can indeed improve the quality of service using user requests. This paper extends our previous work in [1] to include more thorough explanation of the proposed methodology and diverse performance evaluation models.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2014

Block diagonalization (BD) has been proposed as a simple and effective technique in multiuser multiple-input multiple-output (MU-MIMO) broadcast channels. However, when channel state information (CSI) knowledge is limited at the transmitter, the performance of the BD may be degraded because inter-user interference cannot be completely eliminated. In this paper, we propose an efficient CSI quantization technique for BD precoded systems with limited feedback where users supported by a base station are selected by dynamic scheduling. First, we express the received signal-to-interference-plus-noise ratio (SINR) when multiple data streams are transmitted to the user, and derive a lower bound expression of the expected received SINR at each user. Then, based on this measure, each user determines its quantized CSI feedback information which maximizes the derived expected SINR, which comprises both the channel direction and the amplitude information. From simulations, we confirm that the proposed SINR-based channel quantization scheme achieves a significant sum rate gain over the conventional method in practical MU-MIMO systems.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.130-138
• /
• 2000

The paper describes a push system, a broadcasting system in the internet, which is developed for internet and intranet use. In this paper, we carried out research on the method to support the large number of users in the intranet environment. Particularly the paper analyzes the effects on the network traffic according to the number of the user connected to the push system and the frequency of the connections when push servers are distributed over the intranet. Push system described here uses two different kinds of channels, common channel and local channel. Common channel is the channel to be replicated among the push servers in the intranet. This paper shows that the method using the common channel synchronization is efficient in supporting the large number of intranet users. We introduce an algorithm to make the interconnections between channels efficiently amongpush servers distributed over the intranet.

• The Research Journal of the Costume Culture
• /
• v.29 no.2
• /
• pp.289-306
• /
• 2021

The study aims to define the Korean Wave as global attention to Korea's unique culture and consider the specificity of traditional Korean fashion images in Korean Wave content. The research method of this study is a case study through literature research. In order to collect Korean Wave content on YouTube, 24 channels with the highest number of views were selected from among content uploaded from 2018 to the present through keyword search, and up to two channels with high views showing traditional Korean fashion images. As a result of selecting the analysis target, 41 Korean Wave videos and 368 costumes were selected and analyzed based on fashion style elements, including item, color, detail, motif, styling, silhouette, and accessory. As a result of the study, music, broadcast, fashion, and other content were found in the Korean Wave content fields in which Korean fashion style appeared, and the characteristics of each field were derived. Music content was characterized by fashion style excluding stereotypes about traditional Korean costume, broadcast and fashion content was characterized by fashion style inherited from traditional costume, and other content was characterized by symbolic fashion style of traditional culture. This study is meaningful in revealing the formative characteristics of traditional Korean design elements recently shared online through the study of Korean traditional fashion images in Korean Wave content.