• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1170-1178
• /
• 2010

Recently as the number of users and application traffic is increasing on high speed network, the importance of application traffic classification is growing more and more for efficient network resource management. Although a number of methods and algorithms for traffic classification have been introduced, they have some limitations in terms of accuracy and completeness. In this paper we propose an application traffic classification based multi-level architecture which integrates several signature-based methods and behavior algorithm, and analyzes traffic using correlation among traffic flows. By strengthening the strength and making up for the weakness of individual methods we could construct a flexible and robust multi-level classification system. Also, by experiments with our campus network traffic we proved the performance and validity of the proposed mechanism.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.306-313
• /
• 2009

Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.7-17
• /
• 2015

To provide scalability, wireless sensor network has cluster-based architecture. Wireless sensor network can be implemented based on the IEEE 802.15.4 which is exploited in 2.4GHz ISM frequency band. Since this frequency band is used for various data communication, network status of wireless sensor networks frequently changes according to wireless environment. Thus, wireless channel selection to avoid reduction of transmission efficiency is required. This paper estimates network status using the information that a cluster-head collects in a cluster. Through objective function with throughput, RSSI level and reliability as input parameters, this paper proposes proper wireless channel selection. Simulation results show that the proposed method maintains transmission efficiency even though network status changes.

• Electronics and Telecommunications Trends
• /
• v.18 no.4 s.82
• /
• pp.11-22
• /
• 2003

본 문서는 Ad-hoc 네트워크가 인터넷과 연동되는 환경에서 Mobile IP 기능을 지원하기 위한 기술에 대한 연구 동향을 분석한다. Mobile IP는 이동 노드와 Foreign Agent(FA) 간에 링크 레벨의 연결이 존재하는 네트워크 환경에서 동작하지만, Ad-hoc 네트워크의 경우 노드간에 멀티 홉 라우팅에 의한 통신 방법을 기본적으로 사용하고 있고, 노드의 자유로운 이동으로 인하여 이동 노드에서 FA로의 루트가 수시로 변경되는 특성을 가지고 있기 때문에 Ad-hoc 네트워크에서 Mobile IP를 지원하는 데에는 여러 가지 문제점이 따른다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.706-708
• /
• 2001

최근 인터넷의 폭발적인 증가로 외부 침입 문제를 해결하기 위한 네트워크 보안 대책의 중요성이 더욱 부각되고 있으면, 네트워크 서비스를 제공하는 자와 요구하는 자의 측면에서 보안 요구가 가장 하위의 IP에 요구되고 있다. 본 논문에서는 네트워크 상의 C/S 보안과 밀접하게 연계된 하위 레벨 API의 보안 요소 중 암호화를 이용하여 메시지의 보안을 선정하기 위한 체계를 단계별로 설정하고, 계산 복잡도와 신뢰성을 증가시킴으로써 이를 실제 네트워크에 활용하는 형태에 관해 연구하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.19-24
• /
• 2012

In this paper, we analyze the maximum throughput of opportunistic routing along a long-haul multi-hop wireless network path for a single data stream, while considering link-level interference among the network nodes. Surprisingly, we find out that opportunistic routing does not provide much improvement in throughput for long-haul paths. The results of this research show that when we compare the extra cost for the complex implementation of the opportunistic routing scheme to the performance improvement obtained from it, opportunistic routing scheme needs to be applied to only short-haul multi-hop wireless network paths.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1073-1076
• /
• 2007

HMIPv6 (Hierarchical Mobile IPv6)는 MAP (Mobility Anchor Point)을 이용하여 이동노드를 효율적으로 관리하는 방안을 제시하였다. MAP 에 걸리는 부하는 HMIPv6 로 구성된 네트워크에 진입한 이동노드가 어느 MAP 을 선정하느냐에 따라 달라진다. MAP 을 선정하는 방법으로 이동노드의 이동속도나 MAP 과 이동노드의 거리를 고려하여 선택하는 방법 등이 연구되었다. 하지만 이들은 각각 이동속도 측정을 위한 추가적인 비용이 발생하거나 특정 MAP 에 몰리는 현상을 효과적으로 해결하지 못하는 문제점이 있다. 본 논문은 HMIPv6 로 구성된 네트워크에서 네트워크 관리지역의 중앙부분을 지나는 이동노드가 바깥부분을 지나는 이동노드보다 해당 네트워크에 오래 머무른다는 사실에 착안하여 지역정보 기반의 MAP 선정기법을 제안한다. 제안하는 기법은 우선 네트워크 관리지역 내에 분포된 MAP 들을 지역정보에 기반하여 계층적으로 구성한다. 그 다음, 중앙부분을 지나는 이동노드에게 보다 넓은 지역을 담당하는 높은 레벨의 MAP 을 선정하고 바깥부분을 지나는 이동노드에게 보다 좁은 지역을 담당하는 낮은 레벨의 MAP 을 선정한다. 이로써 전체적으로 발생하는 바인딩 업데이트 비용을 줄이고 MAP 의 로드밸런싱 효과를 얻는다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.111-117
• /
• 2009

In the wideband code division access (WCDMA) systems, a pilot channel is used to determine WCDMA network coverage, cell identification, synchronization, timing acquisition and tracking, user-set handoff, channel estimation, and so on. A wireless repeater, which is deployed in the urban area for the WCDMA system to meet the growing demand on wireless communication services, has the possibility to receive several pilot signals from a large number of base stations, however, cannot distinguish its service base station's signal among them. This pilot interference results in frequent handoffs in the user equipment, which degrades the radio reception, transmission efficiency, quality of service, and channel capacity and increases the unwanted power consumption. In this paper, thus, we propose a pilot pollution interference cancellation scheme using one of the adaptive estimation algorithms, normalized least mean square (NLMS), which is applicable to a wireless repeater. We carried out link-level and network-level computer simulations to evaluate the performance of the proposed scheme in a wireless repeater. The simulation results verify the bit error rate (BER) improvement in the link level and the call drop probability improvement in the network level.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1281-1293
• /
• 1996

In this paper, we propose a novel recognition model of on-line cursive Korean characters using HMM(Hidden Markov Model) and level building algorithm. The model is constructed as a form of recognition network with HMM for graphemes and Korean combination rules. Though the network is so flexible as to accomodate variability of input patterns, it has a problem of recognition speed caused by 11, 172 search paths. To settle the problem, we modify the level building algorithm to be adapted directly to the Korean combination rules and apply it to the model. The modified algorithm is efficient network search procedure time complexity of which depends on the number of HMMs for each grapheme, not the number of paths in the extensive recognition network. A test with 15, 000 hand written characters shows recognition rat 90% and speed of 0.72 second per character.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.65-73
• /
• 2016

Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.