• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.397-408
• /
• 2017

As mobile traffic increases rapidly, DMM (Distributed Mobility Management) has been proposed as a mobility management technology for seamless communication of mobile devices as mobile traffic increases rapidly. the DMM distributes mobility management from the core network to the edge network, enabling stable binding updates with low latency. However, the DMM still have network delay and security problems for sessions. In this paper, we point out the problems existing in the DMM and propose a new protocol in which the MN (Mobile Node) directly participates in authentication and mutual authentication is correctly performed to solve this problem. We demonstrate not only security improvements but also performance improvements with performance analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.384-387
• /
• 2002

Internet telephony is an application that transmits voice data for conversation. Therefore it must provide high sound quality. However while audio packets are transferred through the network, they are affected by delay variations and jitters, which could result in poor sound quality if the receiving end does not have an appropriate jitter buffer to overcome network factors. This thesis introduces a buffer management algorithm that could be used to provide better sound quality for Internet phone terminals. This algorithm actively responds to both the compression algorithms that are used by the terminals, as well as to the received data to provide an improvement in sound quality. In order to confirm the validity of the suggested algorithm, comparisons of the performance have been made between the existing buffer management algorithms and this new algorithm in various network settings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.70-77
• /
• 2015

In this paper, we present experimental results evaluating the performance of the Multipath TCP over shared bottleneck path in series of benchmark tests. In summary, we find that the Multipath TCP's fairness as well as its competitive responds to the change of network conditions such as latency, loss rate${\cdots}$ MPTCP is extremely unfair and powerful with regular TCP in ideal network conditions but its throughput decreases clearly even less than regular TCP in worse network conditions with very high latency, higher packet loss rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.366-368
• /
• 2015

This paper proposes a MAC protocol for sensor networks such as disaster detection system which generate the non-periodic packet. B-MAC has been used to solve delay problem for sensor networks, however, the power loss occurs due to excessive preamble and over-hearing. In contrast, S-MAC has a number of drawbacks in power consumption due to synchronization. In this paper, we propose H-MAC and analyze its performance which has improved power consumption compared to S-MAC and overhead and over-hearing compared to B-MAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3B
• /
• pp.208-213
• /
• 2011

Since the wireless technologies based on the IP have been developed recently, a variety of mobile services has been proposed. For broadcasting services to utilize network resources efficiently, there is a need to support handover of multicast traffic in mobile networks. In this paper, we add a network function block to solve the tunnel convergence problem, and propose a new fast handover scheme to reduce handover latency for PMIPv6 networks with multicast function. With the simulation result, we show that our fast handover scheme has better performance than the draft in the IETF in the viewpoint of handover latency and multicast service disruption.

• Journal of Satellite, Information and Communications
• /
• v.6 no.2
• /
• pp.84-90
• /
• 2011

Handling paging mechanism at the IP layer (i.e., IP paging) makes it possible to support heterogeneous wireless access technologies, providing energy-saving and reduced location registration signaling overhead over IP-based mobile networks. However, IP paging may rather cause adverse effects under active communication environments because of significant paging signaling overhead and frequent paging delay. Therefore, in order to solve these problems, a cost-effective IP paging scheme is proposed in this paper, which enables a mobile node to perform selective registration and paging based on its profile information. Numerical results indicate that the proposed scheme has apparent potential to mitigate considerable paging signaling overhead and frequent paging delay in IP-based hierarchical mobile networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.160-163
• /
• 2014

IP 네트워크를 통해 전송되는 실시간 스트라밍은 네트워크 상태에 따라 데이터 손실 및 전송 지연의 문제가 발생 할 수 있다. 이에 멀티미디어 네트워킹 애플리케이션은 RTP(Realtime Transport Protocol)와 RTCP(RTP Control Protocol)를 지원하는 RTSP(Realtime Streaming Protocol)를 사용한다. RTSP를 사용하는 송신단은 패킷 손실과 전송지연이 발생할 경우 끊김 없는 멀티미디어 스티리밍을 제공하기 위해 네트워크 상태에 따라 전송률을 변경한다. 하지만 전송률이 낮아지면 멀티미디어 품질이 떨어지게 된다. 만약 짧은 시간 동안 전송률이 빈번하게 변경된다면 일관성 있는 품질의 서비스를 제공하기 어렵다. 본 논문에서는 SDN 환경에서 실시간 스트리밍을 효과적으로 제어하기 위해 중앙 컨트롤러가 RTCP를 수신하고 송신단의 전송률과 현재 링크의 가용 전송율을 추정한다. 추정된 가용 전송율이 송신단의 전송률보다 낮다며 각 스위치의 활성화된 플로우 엔트리가 낮은 스위치로 라우팅 경로를 선택하는 메커니즘을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1799-1805
• /
• 2007

Wireless Ad-hoc networks may contain nodes of various types of which many can have limited power capabilities. A failure of a node due to energy exhaustion may impact the performance of the whole network hence, energy must be conserved. In this paper, we propose a Delay and Energy-Aware Routing (DEAR) algorithm a multiple metric path cost routing algorithm which considers not only the energy consumed by the node during transmission and reception but as well as the residual energy of the node and the delay incurred during route discovery. Based on our results, DEAR algorithm performs well and maximizes network lifetime by routing flows to nodes with sufficient energy such that the energy consumption is balanced among nodes in proportion to their energy reserves.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.113-119
• /
• 2009

In this paper, we proposed an efficient TDMA scheduling algorithm for a clustered Wireless Sensor Network. Since some previous algorithms used unnecessary idle period and schedule period in each frame. It became an overhead that might consume unexpected energy and delay data transmission. To solve this problem, a dynamic scheduling algorithm according to the number of member nodes and node traffic load within a cluster was suggested. Our proposed DS-MAC(Dynamic Scheduling MAC) could save energy and reduce transmission delay Then DS-MAC was analyzed mathematically to compare with the previous algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.73-74
• /
• 2013