• Electronics and Telecommunications Trends
• /
• v.17 no.3 s.75
• /
• pp.53-62
• /
• 2002

본 논문은 UMTS 기반의 3GPP에서 제안하고 있는 차세대 IP 기반 멀티미디어(IM) 서비스를 위한 핵심망 서브 시스템의 구조와 기능 요소 및 관련 신호 프로토콜에 대해 기술하고 있다. IM 서비스란 이동가입자에게 하부에 IP 전송 프로토콜을 기반으로 하는 다양한 형태의 패킷 서비스들을 동시에 제공하는 것을 말한다. 이를 위해 3GPP에서 제시하고 있는 논리적인 ALL IP 망 구조는 IM CN 서브시스템을 포함하고 있는데, IM CN 서브시스템의 중요한 기능 요소로는 Call Session Control Function(CSCF)와 Home Subscriber Server(HSS) 등이 있다. CSCF는 가입자가 위치하고 있는 망에 따라서 가입자의 세션과 서비스를 제어한다. HSS는 가입자의 마스터 데이터베이스로 기존의 3G HLR의 모든 기능과 User Mobility Server(UMS) 기능을 가진다. 본 고에서는 위의 두 기능 요소들의 기능과 상호 간의 시그널링 프로토콜을 최신 동향을 기반으로 분석하고 기본적인 시그널링 절차도 기술한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.438-442
• /
• 1999

More and more residential and mobile users are requiring access to the Internet. This paper presents an architecture of the network solution for cost-effective Internet/intranet access between users and Network Service Providers(NSPs). It also presents a functional architecture of Internet access router in the integrated access node system. The proposed Internet access router provides the functionality that users select any of a number of NSPs and mutiple user PPP calls are multiplexed over each secure tunnel between the Internet access router and NSP.

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

VoIP(Voice over Internet Protocol)는 음성 및 화상과 같은 멀티미디어 세션을 인터넷과 같은 IP 기반 네트워크를 통해 통신하는 기술이다. 최근에는 기존의 PC 시스템 이외에 이동통신기기와 다양한 무선네트워크 기반 휴대용 기기들의 보급으로 VoIP 의 사용량은 크게 증가하고 있다. 하지만, 무선네트워크는 그 특성과 환경적 요인으로 NAT 에서의 차단, 지연, 유실등과 같이 통신의 연속성을 보장해 주지 못하는 문제가 발생할 수 있다. 본 논문에서는 무선네트워크에서 통신할 때 발생할 수 있는 이런 문제들에 대응하는 해결 방안을 제시하고 RTP 미디어 재생의 연속성을 보장하는 ICE 기반 다자간 VoIP 시스템 설계와 구현모델에 대해서 기술하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1356-1358
• /
• 2009

최근 무선 네트워크를 효율적으로 사용하기 위해서 버티컬 핸드오버의 많은 부분이 연구되고 있다. 멀티 인터페이스를 사용하여 핸드오버를 지원하는 방법으로 멀티호밍등과 같은 연구가 진행되었지만 멀티 인터페이스를 사용하기위해서는 HA(Home Agent)역시 인터페이스의 수 만큼 존재해야한다. 이것은 세션의 유지가 어렵고 서비스의 단절로 인한 연속적인 서비스를 받지 못한다는 것을 의미한다. 본 논문에서는 MN(Mobile Node)은 멀티 인터페이스를 사용하고 CN(Corresponding Node)은 HA 하나의 링크로써 연결되며 MN이 이동함에 따른 멀티 CoA(Care of Address)를 사용하는 방법을 제안한다. 이 방법을 통하여 핸드오버시의 문제가 되는 핸드오버 지연과 손실을 줄일 수 있다. 또한 제안된 방법은 기존의 시스템의 변화 없음으로 적용하기 쉬운 특징이 있다.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.301-310
• /
• 2008

