• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.255-266
• /
• 2007

RSVP (Resource reSerVation Protocol) is the Internet standard protocol for supporting QoS (Quality of Service) requirements by reserving network resources between the sender and the receiver. Several problems, such as common path identification and resource pre-reservation, should be solved to apply RSVP in wireless mobile environments. To resolve these problems, this paper proposes DBRA (Dynamic Branch Router Approach) based on two designated entities, candidate access routers and a branch router. While several RSVP sessions between a branch router and candidate routers are managed, DBRA makes use of only one RSVP session between the sender and a branch router. Based on a network simulation, the proposed scheme has been compared with MRSVP (Mobile RSVP) and HMRSVP (Hierarchical MRSVP) in terms of the average packet transmission rate, bandwidth utilization and RSVP session failure rate.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.82-85
• /
• 2005

In the MIPv6 network, when mobile nodes move into new newtwork, they need to find the new access router and points(AR/AP) for the newtwork. Unless they are not connected to authorized AR/APs, they can be exposed to a lot of attacks. In this paper we propose a protocol to authenticate AR/AR and MN each other. This protocol is based on the public key scheme which is used in the SEcure Neighbor Discovery(SEND) protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.658-667
• /
• 2009

NEMO (Network Mobility) introduces the concept of mobile router in order to supply users with group mobility over wireless and mobile networks. This paper investigates the advantages and disadvantages of NEMO in terms of the overhead of group mobility management. This paper proposes the additional requirements to enhance NEMO performance. Moreover, we analyze the main communication paths, CN-HA, HA-MR, and MR-MNN, in the real NEMO testbed.

• Journal of the military operations research society of Korea
• /
• v.22 no.2
• /
• pp.73-89
• /
• 1996

This paper suggests the new IP, SIMIP(Simple Mobile IP), which supports a continuous mobility between a static host and a mobile host in the static TCP/IP LAN environment where mobile hosts are overlayed with cells. For designing a mobile protocol, routing optimization is very important, and it is directly related to the management mechanism of a mobile host's location information. When the mobile hosts' location information are centralized, the network has high risk when a centralized device fails. On the other hand, when they are distributed, the above problems are solved. But it requires complicated techniques in order to search the encapsulated addresses. SIMP centralizes mobile hosts' location information, minimizes the risk by automatically substituting the failed default mobile router with one of the multiple general mobile routers, and supports the optimal routing path through "default mobile router path alternation" Then since SIMIP isn't reasonable the operations informations to the chief in military operations room.ions room.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.337-339
• /
• 2003

NGN 시대가 될수록 이동성을 지원하면서 네트워크를 효율적으로 이용하는 기술이 요구된다. Mobile Ipv6은 이와 같은 요구조건을 만족시키는 좋을 방법이다. 본 논문에서는 이동호스트가 핸드오버를 수행할 때 발생하는 Triangle Routing 오버헤드를 감소시키는 핸드오버 프로토콜을 제안한다. 제안된 핸드 오버 프로토콜은 Previous Access Router(PAR)가 Binding Update(BU) 메시지를 전송하게 함으로써 PAR에서 New Access Router(NAR)로 포워딩되는 패킷의 개수를 감소시킨다. 제안된 핸드오버는 NS-2(network simulation)에서 시뮬레이션 되었고, 멀티미디어 데이터 통신에 사용되는 UDP를 이용하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.439-441
• /
• 2003

사용자의 인터넷 환경이 점차 무선 접속을 통한 인터넷의 사용과 실시간 응용 데이터의 사용이 늘어가는 추세에 따라. 이동 인터넷 서비스를 하기 위한 방안으로 Mobile If와 Mobile IPv6가 제시되었다. 본 논문에서는 Mobile IPv6 환경에서 Neighbor Discovery 중 Router Solicitation과 Router Advertisement가 호스트의 이동성 지원에 미치는 영향을 분석하였다. Neighbor Discovery 메시지들의 주기를 변경하여, 실제 구현, 측정하여 Handoff의 효율성과 전송 대역폭 overhead의 상관관계를 알아보았다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.129-132
• /
• 2001

The ad hoc network was composed of Mobile hosts. Due to the limited transmission range of each mobile node hosts, in such an environment, it is essential for other hosts to coorperate to transfer packet to destination. Moreover, the existing routing protocol algorithms are not efficient on the ad hoc network because a mobile host operates router without fixed router. In this paper, we will compare and analysis for the performance of existing ad hoc network routing protocols through simulation.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.345-352
• /
• 2006

In the integrated wired/wireless network which consists of the Internet and moving networks, multiple wireless links are used to connect a fixed host(FH) in the Internet to a mobile host(MH) in the moving network. For use in such an environment, we propose a scheme to overcome the TCP performance degradation due to the packet losses over the wireless links without losing the end-to-end TCP semantics. The proposed scheme in each mobile router(MR) allows to obtain the information regarding packet losses over the upstream wireless links based on the received packet sequence number and the ACK number. This information is delivered to the upstream router, which enables the upstream access router(AR) or MR to quickly retransmit the lost packets. The proposed scheme has the feature to quickly recover the packet losses incurred over the upstream wireless links and the performance of the proposed scheme is evaluated through simulation. It is shown that the significant performance gain can be obtained using the proposed scheme compared with the snoop mechanism which maintains end-to-end TCP semantics and does not require any additional features at the source and/or destination nodes.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.339-342
• /
• 2011

This paper proposes a network-based mobility control scheme in wireless/mobile networks, which is based on the Locator-Identifier Separation Protocol (LISP). Compared to the existing LISP mobility scheme, the proposed scheme is featured by the following two points: 1) each LISP Tunnel Router (TR) is implemented at the first-hop access router that mobile nodes are attached to, and 2) for handover support, the LISP Routing Locator (RLOC) update operation is performed between Ingress TR and Egress TR. By numerical analysis, it is shown that the proposed scheme can reduce the handover latency much more than the other candidate schemes.