• Journal of KIISE
• /
• v.42 no.6
• /
• pp.801-806
• /
• 2015

The Short Message Service (SMS) is one of the most popular communication tools in the world. As the cost of SMS decreases, SMS spam has been growing largely. Even though there are many existing studies on SMS spam detection, researchers commonly have limitation collecting users' private SMS contents. They need to gather the information related to social network as well as personal SMS due to the intelligent spammers being aware of the social networks. Therefore, this paper proposes the Social network Building Scheme for SMS spam detection (SBSS) algorithm that builds synthetic social network dataset realistically, without the collection of private information. Also, we analyze and categorize the attack types of SMS spam to build more complete and realistic social network dataset including SMS spam.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1844-1866
• /
• 2011

In a home network system, each customer electronic device has the control data format chosen by its manufacturing company and there are various types of digital devices and protocols. Besides the mutual operating environments among the various devices are dissimilar. Affected by the characteristics explained above, home network systems can hardly support the crucial functions, such as data compatibility, concurrency control, and dynamic plug-in. Thus, the home network system shows relatively poor reusability. In this paper, we suggest design technique of configurable framework, which can widely support the variability, to increase the reusability of the home network system. We extract the different parts of the home network system as variation points, and define them as the variability types. We design a structure of configurable framework, and suggest customization technique of configurable framework through selection technique and plug-in technique. Also, we prove the reusability by applying the proposed framework and it methods to real-world home network systems and analyzing the measurement results of these case studies using software metrics. We can expect the proposed approach provides better reusability than the existing them by analyzing those measurement results.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.851-855
• /
• 2009

Constructing CDS in wireless ad-hoc network, it is necessary to make more efficient algorithm that is fast, simple and has low power consumption. It is worried about losing data which brought a bottleneck state from confliction and delay when the nodes are concentrated or CDS is reconstructed. So, after constructing most efficient CDS, It is better not to reconstruct CDS in moveless wireless ad-hoc network. In this paper, we compared and estimated the performance in each situation of a CDS construction algorithm based on Node degree and Energy level.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.455-462
• /
• 2016

Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2150-2156
• /
• 2013

This study attempts to identify how the value network of mobile industry has evolved in the value creating process. The longitudinal case study on SK Telecom was conducted by measuring the SK Telecom's investment structure during from 1999 to 2008. Results show that the convergence services based on the advanced mobile networks changed the revenue structure, and enabled SK Telecom to reposition as a media company. For the value creation, SK Telecom's value network has flexibly adapted to convergence environment through dynamic asset reconfiguration.

• Journal of Korea Game Society
• /
• v.9 no.1
• /
• pp.75-84
• /
• 2009

In this paper, we propose a game server using public network library ACE, which has been developed in various fields for a long time. ACE network library has been considered not only in the area of high efficient real-time communication library but also in the area of application development, and it provides various facilities. We logically reorganized the part, which is necessary to develop games, among various functions of ACE and optimized it, and developed real battlenet server using verify the reorganized library. As the method of experiment, the battlenet server and test client were set and interface request test and data electrical transmission test were conducted. As the result of the experiment, the conclusion that it is possible to develop games by using ACE, which is verified network library, has been obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.251-259
• /
• 2007

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternet. Many algorithms of scatternet formation have been proposed so far. However, these have a problem that takes a long time to reform scatternet, especially for the case of master moving out. In this paper we propose a Fast-Recovery algorithm. which aims at reducing the time of scatternet reformation owing to master moving out. In the algorithm, we select a slave with the weigh similar to its master as Sub-Master from a piconet device table created by the master When a master leaves its piconet is detected by its slaves, the Sub-Master becomes the new master of the piconet instead of the old and directly connect to other slaves and bridge(s) through piconet device table in page state.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.309-312
• /
• 2006

현재의 네트워크화 된 환경에서 Reverse Engineering 방지의 중요성은 높아지고 있다. 특히 Java의 경우 Reverse Engineering에 의한 위험성에 더욱 노출되어 있다. 본 논문에서는 이러한 환경에서 Reverse Engineering 방지에 대한 기존의 연구에 대하여 검토하고, Java 바이트 코드의 암호화를 통한 방어 기법으로서 동적 인스트루멘테이션을 이용한 재구성이 가능한 새로운 Java 실행 환경을 제안하였다. 이를 통하여 보다 신뢰성 있는 모바일 에이전트 환경을 구축할 수 있을 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.175-176
• /
• 2011

협업 컴퓨팅 환경은 컴퓨팅, 네트워크 자원을 통하여 연구자들간의 협력을 하는 일련의 작업 과정을 의미한다. 사람이 포함되어 있는 복잡한 연구환경에서 워크플로우 기반의 작업 수행은 협업환경을 위해 유용하게 사용된다. 하지만 자원의 예기치 못한 자원의 성능 저하는 전체 워크플로우의 성능을 저하시키게 된다. 본 논문에서는 워크플로우 자원 스케줄링에 있어서 최초에 결정되어 할당된 자원을 재배치 시키는 재구성 기법을 통하여 워크플로우 응용의 성능 저하를 개선하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.748-750
• /
• 2001

Ad hoc 네트워크에서 클러스터링은 여러 채널을 효율적으로 사용 가능하게 하고 제어메시지의 교환부하를 감소시키며, 이동성 관리를 용이하게 하는 이점이 있다. 그러나 대부분의 클러스터 기반 Ad hoc 라우팅 연구에서 클러스터의 생성과 유지에만 초점을 맞추고 있고, 클러스터 구조를 이용하는 경우에는 많은 채널을 소비하고 클러스터 재구성시간이 심각하게 길어진다. 이에 본 논문은 클러스터 구조를 이용하여 클러스터 정보가 모든 네트워크에 한번만 전달되도록 해서 경로를 설정하는 방법을 제안한다. 이 방법은 또한 클러스터 정보가 전달되는 도중의 경로단절 시, 빠르게 대체경로를 획득한다.