• Journal of Korea Entertainment Industry Association
• /
• v.15 no.6
• /
• pp.1-13
• /
• 2021

This study explored the mechanism by which Trot gained a superior position in the broadcasting contents market after the TV Chosun audition program was broadcast. We analyzed the narrative structure of the program to determine what differentiation and popularization strategy the trot audition program took from the existing audition program, and analyzed in-depth interviews with music experts and interviews with the production team. appealed to viewers with a strategy that reversed the success strategy of existing audition programs. First, the strong/non-competent participants did not compete with each other, but rather the strong/skilled players competed against each other. This trot audition set the singing ability as a new 'discourse on sincerity'. Second, we broke away from the 'demon editing', which was considered essential for audition programs, took a strategy of excluding villains. Third, we broke the practice of audition programs that were supposed to show expertise in specific genres, such as idol music, hip-hop, and bands, and combined trot with various genres. Fourth, unlike previous audition programs that mainly targeted specific generations or genders, the strategy was to expand the audience by targeting various age groups. Fifth, it has formed a middle-aged fandom with a 'subtitle strategy' that uses subtitles well to arouse viewers' interest and help empathize.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.47-59
• /
• 2009

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.31-40
• /
• 2016

In vehicular ad-hoc networks (VANETs), vehicles sense information on emergency incidents (e.g., accidents, unexpected road conditions, etc.) and propagate this information to following vehicles and a server to share the information. However, this process of emergency message propagation is based on multiple broadcast messages and can lead to broadcast storms. To address this issue, in this work, we use a novel approach to detect the vehicles that are farthest away but within communication range of the transmitting vehicle. Specifically, we discuss a signal-to-noise ratio (SNR)-based linear back-off (SLB) scheme where vehicles implicitly detect their relative locations to the transmitter with respect to the SNR of the received packets. Once the relative locations are detected, nodes that are farther away will set a relatively shorter back-off to prioritize its forwarding process so that other vehicles can suppress their transmissions based on packet overhearing. We evaluate SLB using a realistic simulation environment which consists of a NS-3 VANET simulation environment, a software-based WiFi-IP gateway, and an ITS server operating on a separate machine. Comparisons with other broadcasting-based schemes indicate that SLB successfully propagates emergency messages with latencies and hop counts that is close to the experimental optimal while reducing the number of transmissions by as much as 1/20.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.12-23
• /
• 2009

Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1062-1070
• /
• 2017

Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.532-543
• /
• 2004

Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.511-520
• /
• 2011

In this paper, we introduce a multiuser (MU) scheduling method for multiuser amplify-and-forward relay systems, which selects both the transmission mode, i.e., either one- or two-hop transmission, and the desired user via two steps. A closed-form expression for the average achievable rate of the proposed scheduling is derived under two transmission modes with MU scheduling, and its asymptotic solution is also analyzed in the limit of large number of mobile stations. Based on the analysis, we perform our two-step scheduling algorithm: the transmission mode selection followed by the user selection that needs partial feedback for instantaneous signal-to-noise ratios (SNRs) to the base station. We also analyze the average SNR condition such that the MU diversity gain is fully exploited. In addition, it is examined how to further reduce a quantity of feedback under certain conditions. The proposed algorithm shows the comparable achievable rate to that of the optimal one using full feedback information, while its required feedback overhead is reduced below half of the optimal one.

• The Plant Pathology Journal
• /
• v.18 no.5
• /
• pp.259-265
• /
• 2002

Apple mosaic virus (ApMV), a member of the genus Ilarvirus, was detected and isolated from diseased 'Fuji' apple (Malus domestica) in Korea. The coat protein (CP) genes of two ApMV strains, denoted as ApMV-Kl and ApMV-K2, were amplified by using the reverse transcription and polymerase chain reaction (RT-PCR) and were analyzed thereafter. The objectives were to define the molecular variability of genomic information of ApMV found in Korea and to develop virus-derived resistant gene source for making virus-resistant trans-genic apple. RT-PCR amplicons for the APMVS were cloned and their nucleotide sequences were determined. The CPs of ApMV-Kl and ApMV-K2 consisted of 222 and 232 amino acid residues, respectively. The identities of the CPs of the two Korean APMVS were 93.1% and 85.6% at the nucleotide and amino acid sequences, respectively. The CP of ApMV-Kl showed 46.1-100% and 43.2-100% identities to eight different ApMV strains at the nucleotide and amino acid levels, respectively. When ApMV-PV32 strain was not included in the analysis, ApMV strains shared over 83.0% and 78.6% homologies at the nucleotide and amino acid levels, respectively. ApMV strains showed heterogeneity in CP size and sequence variability. Most of the amino acid residue differences were located at the N-termini of the strains of ApMV, whereas, the middle regions and C-termini were remarkably conserved. The APMVS were 17.(1-54.5% identical with three other species of the genus Ilarviyus. ApMV strains can be classified into three subgroups (subgroups I, II, and III) based on the phylogenetic analysis of CP gene in both nucleotide and amino acid levels. Interestingly, all the strains of subgroup I were isolated from apple plants, while the strains of subgroups II and III were originated from peach, hop, or pear, The results suggest that ApMV strains co-evolved with their host plants, which may have resulted in the CP heterogeneity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1296-1306
• /
• 2015

Nowadays the research of energy saving on the IP networks have been studied the various methods in many research institutes. This paper suggests the energy saving method in IP networks which have the various energy profiles, and analyzes its energy saving characteristics in detail. Especially this paper proposes the energy profile based OSPF routing method which have the selectable weighted value in OSPF metric and energy consumption in IP network. This paper analyzes the energy saving effects of the various situations to minimize the energy consumption using the various weighted value on the proposed scheme. The results show that the energy saving efficiency can get about 67% at in ingress input load ${\rho}=0.5$ by using random energy profiles in IP networks. Although the number of hops is a slight increased due to routing the paths for the minimum energy consumption in the algorithm of this method, the increment hop number is limited the mean 1.4 hops. This paper confirms that the energy profile of core router has the large effects of energy saving than the energy profile of edge router, and the proposed method has the excellent energy saving characteristics in IP networks.