• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.340-342
• /
• 2004

정보통신 기술의 발달로 사용자는 이동간에도 지속적인 인터넷 서비스를 받길 원한다. 이에 이동성 지원을 위한 많은 연구들이 있었다. 이동성 지원을 위한 HMIPV6환경에서 이동노드(Mobile Node)가 새로운 MAP 도메인으로 이동하거나 처음으로 MAP 도메인에 진입할 때 이동 노드는 홈 에이전트(Home Agent)와 상대 노드(Correspondent Node)에게 자신의 바인딩 정보를 갱신 하여야만 한다. 이 때 이동노드는 MAP 도메인 내에서 LCoA와 RCoA를 MAP에게 바인딩을 하고 자신의 HoA(Home Address)를 이용하여 홈 에이전트와 상대노드에게 바인딩 갱신 메시지를 보내어 바인딩 정보를 갱신한다. 본 논문은 이동 노드가 지역 바인딩 갱신(LBU)메시지와 함께 보내는 바인딩 갱신 메시지를 이용하여 MAP가 이동노드 대신 바인딩 갱신 메시지를 보냄으로써 시그널링을 줄이는 방안을 제시하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.286-288
• /
• 2001

미래에는 Mobile IP의 이동 노드 사용자가 증가할 것이기 때문에 보다 효율적인 이동성 관리 기법이 필요할 것이다. 특히 이동 노드의 수가 증가함에 따라 이동성을 지원하기 위한 바인딩 갱신 메시지 수는 증가한다. 따라서 , 본 논문에서는 이동 노드의 이동성 패턴의 지역적 특성이 반영된 프로파일 정보를 이용하여 네트워크 상에서 바인딩 갱신 메시지의 라이프타임 값을 조정함으로써 바인딩 갱신 메시지의 수를 감소시킬 수 있는 프로과일 기반의 전략을 제안한다. 본 논문에서는 이동 노드의 과거 이동성 패턴 정보를 이용하여 이동 노드가 가지고 있는 프로파일의 평균 상주시간 정보를 라이프타임 값으로 설정하는 적응적 라이프타임과 이동성 정보가 없는 경우에 기존 Mobile IPv6에서 사용하는 라이프타임 값을 그대로 사용하는 디폴트 라이프타임이 존재한다. 그리고, Mobile IPv6에서의 효율적인 라우팅을 위해 프로파일 정보에 기반한 두개의 라이프타임을 효율적으로 관리함으로써 바인딩 갱신 메시지와 바인딩 요청 메시지의 수를 감소시킬 수 있으며, 상당한 통신비용 절감효과를 기대할 수 있다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.490-493
• /
• 2006

모바일 IPv6 환경에서 모바일 노드와 대응 노드간의 바인딩 갱신에 관한 많은 연구가 활발히 진행 중에 있다. 하지만, 지금까지 제안된 대부분의 프로토콜이 바인딩 갱신 메시지에 대한 요청자와 응답자 인증 그리고 갱신 정보의 무결성에 대한 최적의 프로토콜을 찾고자 하고 있지만, 바인딩 갱신을 요청하는 노드의 위치 검증에 대해서는 요청메시지에 대한 응답 메시지를 수신함으로써 간접적인 확인만을 하고 있다. 본 논문에서는 공인 인증체제의 인가 인증서를 바탕으로 효율적인 위치 확인을 제공하는 모바일 IPv6 바인딩 업데이트 기법을 제안한다.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.27-36
• /
• 2004

Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.679-681
• /
• 2004

무선 통신 기술의 발달로 무선 인터넷에 대한 관심과 그에 따른 이동성 지원에 대한 관심이 증가하고 있다. 또한 이동성 지원을 위한 Mobile IPv6의 Handover 시에 상대노드(CN)와의 바인딩 갱신(Binding Update) 지연시간이 문제가 되고 있다. 문제 해결을 위해서 2계층과 3계층을 연동하는 Fast Handover를 이용하여, MN에서 CN으로의 바인딩 갱신 지연시간을 단축시키고자 2계층 Handover 메시지인 IEEE 802.11의 Reassociation Request 프레임을 이용한다. MN이 Binding 갱신 메시지를 보내기 전에 CN과의 보안을 위해서 Return Routability 절차을 수행하는데 이 절차 중의 메시지인 HoTI, CoTI 메시지를 2계층 Handover 중에 미리 보냄으로써 CN과의 바인딩 갱신 지연시간을 단축시키는 방안을 제안한다.

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

Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.81-88
• /
• 2007

