• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1082-1092
• /
• 2008

In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• Journal of KIISE:Software and Applications
• /
• v.33 no.8
• /
• pp.730-740
• /
• 2006

In recent years, bullied students and rogue groups in teenagers make many serious social problems. In this paper we propose a novel approach that more objectively analyzes peer relationships among students. As the data for objective analysis, we use communication history records that are collected from various communication tools such as telephones, e-mails, and messengers. We use the simple intuition that communication history records implicitly contain peer relationship information. And, we adopt data mining techniques for the more systematic analysis. The proposed peer relationship analysis consists of the following steps. First, we formally define the notion of degree of familiarity between friends, and present mathematical equations that compute the degree based on communication history records. In the proposed method, we use the intuition that the degree of familiarity from student x to student y becomes higher as x makes the more communications with y. Second, by using the degree of familiarity between students, we find out the students who are potentially bullied. This procedure is based on the assumption that a bullied student may have a very small number of history records from other students to him. Third, we adopt the clustering technique, one of the most representative data mining techniques, to find out meaningful student groups by using the degree of familiarity. To use the clustering technique, we formally define the notion of similarity between friends based on the degree of familiarity, and perform clustering using the notion. Last, to show the practicality of the proposed method, we have implemented the method and interpreted the meaning of the experimental results. Overall, we believe that our research result provides an effective framework that analyzes peer relationships more objectively and more systematically.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.6
• /
• pp.651-656
• /
• 2014

Corrosion has a significant influence upon the reliability assessment and the maintenance planning of gas pipeline. Corrosion defects occurred on the underground pipeline can be obtained by conducting periodic in-line inspection (ILI). However, little study has been done for practical use of ILI data. This paper deals with remaining lifetime prediction of the gas pipeline in the presence of corrosion defects. Because a pipeline parameter includes uncertainty in its operation, a probabilistic approach is adopted in this paper. A pipeline fails when its operating pressure is larger than the pipe failure pressure. In order to estimate the failure probability, this paper uses First Order Reliability Method (FORM) which is popular in the field of structural engineering. A well-known Battelle code is chosen as the computational model for the pipe failure pressure. This paper develops a Matlab GUI for illustrating failure probability predictions Our result indicates that clustering of corrosion defects is helpful for improving a prediction accuracy and preventing an unnecessary maintenance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.177-182
• /
• 2007

무선 공유기란 사설 IP 여러 개를 생성하는 NAT(Network Address Translation) 기능을 사용하여 회선 하나를 여러 사용자가 무선을 통해 공유할 수 있는 장치이다. 사용자가 무선 공유기를 사용할 때 2가지 문제점을 가진다. 첫째는 사용자가 무선 공유기를 사용하려는 시점에 여러 개의 무선 공유기가 존재한다면, 어떤 공유기를 사용하여야 하는 가에 문제이다. 두 번째는 첫 번째 과정을 통해 선택된 무선 공유기가 무선 공유기 중에서 최대의 대역폭을 보장해주는가에 대한 문제이다. 이에 본 논문에서는 SSID Hiding을 이용한 무선 공유기의 성능 향상 기법을 제안한다. 제안된 기법은 여러 개의 무선 공유기가 존재하면 이중에 가장 좋은 성능을 가지는 공유기만을 사용자에게 보이게 함으로써 기존 무선 공유기가 가지는 2개의 문제를 해결한다. 실험을 통해 제안된 방법이 기존 방법에 비해 성능이 향상되었음을 확인하였다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2962-2964
• /
• 2000

최근 웹의 사용이 일반화되면서 인터넷의 사용자가 급속히 증가하고 있어서. 기존의 단일 웹서버 방식에서는 막대한 접속 트래픽의 수용과 유연한 시스템 확장 등의 문제점이 예상되고 있다. 이와 함께 business-critical한 작업의 경우, 웹서버의 안정성 및 가용성 문제가 가장 중요한 문제로 지적되고 있어서 이러한 문제를 해결할 수 있는 웹전용 서버를 개발이 절대적으로 필요하다. 본 연구에서는 이를 위해. 급격한 트래픽 변화의 수용 및 웹서버의 확장성이 용이한 가상머신 개념과 고신뢰성의 시스템 운영을 위한 고장포용(fault-tolerant)기법을 적용하여 클러스터링 웹전용 서버를 구축하고, 특히 클러스터 웹서버의 부하를 분배해주는 로드밸런서의 고가용성 보장을 위해 heartbeat, fake, mon등의 기법을 이용하여 백업(backup)을 구현한다. 또한 구현된 시스템의 고성능 및 고가용성을 극대화하고. 시스템의 고장시 데이터 손실의 최소화와 이의 복구를 위해 고장 검출 및 진단 기법에 대한 방안을 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.201-208
• /
• 2005

Recently, the container terminal requires the study of method to increase efficiency through change of its operation method. Loading plan is a very important part to increase the efficiency of container terminal. Loading Plan is largely divided into two cases, deciding loading location and loading scheduling and this Paper proposes a more efficient method of container loading scheduling. Container loading scheduling is a problem of combination optimization to consider several items of loading location and operation equipments. etc. An existing method of cluster composition that decides the order of container loading scheduling has a restriction to increase the efficiency of work owing to rehandling problem. Therefore, we Propose a more efficient method of container loading scheduling which composes containers with identical attribution, based on ship loading list and yard map, into stack units of cluster, applying to hierarchical clustering method, and defines the restriction of working order. In this process, we can see a possible working path among clusters by defining the restriction of working order and search efficiency will be increased because of restricted search for working path.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1549-1555
• /
• 2009

The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.9-17
• /
• 2010

In this paper we propose an improved hierarchical routing protocol for wireless hybrid mesh network. The proposed method efficiently manages network topology and reduces overhead traffic for setting routing path by considering link stability. The simulation results show that the proposed method outperforms the HOLSR (hierarchical optimized link state routing) method in aggregate goodput, packet delivery ratio, and end-to-end delay.

• Journal of IKEEE
• /
• v.11 no.3
• /
• pp.100-107
• /
• 2007

One of the fundamental problems in wireless sensor networks is the efficient deployment of sensor nodes. The Fuzzy C-Means(FCM) clustering algorithm is proposed to determine the optimum location and minimum number of sensor nodes for the specific application space. We performed a simulation and a experiment using two rectangular and one L shape area. We found the minimum number of sensor nodes for the complete coverage of modeled area, and discovered the optimum location of each nodes. The real deploy experiment using sensor nodes shows the 94.6%, 92.2% and 95.7% error free communication rate respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.83-90
• /
• 2012

In e-commerce systems that deal with a large number of items, the function of personalized recommendation is essential. Collaborative filtering that is a successful recommendation algorithm, suffers from the sparsity, cold-start, and scalability restrictions. Additionally, this work raises a new flaw of the algorithm, inconsistent performance of recommendation. This is also not measurable by the current MAE-based evaluation that does not consider the deviation of prediction error, and furthermore is performed independently of precision and recall measurement. To evaluate the collaborative filtering comprehensively, this work proposes an extended evaluation model that includes the current criteria such as MAE, Precision, Recall, deviation, and applies it to cluster-based combined collaborative filtering.