• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.1-15
• /
• 2007

Increase in the wireless mobile network users brings the issue of mobility management into the Virtual Private Network (VPN) services. We propose a provider edge (PE)-based provider provisioned mobile VPN mechanism, which enables efficient communication between a mobile VPN user and one or more correspondents located in different VPN sites. The proposed mechanism not only reduces the IPSec tunnel overhead at the mobile user node to the minimum, but also enables the traffic to be delivered through optimized paths among the (mobile) VPN users without incurring significant extra IPSec tunnel overhead regardless of the user's locations. The proposed architecture and protocols are based on the BGP/MPLS VPN technology that is defined in RFC24547. A service provider platform entity named PPVPN Network Server (PNS) is defined in order to extend the BGP/MPLS VPN service to the mobile users. Compared to the user- and CE-based mobile VPN mechanisms, the proposed mechanism requires less overhead with respect to the IPSec tunnel management. The simulation results also show that it outperforms the existing mobile VPN mechanisms with respect to the handoff latency and/or the end-to-end packet delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.595-598
• /
• 2014

In order to provide the Mobile Stations operating in IEEE 802.11 Wireless LAN network with seamless handover, a comprehensive study on the functions of handover considering various networking environments and characteristics of Mobile Stations is required. Note that the channel scan process finding a new AP takes the major portion of handover time, and this is the most significant issue with seamless handover for real-time multimedia service in WLAN environment. In this paper the functions required to provide seamless handover in IEEE 802.11 WLAN network are identified, and a new scanning technique is proposed with which the Mobile Stations can selectively scan the channels to reduce the channel scan time in various network environments. Here each Mobile Station awares of the channels the neighbor APs are using by scanning them in advance according to the proposed technique. Afterwards, when handover is actually required, the optimal AP is decided quickly by scanning only the predetemined group of channels and order of scan without unnecessary scan of all the channels. In addition, proposes to enter the Scan Trigger Value and Handover Threshold Value in mobile phones in order to prevent the phenomenon can not handover.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.515-524
• /
• 2005

As the number of the mobile nodes (MNs) increases in the networks, the signaling traffic generated by mobility management for MNs will increase explosively, and such a phenomenon will probably affect overall network performance. In this paper, we propose a novel analytical approach using a continuous-time Markov chain model and hierarchical network model for the analysis on the signaling load of representative IPv6 mobility support Protocols such as Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6). According to these analytical modeling, this paper derives the various signaling costs, which are generated by an MN during its average domain residence time when MIPv6 and HMIPv6 are deployed under the same network architecture, respectively. In addition, based on these derived costs, we investigate the effects of various mobility/traffic-related parameters on the signaling costs generated by an MN under MIPv6 and HMIPv6. The analytical results show that as the average moving speed of an MN gets higher and the binding lifetime is set . to the larger value, and as its average packet arrival rate gets lower, the total signaling cost generated during its average domain residence time under HMIPv6 will get relatively lower than that under MIPv6, and that under the reverse conditions, the total signaling cost under MIPv6 will get relatively lower than that under HMIPv6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.253-263
• /
• 2005

This paper proposed a mobile multicast technique to satisfy end-to-end QoS for various user requirements in mobile network environment. In order to provide seamless mobility, fast handoff technique was applied. By using L2 mobile trigger, it was possible to minimize remarkable amount of packet loss by delay occurred during handoff. To provide efficient multicast, concept of hierarchy was introduced to Xcast++, which results in a creation of HXcast++. HXcast++ optimized transfer path of multicast and reduced expensive multicast maintenance costs caused by frequent handoff. Suggestion of GMA (Group Management Agent) mechanism allows joining to group immediately without waiting IGMP Membership query during handoff. GMA mechanism will minimize the delay for group registration process and the resource usage due to delay of withdrawal process. And also use of buffering & forwarding technique minimized packet loss during generation of multicast tree. IntServ/RSVP was used to provide End-to-End QoS in local domain and DiffServ was used in global domain. To minimize reestablishment of RSVP session delay, extended HXcast++ control messages ware designed to require PATH message. HXcast++ proposed in this thesis is defined as multicast technique to provide end-to-end QoS and also to satisfy various user requirements in mobile network environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.316-318
• /
• 2006