To support the movement of a mobile network consisting of several mobile nodes, the IETF NEMO working group proposed NEMO basic support protocol using bi-directional tunneling between the home agent and the mobile router. Since NEMO basic support protocol is based on bi-directional tunneling, all communications to and from mobile nodes are suffer from inefficient routing all the cases. To solve the routing inefficiency problem, several proposals are proposed. However, those proposals results in new problems, such as binding update storm and changes in existing protocol. Especially, binding update storm problem may cause the delay in binding update, this subsequently causes the difficulty for a real time service and the handoff delay on the movement of mobile network. In this paper, we propose a new binding update scheme which reduces binding update latency and the handoff delay through the distribution of the transmission time of binding update messages. The performance of the proposed scheme is also evaluated to demonstrate its efficiency. Simulation results show that the proposed scheme can efficiently reduce the binding update latency.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.615-624
• /
• 2005

In Mobile IP, several types of messages - binding update, binding request and binding acknowledgement - are used to support user mobility. It is necessary to exchange those messages frequently for seamless mobility but it incurs both the increase of network overhead and poor usage of mobile node battery power Thus, we need a mechanism that the server detects users location and also copes with the problems effectively, which is our main concern in this paper Each user records all moving logs locally and periodically makes out profile based on them in HMIPv6. By using profile, estimated resident time can be computed whenever he enters an area and the time is set up as the binding update message lifetime. Of course, the more correct lifetime nay be obtained IP arrival time as well as average resident time Is considered in profile. Through extensive experiments, we measure the bandwidth usage for binding update messages by comparing the proposed schemes with that in HMIPv6. From the results, Gain gets over $80\%$ when mobile node stays more than 13 minutes in a subnet. Namely, we come to know that our schemes improve network usage and energy usage in mobile node by decreasing the number of messages while they also manage users locations like that in HMIPv6.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.15-20
• /
• 2010

This paper proposes a multihoming-based vertical handover scheme using Proxy binding update to minimize handover delay and packet loss while a mobile node moves to a heterogeneous access network. When a mobile node moves to a heterogeneous access network, the proposed scheme can provide a mobile node with fast and seamless handover by performing layer-3 handover using its new interface while the other interface is still communicating in the old access network. The proposed Proxy binding update is different from the Mobile IP binding update in that it includes home addres (HoA) of the old interface instead of the new interface. The performance analysis shows that the proposed scheme can efficiently reduce vertical handover delay and packet loss.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.370-381
• /
• 2005

Mobile IP provides an efficient and scalable mechanism for host mobility within the Internet. Using Mobile If, mobile nodes may change their point of attachment to the Internet without changing their If address. However, it would result in a high signaling cost. To reduce the signaling cost, we factor in the fact that mobile users will not be actively communicating much of the time. In fact, there Is no necessity to send a binding update message to the home agent when an mobile node does not communicates with others while moving. From this point of view, we propose a lazy update strategy for minimizing signaling cost using the forwarding pointer in hierarchical Mobile IPv6. In our proposal, binding updates are sent only when a mobile node is in a busy mode. If an mobile node is in a dormant mode, binding update messages are delayed until busy mode using the forwarding pointer. As a result, our proposal can reduce the total signaling cost by eliminating unnecessary binding update messages when a mobile node Is in a dormant mode. In addition to, our proposal reduces unnecessary location update cost resulting from ping-pong effect under mobile node's dormant mode. Analysis results using the discrete analytic model presented in this paper shows that our proposal can has superior performance than hierarchical Mobile nv6 when the call-to-mobility ratio is low and the length of the forwarding pointer chain K is low.