In the existing literature, the handover process reveals numerous problems manifested by high movement detection latency. FMIPv6 can reduce packet loss using a tunnel-based handover mechanism. However, this mechanism may cause performance degradation due to the out-of-sequence packets. Recently. Proxy Mobile IPv6 is proposed for network-based mobility management to reduce overhead in mobile node. PMIPv6 can decrease handover latency which related overhead in MN by using network agent. In this paper, we proposed optimized fast handover scheme called Fast Proxy Mobile IPv6 (EF-PMIPv6). The proposed EF-PMIPv6 can support fast handover using fast IAPP and ND schemes. Further, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach focuses on the reduction of handover latency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2563-2568
• /
• 2009

Although a symmetric cryptographic system has many advantages in speed of encryption decryption, the security problems with the distribution method of secret keys have been still raised. Especially, the distribution method of secret keys for unspecified individuals who want secret communication is becoming a core issue. As a simple solution to this issue, Diffie-Hellman key exchange methods were proposed, but proved to be insufficient in depending MITM(Main In The Middle) attacks. To find effective solution to problems mentioned above, this paper proposes the strengthened Diffie-Hellman key exchange methods applied for the mobile-phone channel which are widely used. This paper emphasizes the way to distribute the synthesized session keys to the sender and the receiver, which are created with authentication numbers exchanged between the mobile-phones and Diffie-Hellman key. Using proposed ways, MITMattacks can be effectively defended.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.949-958
• /
• 2005

In the paper we study key agreement schemes when a party needs to establish a session key with each of several parties, thus having multiple session keys. This situation can be represented by a graph, tailed a key graph, where a vertex represents a party and an edge represents a relation between two parties sharing a session key. graphs to establish all session keys corresponding to all edges in a key graph simultaneously in a single session. A key agreement protocol of a key graph is a natural extension of a two-party key agreement protocol. We propose a new key exchange model for key graphs which is an extension of a two-party key exchange model. using the so-called randomness re-use technique which re-uses random values to make session keys for different sessions, we suggest two efficient key agreement protocols for key graphs based on the decisional Diffie-Hellman assumption, and prove their securities in the key exchange model of key graphs. Our first scheme requires only a single round and provides key independence. Our second scheme requires two rounds and provides forward secrecy. Both are proven secure In the standard model. The suggested protocols are the first pairwise key agreement protocols and more efficient than a simple scheme which uses a two-party key exchange for each necessary key. Suppose that a user makes a session key with n other users, respectively. The simple scheme's computational cost and the length of the transmitted messages are increased by a factor of n. The suggested protocols's computational cost also depends on n, but the length of the transmitted messages are constant.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.37-44
• /
• 2008

In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.125-133
• /
• 2010

A policy based resource management framework is proposed, that supports the optimal QoS by applying resources management function which is changed according to the status of mobile terminal and heterogeneous connections to hand-over process of mobile terminals based on heterogeneous network. To assess the performance of policy based resource management framework proposed in this thesis, in case of applying weighted policy for selecting optimal cell in hand-over occurring among duplicated heterogeneous connections, the transmission delay was remarkably enhanced as the number of multimedia sessions increased. This means, in case of QoS deterioration of multimedia session occurring in service connection, hand-over was executed with the optimal connection.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.73-90
• /
• 2010

Recently, Tan et al. introduced a serverless search protocol in which a mobile reader maintains a tag authentication list and authenticates a tag using the list without connecting authentication server. A serverless RFID system is different from general RFID systems which use on-line server models. In the serverless RFID system, since the mobility of a personalized reader must be considered, we have to protect not only the privacy of a tag but also the privacy of a mobile reader. In this paper, we define new security requirements for serverless RFID search system and propose a secure serverless RFID search system. In our system, since tag authentication information maintained by a reader is updated in every session, we can provide the backward untraceability of a mobile reader. Also we use an encrypted timestamp to block a replay attack which is major weakness of search protocols. In addition, we define a new adversary model to analyze a serverless RFID search system and prove the security of our proposed system using the model.