본 논문에서는 차세대 지능형 교통시스템인 UTIS(Urban Traffic Information System)의 빠른 접속 요구 조건을 만족하기 위한 DLC(Dynamic Limited Contention) 알고리즘을 제안한다. UTIS 네트워크는 고속으로 이동하는 차량에 설치된 모바일 노드와 도로 변에 설치된 노변 기지국으로 구성되며, 이 네트워크를 통해서 IP 데이터 그램의 전송 서비스, 방송 데이터를 실시간으로 전송하는 실시간 전송 서비스 그리고 차량의 위치를 계속적으로 알려 주는 위치 탐색 서비스를 지원한다. 이러한 전송 서비스를 지원하기 위해서 UTIS는 물리 계층과 MAC 계층으로 구성된다. 그러나 UTIS에서는 차량의 고속 이동으로 인해서 셀(cell)간의 핸드오프가 빈번히 발생하고 또한 위치 추적과 방송 서비스와 같은 실시간 전송 서비스를 지원해야 하기 때문에 기존의 802.11 MAC을 사용할 수 없다. 즉 UTIS에서의 빠른 등록 요구 조건을 충족시키기 위해 기존의 802.11에서 사용하는 경쟁(contention) 방식은 비효율적이다. 본 논문에서는 셀 내에 도착하는 노드 수에 따라 경쟁을 하는 그룹의 크기를 동적으로 조절하는 DLC 알고리즘을 제안한다. 기존의 UTIS에서는 그룹 크기를 정적으로 결정하고 모바일 노드는 자신의 주소에 이 정적 그룹 크기로 modulo하여 자신의 속한 그룹을 초기에 계산한다. 기지국이 접속해야하는 그룹을 폴링 메시지로 지정할 때 그 그룹에 속한 모바일 노드들만이 제한적으로 경쟁하게 된다. 이러한 정적인 그룹 크기는 셀 내에의 노드의 숫자와 그룹 크기의 분포를 고려하지 않는 방식으로 비효율적이다. 본 DLC 알고리즘에서는 전 폴링 주기 동안에 경쟁하는 노드의 빈도수를 계속적으로 추적하여 등록 시점에 경쟁하는 그룹의 개수를 동적으로 조절하게 된다. 이러한 방식은 UTIS와 같이 접속 시간이 제한적이고 접속하려는 노드 수가 빠르게 변화하는 환경 하에서 기존의 802.11 MAC 프로토콜과 정적인 그룹 크기 방식에 비해 효율적이다.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.838-849
• /
• 2005

Fast handover protocol provides seamless handover in mobile Ipv6 networks by reducing handover latency. This paper proposes FMIP-M mechanism to apply this advantage of fast handover protocol to multicast service. The FMIP-M is a fast handover mechanism that supports a reliable multicast service in mobile Ipv6 networks. When hosts move other networks, they may have seine data missing and out-of-synch problems of multicast data. The proposed mechanism provides reliable multicast transmission by compensating data losses from the previous AR. Also it provides an additional function that is able to change multicasting service types dynamically in accordance with network status related with multicasting. So that it is able to make multicast paths very close to the optimum and more efficient multicast service is possible. The performance of the proposed mechanism is evaluated by a time analysis and simulations in various conditions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.21-30
• /
• 2005

Recently, a mobile IPv6 binding update protocol using Address Based Keys (BU-ABK) was proposed. This protocol applies Address Based Keys (ABK), generated through identity-based cryptosystem, to enable strong authentication and secure key exchange without any global security infrastructure. However, because it cannot detect that public cryptographic parameters for ABKs are altered or forged, it is vulnerable to man-in-the-middle attacks and denial of service attacks. Furthermore, it has heavy burden of managing the public cryptographic parameters. In this paper, we show the weaknesses of BU-ABK and then propose an enhanced BU-ABK (EBU-ABK). Furthermore, we provide an optimization for mobile devices with constraint computational power. The comparison of EBU-ABK with BU-ABK shows that the enhanced protocol achieves strong security while not resulting in heavy computation overhead on a mobile node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2A
• /
• pp.128-139
• /
• 2004

As the Internet usage grows, people want to access the Internet while they are moving. To satisfy this requirement economically, IEEE 802.11 Wireless LANs(WLANs) are rapidly deployed. In order to support mobility, WLANs must provide smooth handoff mechanism. Recent studies show, however, handoff delay of WLANs exceeds 300ms, most of which is due to slow scanning mechanism finding a new AP. With this handoff delay, current WLANs is not suitable to provide seamless realtime interactive services such as VoIP sevice. In this paper, we analyze the current handoff method of IEEE 802.11 and we propose a new handoff algorithm which can decrease time needed for searching a new AP and thus reduce overall handoff time. We show by simulation that the proposed algorithm has shorter handoff delay than current handoff method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.93-99
• /
• 2009

The Internet Engineering Task Force (lETF)proposed the Mobile IPv6 protocol to provide host mobility in IPv6-based network and to offer a standardized technology. However, Mobile IPv6 (MIPv6) is not applied in actual network because of long handover latency and packet loss problems. Therefore, to compensate these drawbacks, many studies are in progress and FMIPv6 (Fast handover for Mobile IPv6) is one of the studies that has been proposed to supplement the shortcomings of MIPv6. But there are problems occurred in using router tunneling which causes packet loss and out of sequence problems. In this paper, we propose an Advanced Mobile IPv6 (AMIPv6) protocol to minimize the handover latency when Mobile Node frequently moves in each subnet. We compared the performance analysis of AMIPv6 handover latency with MIPv6 handover latency in the same network environment to prove that AMIPv6 is more efficient.