• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2004

Mobile computing environment makes it possible for computing activities to be maintained during movement even if a user changes its network point of attachment. Mobile IP is a standard protocol designed to be used in such mobile computing environment. However, Mobile IP has a drawback to incur a lot of handoff delays and waste network resources, since CoA(Care of Address) registration packets need to go through a HA(Home Agent) first whenever a mobile node moves. To solve this long-standing problem, this paper proposes a new scheme that, for infra-domain movement, efficiently performs local handoff without notifying the HA Specifically, based on the notion of load balance, the proposed scheme allows every FA(Foreign Agent) in a domain to become the root FA(also known as domain FA) dynamically, thus distributing the registration task into many other foreign agents. The dynamic root assignment through load balancing ultimately leads to fast network response due to less frequent transmission of registration packets.

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

In the Mobile IP, the movement of Mobile Host(MH) causes packets to be transmitted through a long route. A Correspond Node(CN) first communicate with a Home Agent(HA) when a Mobile Host moved from one subnet to another subnet. The HH-MIP algorithm reduces an inefficient transmission of packets by regarding a Foreign Agent(FA) near a mobile host as a Temporary Home Agent(THA). However, The algorithm costs the unnecessary signaling by measuring the distance of route between a FA and a THA for handover in the case that a Mobile host comes from a THA which a current FA never communicated. To solve this problem, we propose a scheme called Hierarchical Home Agent Handover in Mobile IP(HHH-MIP) algorithm. Our HHH-MIP algorithm only searches tables in a router by using the hierarchical structure between a FA and a THA. The simulation results show that the HHH-MIP algorithm reduces the additional signaling cost.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1113-1116
• /
• 2003

무선 네트워크를 통해 인터넷에 접속하려는 이동노드 수가 늘어남에 따라 다수의 이동노드에게 무선 서비스를 제공해야하는 HA(Hone Agent)와 FA(Foreign Agent)에서의 부하도 함께 증가하고 있다. 특히 지역적 등록(Regional Registration)에서와 같이 투선 네트워크 도메인의 최상위 FA가 현재 도메인에 로밍한 모든 이동노드의 COA로 동작함으로 인해 발생하는 부하는 최상위 FA에서 혼잡 및 지연의 원인이 된다. 이에 본 논문에서는 최상위 FA에서 발생말 수 있는 부하를 하위 FA에게 분산하기 위하여 두 가지 접근방법인 Passive Approach와 Active Approach를 제안한다 Passive Approach는 부모 FA가 부하 분산 시점을 결정하여 자식 FA에게 분산해주는 기법이고 Active Approach는 임의의 FA가 스스로 분산 시점을 결정하여 상위 FA에서 발생할 수 있는 부하를 완화시켜주는 기법이다. 시뮬레이션을 통해 Active Approach의 한 형태를 띠고 있는 기존 연구인 LNSP 기법과 성능을 비교하여 가장 효율적인 부하 분산 방법을 제시한다.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.105-113
• /
• 2003

In CDMA cellular system, inefficient Channel assignment for high-speed mobile host increase call blocking probability For it has been method proposed to guarantee QoS upon tn the speed of hierarchical cell that is allocated Queues and dedicated channels of high speed mobile host's speed. In this paper, We allocated the dedicated channel of high-speed handoff In FA (Foreign Agent), only if the receive signal strength of mobile host in current cell that there is low traffic in HA (Home Agent). also, we created new Circular queue LiFA (Limited Foreign Agent) for high-speed handoff call that signal strength is weak in certain FA, and had this High-speed handoff call to be ready for Life time to the new Circular queue LiFA. Thus improve the rate of the forced call termination.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3490-3499
• /
• 2000

