• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.44-53
• /
• 2006

In this paper, we propose a new Active Channel Scanning scheme by scanning active channels employed by neighbor APs' with the handover counts and non overlap channel information for fast handover. Under the proposed scheme, the mobile which has finished handover to connect a new APsends the neighbor AP's channel information learned by itself during handover to the new AP. And then, the new AP relays the neighbor channel information to the old AP. It decides a priority by handover counts and non overlap channel information for building a Neighbor Channel Table(NCT), and also sends the table information to its associated mobile nodes, periodically. As a result each mobile can scan only active neighbor APs' channels when performs handover based on the referring to NCT information. Using NS-2 Simulator, we applied to supposed ACS that the result of simulation decides to sort by handover counts and non overlap channel information. we evaluate our proposed ACS scheme based on NCT along with the full scanning scheme and the selective scanning scheme. From simulation results, we show that the proposed scheme is advantageous over the other two schemes in terms of the number of scanning channels and the scanning latency.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.159-166
• /
• 2010

In this paper, to obtain the Minimum Spanning Tree (MST) from the graph with several nodes having the same weight, I applied both Bor$\dot{u}$vka and Kruskal MST algorithms. The result came out to such a way that Kruskal MST algorithm succeeded to obtain MST, but not did the Prim MST algorithm. It is also found that an algorithm that chooses Inter-MSF MWE in the $2^{nd}$ stage of Bor$\dot{u}$vka is quite complicating. The $1^{st}$ stage of Bor$\dot{u}$vka has an advantage of obtaining Minimum Spanning Forest (MSF) with the least number of the edges, and on the other hand, Kruskal MST algorithm has an advantage of always obtaining MST though it deals with all the edges. Therefore, this paper suggests an Hybrid MST algorithm which consists of the merits of both Bor$\dot{u}$vka's $1^{st}$ stage and Kruskal MST algorithm. When applied additionally to 6 graphs, Hybrid MST algorithm has a same effect as that of Kruskal MST algorithm. Also, comparing the algorithm performance speed and capacity, Hybrid MST algorithm has shown the greatest performance Therefore, the suggested algorithm can be used as the generalized MST algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.21-30
• /
• 2012

Sensor networks are composed of a great number of sensor nodes with constrained battery. Disjoint multipath scheme based flooding method has a merit that efficiently construct multipath in irregular networks, but causes lots of energy consumption in networks. Flooding method is not a suitable technology in wireless sensor networks with constrained battery. We introduce energy-efficient geographic routing scheme considered as an efficient, simple, and scalable routing protocol for wireless sensor networks. The geographic routing scheme on multipath generates a problem with a congestion. So we introduce the concept of multipath pipeline as a congestion avoidance strategy. But multipath pipelines have a big problem on the boundary of holes under irregular networks. We propose a novel disjoint multipath scheme as combined method with geographic routing scheme and hole detouring algorithm on multipath. A novel disjoint multipath scheme constructs disjoint multipath pipelines efficiently for reliability without a collision in irregular wireless sensor networks. Simulation results are provided to validate the claims.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3182-3194
• /
• 2000

It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.263-275
• /
• 2006

This paper introduces an interactive contents authoring system which can easily and conveniently produce interactive contents for the Terrestrial Digital Multimedia Broadcasting (T-DMB). For interactive broadcasting service, T-DMB adopted MPEG-4 BIFS technology. In order to the interactive service becomes flourishing on the market, various types of interactive contents should be well provided prior to the service. In MPEG-4 BIFS, broadcasting contents are described by the combination of a large number of nodes, routes and descriptors. In order to provide interactive data services through the T-DMB network, it is essential to have an interactive contents authoring system which allows contents authors to compose interactive contents easily and conveniently even if they lack any background on MPEG-4 BIFS technology. The introduced authoring system provides powerful graphical user Interface and produces interactive broadcasting contents in the forms of binary and textual format. Therefore, the BIFS contents authoring system presented in this paper would vastly contribute to the flourishing interactive service.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.5
• /
• pp.1129-1139
• /
• 2015

