• Journal of Convergence Society for SMB
• /
• v.5 no.4
• /
• pp.37-42
• /
• 2015

Due to the advance of ICT, a variety of attacks have been developing and active. Recently, APT attacks using malicious codes have frequently occurred. Advanced Persistent Threat means that a hacker makes different security threats to attack a certain network of a company or an organization. Exploiting malicious codes or weaknesses, the hacker occupies an insider's PC of the company or the organization and accesses a server or a database through the PC to collect secrets or to destroy them. The paper suggested a countermeasure to cope with APT attacks through an APT attack process. It sought a countermeasure to delay the time to attack taken by the hacker and suggested the countermeasure able to detect and remove APT attacks.

• The Journal of the Korea Contents Association
• /
• v.8 no.9
• /
• pp.34-41
• /
• 2008

Existing mobility support scheme like MIPv4 has the delay at data transfer and Triangle routing problem. This paper proposes the new mobility support scheme and method that can overcome the problem using MPLS LSP in Next Generation Network. The proposed scheme overcomes the problem by introducing the LMS(Location Management Server) managing the location of the mobile terminal and the MPLS LSP between FA for a tunneling. We shows on the mathematical analysis using the queuing theory that this proposed scheme is more superior to the existing method(MIP).

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.6-12
• /
• 2004

Identification rate and time are very important in the identification of RFID tag, and the tag requires simple structure to use economically large quantity of tags. These factors make the MAC protocols of wired or wireless network environment result in different requirements. In the paper, we propose a method to apply spread spectrum scheme using orthogonal channel via Walsh function as the anti-collision communication system for the purpose of non-collision identification of multiple tags, and consider its property. The proposed system use two step identification. in the first step, collision is resolved via constructing to respond after specific delay time based on unique n, and conventional polling scheme follows in the second step.

• Journal of Convergence Society for SMB
• /
• v.5 no.1
• /
• pp.25-30
• /
• 2015

The APT attacks are hackers created a variety of security threats will continue to attack applied to the network of a particular company or organization. It referred to as intelligent sustained attack. After securing your PC after a particular organization's internal staff access to internal server or database through the PC or remove and destroy the confidential information. The APT attack is so large, there are two zero-day attacks and rootkits. APT is a process of penetration attack, search, acquisition, and is divided into outlet Step 4. It was defined in two ways how you can respond to APT through the process. Technical descriptions were divided into ways to delay the attacker's malicious code attacks time and plan for attacks to be detected and removed through.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.2
• /
• pp.193-204
• /
• 2010

Since Wireless Multimedia Sensor Network(WMSN) needs to process various multimedia data such as audio, image and video data as well as scalar data, it requires a mechanism that can support Quality of Service(QoS) to handle efficiently. This paper classifies traffic in WMSN as periodic monitoring traffic, event traffic, multimedia traffic and query-based traffic, proposes marking algorithm and queue management mechanism that guarantee differentiated QoS in terms of delay, energy efficiency and credibility on each traffic and conduct performance analysis with simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.524-525
• /
• 2013

동적 움직임을 가지는 노드에 대한 DTN(Delay/Disruption Tolerant Network)은 노드의 연결단절 및 불규칙적인 노드의 움직임에 의한 불안정한 상태를 해결하는 방법 중 하나이다. 특히 DTN은 재난상황 또는 움직임이 많은 노드간의 상관관계를 분석하여 노드 간 연결 확립을 보장함으로써 데이터 연결성과 전송률을 개선한다. 본 논문은 노드의 움직임에 대한 속성 정보를 기반하여 구성된 클러스터 구조의 네트워크에서 헤드노드 간의 연결 가능성을 분석하며 데이터를 목적지까지 포워딩하는 방식으로 망을 제어 유지하기 위한 방법으로 EPCM(Efficient Prediction-based Context-Awareness Matrix) 알고리즘을 제안하고자 한다. 이를 위해 적용한 상황 매트릭스는 시간에 따른 헤드노드들의 움직임과 속도 등의 상황 예측이 가능한 정보를 포함한 포워딩 분석 요소를 제공한다. EPCM 알고리즘은 노드가 주기적인 이동성을 가진다는 가정 하에 포워딩에 요구되는 상관관계를 연산 분석하여 예측 경로를 제공한다. 노드의 이동에 의해 경로가 변화하는 환경에서 EPCM 알고리즘은 상황 매트릭스를 통해 헤드노드의 연결 정보를 저장하고 관리함으로써 연결성을 보장하고 짧은 지연시간에 효율적인 전송이 가능할 것이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1435-1440
• /
• 2014

Nodes in WSNs must operate under limited energy resource. Controlling access to the channel in WSNs plays a key role in determining channel utilization and energy consumption. This paper introduces a priority-based time slot allocation protocol for hybrid TDMA/CSMA MAC in WSNs. This protocol combines both TDMA and CSMA techniques while introducing prioritization by (m,k)-firm constraint. The performance of this protocol is obtained through simulations for various number of nodes and show significant improvements in delay and packet delivery ratio compared to S-MAC.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.425-426
• /
• 2016

In this paper, we proposed an algorithm based on movement prediction using Markov chain in delay tolerant networks(DTNs). The existing prediction algorithms require additional information such as a node's schedule and connectivity between nodes. However, network reliability is lowered when additional information is unknown. To solve this problem, we proposed an algorithm for predicting a movement path of the node by using Markov chain. The proposed algorithm maps speed and direction for a node into state, and predict movement path of the node using transition probability matrix generated by Markov chain. As the result, proposed algorithm show that the proposed algorithms has competitive delivery ratio but with less average latency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.42-52
• /
• 2006

The interest for IPv6, Which is next generation IP, increases, while th difficulty for adopting it into IT indestries also increase too. We also expect that Internet technologies develop 0 basis of All-IP networks, which include various heterogeneous networks. Therefore, it is necessary for network to support mobility and multicast capavility to create application with wide-variety- In this paper, we propose a scheme that be able to provide mobility and multicast efficient in IPv6 networks. The proposed scheme has been implemented and experimented on NS-2 and validated with respect to multicast packet delay time and count of Joining and pruning)

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.4
• /
• pp.189-196
• /
• 2020

In cognitive radio networks, secondary transmitters should cease its transmission immediately on detecting of primary transmission in the spectrum they are accessing. Then they should exploit another idle spectrums and handoff to the newly found idle spectrums, which is called spectrum rendezvous. With regards to spectrum rendezvous, most of related work presume the existence of dedicated common control channel used by secondary users for exchanging the information of idle spectrums. However, this presumption is not feasible in real world cognitive radio scenario. Therefore we address a blind spectrum rendezvous scheme with no need of separate control channel. Furthermore we consider maintaining one or more extra spectrums (channels) to expedite the spectrum rendezvous. Our scheme lets secondary users maintain extra spectrums by exchanging the spectrum information periodically during normal communications. The one of the extra spectrums are regarded as a candidate spectrum that the users can handoff to on detecting the primary transmission. We evaluate that our blind scheme can help to reduce the rendezvous delay in a real world cognitive radio environments with USRPs.