The search functionality is under construction.

Author Search Result

[Author] Kijun HAN(5hit)

1-5hit
  • Executable Code Recognition in Network Flows Using Instruction Transition Probabilities

    Ikkyun KIM  Koohong KANG  Yangseo CHOI  Daewon KIM  Jintae OH  Jongsoo JANG  Kijun HAN  

     
    LETTER-Application Information Security

      Vol:
    E91-D No:7
      Page(s):
    2076-2078

    The ability to recognize quickly inside network flows to be executable is prerequisite for malware detection. For this purpose, we introduce an instruction transition probability matrix (ITPX) which is comprised of the IA-32 instruction sets and reveals the characteristics of executable code's instruction transition patterns. And then, we propose a simple algorithm to detect executable code inside network flows using a reference ITPX which is learned from the known Windows Portable Executable files. We have tested the algorithm with more than thousands of executable and non-executable codes. The results show that it is very promising enough to use in real world.

  • GroupScan: Group-Based Fast Handoff Scheme for Wireless LAN

    Jangkyu YUN  Mahnsuk YOON  Byunghwa LEE  Kijun HAN  

     
    LETTER-Terrestrial Wireless Communication/Broadcasting Technologies

      Vol:
    E94-B No:10
      Page(s):
    2929-2932

    Handoff is a critical issue for stations in IEEE 802.11-based wireless networks. In order to provide Voice-over IP (VoIP) and real-time streaming applications to stations, a handoff mechanism is needed that can reduce latency and provide seamless communication. However, the IEEE802.11 handoff scheme is not appropriate to supply their quality of service (QoS), because it is based on a full-scanning approach. Full-scanning spends too much time searching for access points (APs). Therefore, various pre-scan handoff protocols such as SyncScan and DeuceScan have been proposed. They scan to find nearby APs before the station loses contact with its current AP, but the pre-scanning overhead is considerable. Our handoff mechanism reduces the delay and overhead associated with the link layer handoff by periodically scanning the channel groups.

  • Self-Adjustable Rate Control for Congestion Avoidance in Wireless Mesh Networks

    Youngmi BAEK  Kijun HAN  

     
    PAPER-Network

      Vol:
    E97-B No:11
      Page(s):
    2368-2377

    In this paper, we investigate the problems of the established congestion solution and then introduce a self-adjustable rate control that supports quality of service assurances over multi-hop wireless mesh networks. This scheme eliminates two phases of the established congestion solution and works on the MAC layer for congestion control. Each node performs rate control by itself so network congestion is eliminated after it independently collects its vector parameters and network status parameters for rate control. It decides its transmission rate based on a predication model which uses a rate function including a congestion risk level and a passing function. We prove that our scheme works efficiently without any negative effects between the network layer and the data link layer. Simulation results show that the proposed scheme is more effective and has better performance than the existing method.

  • A New Hybrid Scheme for Preventing Channel Interference and Collision in Mobile Networks

    Kyungjun KIM  Kijun HAN  

     
    LETTER-Network

      Vol:
    E93-B No:2
      Page(s):
    385-388

    This paper proposes a new hybrid scheme based on a given set of channels for preventing channel interference and collision in mobile networks. The proposed scheme is designed for improving system performance, focusing on enhancement of performance related to path breakage and channel interference. The objective of this scheme is to improve the performance of inter-node communication. Simulation results from this paper show that the new hybrid scheme can reduce a more control message overhead than a conventional random scheme.

  • A Topology Control Scheme for Selecting Active Nodes in Wireless Sensor Networks

    Kyungjun KIM  Kijun HAN  

     
    LETTER-Network

      Vol:
    E92-B No:12
      Page(s):
    3915-3918

    Power consumption is one of the most important factors in successfully designing of wireless sensor networks since it directly affects network lifetime. We propose a topology control scheme that reduces power consumption by minimizing, as much as possible, the number of active nodes, in a highly dense region as well as to decrease packet transmission delay. Simulation results show that our scheme can effectively solve the energy inefficiency problem caused by unbalanced power consumption, and can significantly reduce packet transmission delay.