Inference process generates additional triples from knowledge represented in RDF triples of semantic web technology. Tens of million of triples as an initial big data and the additionally inferred triples become a knowledge base for applications such as QA(question&answer) system. The inference engine requires more computing resources to process the triples generated while inferencing. The additional computing resources supplied by underlying resource pool in cloud computing can shorten the execution time. This paper addresses an algorithm to allocate the number of computing nodes "elastically" at runtime on Hadoop, depending on the size of knowledge data fed. The model proposed in this paper is composed of the layered architecture: the top layer for applications, the middle layer for distributed parallel inference engine to process the triples, and lower layer for elastic Hadoop and server visualization. System algorithms and test data are analyzed and discussed in this paper. The model hast the benefit that rich legacy Hadoop applications can be run faster on this system without any modification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• The Korean Journal of Applied Statistics
• /
• v.33 no.5
• /
• pp.615-625
• /
• 2020

The document-term frequency matrix is a term extracted from documents in which the group information exists in text mining. In this study, we generated the document-term frequency matrix for document classification according to research field. We applied the traditional term weighting function term frequency-inverse document frequency (TF-IDF) to the generated document-term frequency matrix. In addition, we applied term frequency-inverse gravity moment (TF-IGM). We also generated a document-keyword weighted matrix by extracting keywords to improve the document classification accuracy. Based on the keywords matrix extracted, we classify documents using a deep neural network. In order to find the optimal model in the deep neural network, the accuracy of document classification was verified by changing the number of hidden layers and hidden nodes. Consequently, the model with eight hidden layers showed the highest accuracy and all TF-IGM document classification accuracy (according to parameter changes) were higher than TF-IDF. In addition, the deep neural network was confirmed to have better accuracy than the support vector machine. Therefore, we propose a method to apply TF-IGM and a deep neural network in the document classification.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.53-63
• /
• 2010

Recently, various monitoring systems are implemented actively by using wireless sensor networks(WSN). When implementing WSN-based monitoring system, there are three important issues to consider. At First, we need to consider a sensor node failure detection method to support the ongoing monitoring. Secondly, because sensor nodes use limited battery power, we need an efficient data filtering method to reduce energy consumption. At Last, a reducing processing overhead method is necessary. The existing Kalman filtering scheme has good performance on data filtering, but it causes too much processing overhead to estimate sensed data. To solve these problems, we, in this paper, propose a new data filtering scheme based on data statical analysis. First, the proposed scheme periodically aggregates node survival massages to support a node failure detection. Secondly, to reduce energy consumption, it sends the sample data with a node survival massage and do data filtering based on those messages. Finally, it analyzes the sample data to estimate filtering range in a server. As a result, each sensor node can use only simple compare operation for filtering data. In addition, we show from our performance analysis that the proposed scheme outperforms the Kalman filtering scheme in terms of the number of sending messages.

• Korean Journal of Breeding Science
• /
• v.51 no.4
• /
• pp.496-503
• /
• 2019

The soybean cultivar, 'Saegeum', has been developed for preparing soy-paste and tofu. The soybean cultivars 'Daepung' and 'SS98207-3SSD-168' were crossed in 2003 to obtain 'Saegeum'. Single seed descent method was used to advance the generation from F₃ to F₅, and the plant lines with promising traits were selected from F₆ to F₇ by pedigree method. The preliminary yield (PYT) and advanced yield trials (AYT) were conducted from 2009 to 2010, and the regional yield trial (RYT) was conducted in 12 regions between 2011 and 2013. The morphological characteristics of 'Saegeum' were as follows: determinate plant type, white flower, tawny pubescence color, and brown pod color. Flowering and maturity dates were August 2, XXXX and October 17, XXXX, respectively. Plant height, first pod height, number of nodes, number of branches, and number of pods were 79 cm, 18 cm, 16, 2.3, and 44, respectively. The seed characteristics of 'Saegeum' were as follows: yellow spherical shape, yellow hilum, and the 100-seed weight was 25.4 g. 'Saegeum' was resistant to bacterial pustule and SMV in the field test, and its lodging resistance was mildly strong, whereas its shattering resistance was excellent. The ability of this cultivar to be processed into tofu, soybean malt, and other fermented products was comparable with that of 'Daewonkong'. The yield of 'Saegeum' in the adaptable regions was 3.02 ton ha^-1. Thus, 'Saegeum' is adaptable to mechanized harvesting because of its high first pod height, as well as lodging and shattering resistance. (Registration number: 5929)