There are two approaches, HA(Home Agent)-based and FA(Froegn Agent)-based mulicasting in mobile computing environments based on mobile IP. If we consider efficiency of routing and bandwidth the FA-based model is better than the HA-based model. But in the case of a MH(Mobile Host) moves frequently it shows bad connection durability because of join and graph delays. To overcome this and to support effective mobile multicasting we propose an extended FA-based multicast routing. In our model previous FA for wards multicast packets to MH. while new FA processes a jion request from MH. That is in general case our model supports FA-based multicasting for efficiency but it provides unicast-based mulicasting for connection durability when MH moves to new FN(Roreign Network). To evaluate our model, we analyze connecction durability, bandwidth, overheads and routing sosts in many situations and compare with previous works.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.58-60
• /
• 2003

Mobile IP는 현재의 인터넷에서 노드가 링크를 변화시킬 때 통신이 지속 될 수 있도록 이동성(Mobility)을 제공하기 위한 방안이다. Mobile IP는 MN(Mobile Node)이 HA(Home Agent) 와 FA(Foreign Agent)사이에서 링크를 변화시킬 때 CN(Correspondent Node)과 지속적인 통신을 할 수 있도록 한다. 그러나 FA에서 FA로 MN이 노드의 위치를 바꿀 때에는 핸드오프(Handoff)가 발생하여 패킷이 손실 될 수도 있다. 본 논문은 MN이 FA에서 다른 FA로 이동할 때 발생하는 패킷 손실과 순서변경에 대한 경우를 살펴 이를 해결하기 위한 Seamless 핸드오프 프로토콜을 기술하고 이를 검증한다.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.67-75
• /
• 2004

In this paper, we design an authentication model based mobile PKI (Public Key Infrastructure). The authentication mood consists of Root-CA Home-network agent and Foreign-network agent. CA will going to gave the delegation ticket to Home-Agent or Foreign-Agent when they request. The authentication mode information security is various characteristic more then high speed, mobile network and low cost more then previous structure of assure information security.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.167-179
• /
• 2005

In hierarchical Mobile IPv4 Networks the highest FA(Foreign Agent) may experience serious congestion and delay since the highest FA plays a role of CoA(Care of Address) for all mobile nodes in the domain, In this paper, we propose mechanism called 'HRFA(Hierarchical Root Foreign Agent)', which distributes the load imposed on the highest FA. In the proposed HRFA scheme, multiple HRFAs are selected to provide the similar service that is provided by the highest FA. According to which entity determines HRFAs, HRFA scheme is categorized into 'Active' and 'Passive' approaches. HRFA scheme is further categorized into 'All MN(Mobile Node)s' and 'New MNs' approaches, depending on which mobile nodes are assigned to a newly elected HRFA. Through a course of simulations, we investigate the performance of 4 possible combinations of HRFA schemes. We also compare the performance of the proposed HRFA schemes with the LMSP(Local Multicast Service Provider) scheme, which is a scheme to distribute the load of FA for multicast service in hierarchical wireless network domain. The simulation results show that the Passive & New MN approach performs best with respect to both the overhead and the load balancing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.1-9
• /
• 2001

The Mobile IP protocol allows IP hosts to move between different networks without changing their IP addresses. The Mobile IP systems supporting the local registration were introduced to reduce the number of times when a home registration with the remotely located Home Agent is needed. The local registration Mobile IP protocol enhanced the performance by processing the MN\`s registration requests at a local agent. However. the local registration approach may consider other aspects of the Mobile IP systems as the FA fault tolerance. In this paper, we will briefly review previous protocols to support the FA fault tolerance in hierarchical local registration Mobile If system and will propose a fault tolerance protocol with backup FA in hierarchical local registration mobile IP t() enhance the efficiency of such systems against Foreign Agent failures.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.132-139
• /
• 2003

In this paper, we design and implement the public key certification the structure of assure information security which play an important role in PKI (Public Key Infrastructure). The structure of assure information security consists of Root-CA, Home-network and Foreign-network. CA will going to gave the mandate to Home-Agent or Foreign-Agent when they request. The structure of assure information security is various characteristic : more then high speed, mobile network, and low cost more then previous structure of assure information security.