The Experts below are selected from a list of 3474 Experts worldwide ranked by ideXlab platform

Yanghee Choi - One of the best experts on this subject based on the ideXlab platform.

  • A pointer forwarding scheme with mobility-aware Binding Update in Mobile IPv6 networks
    Computer Communications, 2008
    Co-Authors: Sangheon Pack, Byoungwook Lee, Taekyoung Kwon, Yanghee Choi
    Abstract:

    In this paper, we propose a pointer forwarding scheme with mobility-aware Binding Update in Hierarchical Mobile IPv6 networks. In the proposed scheme, a pointer chain between access routers is established to reduce the Binding Update traffic to the mobility anchor point. In addition, a mobile node (MN) performs a Binding Update to the correspondent node depending on its mobility. Specifically, an on-link care-of address is chosen for the MN with low mobility, whereas a regional care-of address is selected for the MN with high mobility. This mobility-aware Binding Update can reduce the packet delivery overhead in an adaptive manner. We develop analytical models that consider both the Binding Update cost and the packet delivery cost when route optimization is supported. Numerical results demonstrate that the pointer forwarding scheme with mobility-aware Binding Update outperforms HMIPv6 and the existing pointer forwarding scheme in different situations.

  • rbu recursive Binding Update for end to end route optimization in nested mobile networks
    International Conference on Communications, 2004
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, in this paper we propose the Recursive Binding Update (RBU) and three distinct solutions for the end-to-end routing in mobile networks using the method of obtaining the route from the Top Level Mobile Router (TLMR) to the destination Mobile Network Node (MNN). The solutions for end-to-end routing include source routing, Table Driven Forwarding (TDF), and Route Request Broadcast (RRB). From the results of the simulations, it was shown that RBU+RRB presents the best performances among the different solutions. When combined with an end-to-end routing capability, RBU+ provides optimal routing in nested mobile networks. RBU+ reduces the pinball routing cost, and this reduction becomes more significant as the degree of nesting becomes higher and the distance between the home agents of the mobile router and its parent/child mobile routers becomes longer. When combined with an appropriate reverse route optimization scheme, the routing costs are independent of the degree of nesting and the distance between the Home Agents (HAs).

  • HSNMC - RBU+: Recursive Binding Update for End-to-End Route Optimization in Nested Mobile Networks
    Lecture Notes in Computer Science, 2004
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, in this paper we propose the Recursive Binding Update (RBU) and three distinct solutions for the end-to-end routing in mobile networks using the method of obtaining the route from the Top Level Mobile Router (TLMR) to the destination Mobile Network Node (MNN). The solutions for end-to-end routing include source routing, Table Driven Forwarding (TDF), and Route Request Broadcast (RRB). From the results of the simulations, it was shown that RBU+RRB presents the best performances among the different solutions. When combined with an end-to-end routing capability, RBU+ provides optimal routing in nested mobile networks. RBU+ reduces the pinball routing cost, and this reduction becomes more significant as the degree of nesting becomes higher and the distance between the home agents of the mobile router and its parent/child mobile routers becomes longer. When combined with an appropriate reverse route optimization scheme, the routing costs are independent of the degree of nesting and the distance between the Home Agents (HAs).

  • R-BU: recursive Binding Update for route optimization in nested mobile networks
    2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484), 2003
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    This paper proposes recursive Binding Update (R-BU) that optimizes routing for nested mobile networks. Nested mobile network is a hierarchical form of mobile networks, e.g. a wireless personal area network (PAN) in a vehicular network. A mobile network moves as a single unit with one or more mobile routers that connect it to the global Internet. Nested mobile networks have pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, we propose routing optimization scheme called R-BU based on recursive Binding Update. R-BU maintains optimal route to the destination by updating its Binding recursively. R-BU requires no changes in existing mobile IP except Binding Update operation. By using R-BU, correspondent nodes can maintain optimal route to their destinations after some convergent time. R-BU reduces pinball routing cost and the reduction is more useful as the degree of nesting becomes deeper and the distance between the home agents of a mobile router and its parent/child mobile routers becomes longer.

Alexandru Petrescu - One of the best experts on this subject based on the ideXlab platform.

  • QSHINE - Delayed Location Management in Network Mobility Environments
    Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering, 2017
    Co-Authors: Sangheon Pack, Jonghyouk Lee, Alexandru Petrescu
    Abstract:

    Network mobility basic support (NEMO-BS) supports efficient group mobility. However, when NEMO-BS is applied to public transportation systems where mobile nodes (MNs) frequently get in/off the public transportation, significant signaling overhead owing to frequent and unnecessary Binding Updates can occur. To address this problem, we propose a delayed location management (DLM) scheme where an MN postpones its Binding Update for a pre-defined timer to mitigate the Binding Update overhead. To evaluate the performance of DLM, we develop an analytical model for the Binding Update cost and the packet delivery cost during the boarding time. Evaluation results demonstrate that DLM can reduce the Binding Update cost and packet delivery cost by choosing an appropriate timer.

  • DLM: Delayed location management in network mobility (NEMO)-based public transportation systems
    Journal of Network and Computer Applications, 2017
    Co-Authors: Sangheon Pack, Jonghyouk Lee, Alexandru Petrescu
    Abstract:

    Network mobility basic support (NEMO-BS) supports efficient group mobility. However, when NEMO-BS is applied to public transportation systems where mobile nodes (MNs) frequently get in/off the public transportation, significant signaling overhead owing to frequent and unnecessary Binding Updates can occur. To address this problem, we propose a delayed location management (DLM) scheme where an MN postpones its Binding Update for a pre-defined timer to mitigate the Binding Update overhead. To evaluate the performance of DLM, we develop an analytical model for the Binding Update cost and the packet delivery cost during the boarding time. Also, a timer selection algorithm is proposed to optimize the performance of DLM. Evaluation results demonstrate that DLM can reduce the Binding Update cost and packet delivery cost in a balanced manner by choosing an appropriate timer.

  • DLM: Delayed location management in network mobility (NEMO)-based public transportation systems ☆☆ ☆
    Journal of Network and Computer Applications, 2017
    Co-Authors: Sangheon Pack, Jonghyouk Lee, Alexandru Petrescu
    Abstract:

    Abstract Network mobility basic support (NEMO-BS) supports efficient group mobility. However, when NEMO-BS is applied to public transportation systems where mobile nodes (MNs) frequently get in/off the public transportation, significant signaling overhead owing to frequent and unnecessary Binding Updates can occur. To address this problem, we propose a delayed location management (DLM) scheme where an MN postpones its Binding Update for a pre-defined timer to mitigate the Binding Update overhead. To evaluate the performance of DLM, we develop an analytical model for the Binding Update cost and the packet delivery cost during the boarding time. Also, a timer selection algorithm is proposed to optimize the performance of DLM. Evaluation results demonstrate that DLM can reduce the Binding Update cost and packet delivery cost in a balanced manner by choosing an appropriate timer.

  • Delayed location management in network mobility environments
    2016
    Co-Authors: Sangheon Pack, J.-h. Lee, Alexandru Petrescu
    Abstract:

    Network mobility basic support (NEMO-BS) supports efficient group mobility. However, when NEMO-BS is applied to public transportation systems where mobile nodes (MNs) frequently get in/off the public transportation, significant signaling overhead owing to frequent and unnecessary Binding Updates can occur. To address this problem, we propose a delayed location management (DLM) scheme where an MN postpones its Binding Update for a pre-defined timer to mitigate the Binding Update overhead. To evaluate the performance of DLM, we develop an analytical model for the Binding Update cost and the packet delivery cost during the boarding time. Evaluation results demonstrate that DLM can reduce the Binding Update cost and packet delivery cost by choosing an appropriate timer.

Hyunseung Choo - One of the best experts on this subject based on the ideXlab platform.

  • cost reduced inter map Binding Update scheme in robust hierarchical mobile ipv6
    International Conference on Broadband Communications Information Technology & Biomedical Applications, 2008
    Co-Authors: Jongpil Jeong, Myoungbeom Chung, Hyunseung Choo
    Abstract:

    In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile node (MN) and its correspondent nodes (CNs). In [3], an Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It shows that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if MNs perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local Binding Update units (LBUs) as to two MAPs. A new cost-reduced Binding Update scheme is proposed to reduce this communication overhead. Our proposed scheme improves the total handover latency up to 19.6% compared with IRH-MIPv6 for Inter-MAP handover.

  • on multicast based Binding Update scheme for nemo environments
    International Conference on Computational Science and Its Applications, 2008
    Co-Authors: Moonseong Kim, Hayder Radha, Hyunseung Choo
    Abstract:

    NEMO basic support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this one, there are many route optimization (RO) solutions such as bi-directional tunneling (BT) mechanism, aggregation and surrogate (A&S) mechanism, recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although improved prefix delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents. In this paper, a solution to reduce the cost is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to about 32% over IPD-based, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

  • An Efficient Multicast-based Binding Update Scheme for Network Mobility
    KSII Transactions on Internet and Information Systems, 2008
    Co-Authors: Moonseong Kim, Hayder Radha, Jin-young Lee, Hyunseung Choo
    Abstract:

    Mobile IP (MIP) is the solution supporting the mobility of Mobile Nodes (MNs), however, it is known to lack the support for NEtwork MObility (NEMO). NEMO manages situations when an entire network, composed of one or more subnets, dynamically changes its point of attachment to the Internet. NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this weakness, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents, especially when a large number of Mobile Routers (MRs) and MNs exist in the environment such as train, bus, ship, or aircraft. In this paper, a solution to reduce the cost of delivering the BU messages is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to 32.9% over IPDbased, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

  • BroadCom - Cost-Reduced Inter-MAP Binding Update Scheme in Robust Hierarchical Mobile IPv6
    2008 Third International Conference on Broadband Communications Information Technology & Biomedical Applications, 2008
    Co-Authors: Jongpil Jeong, Myoungbeom Chung, Hyunseung Choo
    Abstract:

    In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile node (MN) and its correspondent nodes (CNs). In [3], an Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It shows that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if MNs perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local Binding Update units (LBUs) as to two MAPs. A new cost-reduced Binding Update scheme is proposed to reduce this communication overhead. Our proposed scheme improves the total handover latency up to 19.6% compared with IRH-MIPv6 for Inter-MAP handover.

  • ICCSA Workshops - On Multicast-Based Binding Update Scheme for NEMO Environments
    2008 International Conference on Computational Sciences and Its Applications, 2008
    Co-Authors: Moonseong Kim, Hayder Radha, Hyunseung Choo
    Abstract:

    NEMO basic support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this one, there are many route optimization (RO) solutions such as bi-directional tunneling (BT) mechanism, aggregation and surrogate (A&S) mechanism, recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although improved prefix delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents. In this paper, a solution to reduce the cost is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to about 32% over IPD-based, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

Jung Doo Koo - One of the best experts on this subject based on the ideXlab platform.

  • Extended Ticket-Based Binding Update (ETBU) Protocol for Mobile IPv6 (MIPv6) Networks
    IEICE Transactions on Communications, 2007
    Co-Authors: Jung Doo Koo, Dong Chun Lee
    Abstract:

    Currently, Mobile IPv6 (MIPv6) working group of Internet Engineering Task Force (IETF) recommends to execute the Binding Update (BU) using Return Routability (RR) procedure. However, the RR procedure doesn't entirely satisfy the security requirements of MIPv6. The previous BU protocols are also likely to reduce the efficiency since they iterate entirely BU protocol courses in Pico/Micro cellular environment in which it occurs frequently handoff or handover and some protocols don't consider that the Correspondent Node (CN) is movable node and has the limited resources. In this paper we propose the ETBU protocol, which is based on Cryptographically Generated Address (CGA) to provide mutual authentication between nodes; it considers that the CN is a movable node. This protocol doesn't require a Mobile Node (MN) to create a signature each time it obtains a new Care-of Address (CoA) unlike the previous CGA-based BU protocol. An MN and its CN issue the ticket to minimize the computing costs that need to calculate CGA. Also, the ETBU protocol minimizes the loss of traffic using smooth handoff or handover. A performance analysis shows that the scheme provides the security as much as the previous BU protocols and more efficiency than them in case that each node obtains the ticket. Therefore, the proposed ETBU protocol can be applied easily to the mobile network environments.

  • a new authentication scheme of Binding Update protocol on handover in mobile ipv6 networks
    Embedded and Ubiquitous Computing, 2006
    Co-Authors: Jung Doo Koo, Jungsook Koo, Dong Chun Lee
    Abstract:

    We propose a new authentication scheme of Binding Update protocol, which its Correspondent Node (CN) issues a ticket to Mobile Node (MN) when MN first executes the Binding Update (BU). This ticket assist that it is able to do efficiently the BU whenever MN requires the BU for the future. The proposed protocol need not be repeated equal BU course whenever the MN moves to foreign link or network, and is able to be executed in environment of not operating the Home Agent (HA), and also easies scalability.

  • EUC Workshops - A new authentication scheme of Binding Update protocol on handover in mobile IPv6 networks
    Emerging Directions in Embedded and Ubiquitous Computing, 2006
    Co-Authors: Jung Doo Koo, Jungsook Koo, Dong Chun Lee
    Abstract:

    We propose a new authentication scheme of Binding Update protocol, which its Correspondent Node (CN) issues a ticket to Mobile Node (MN) when MN first executes the Binding Update (BU). This ticket assist that it is able to do efficiently the BU whenever MN requires the BU for the future. The proposed protocol need not be repeated equal BU course whenever the MN moves to foreign link or network, and is able to be executed in environment of not operating the Home Agent (HA), and also easies scalability.

  • Ticket-based Binding Update protocol for mobile IPv6
    Lecture Notes in Computer Science, 2006
    Co-Authors: Sang-jin Kim, Jung Doo Koo
    Abstract:

    In this paper, we propose a new ticket based Binding Update protocol for Mobile IPv6. This protocol uses CGA (Cryptographically Generated Address) to provide mutual authentication between a mobile node and its corresponding node, but differs from previous protocols in the following way. The protocol does not require a mobile node to generate a signature each time it acquires a new IP address. To minimize computational cost of using CGA, the corresponding node issues a ticket that can be used in later Update requests. Our initial protocol requires similar computational cost compared to previous protocols based on CGA, but outperforms others when a mobile node has a valid ticket.

  • ICDCIT - Ticket-Based Binding Update protocol for mobile IPv6
    Distributed Computing and Internet Technology, 2006
    Co-Authors: Sang-jin Kim, Jung Doo Koo
    Abstract:

    In this paper, we propose a new ticket based Binding Update protocol for Mobile IPv6. This protocol uses CGA (Cryptographically Generated Address) to provide mutual authentication between a mobile node and its corresponding node, but differs from previous protocols in the following way. The protocol does not require a mobile node to generate a signature each time it acquires a new IP address. To minimize computational cost of using CGA, the corresponding node issues a ticket that can be used in later Update requests. Our initial protocol requires similar computational cost compared to previous protocols based on CGA, but outperforms others when a mobile node has a valid ticket.

Hosik Cho - One of the best experts on this subject based on the ideXlab platform.

  • rbu recursive Binding Update for end to end route optimization in nested mobile networks
    International Conference on Communications, 2004
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, in this paper we propose the Recursive Binding Update (RBU) and three distinct solutions for the end-to-end routing in mobile networks using the method of obtaining the route from the Top Level Mobile Router (TLMR) to the destination Mobile Network Node (MNN). The solutions for end-to-end routing include source routing, Table Driven Forwarding (TDF), and Route Request Broadcast (RRB). From the results of the simulations, it was shown that RBU+RRB presents the best performances among the different solutions. When combined with an end-to-end routing capability, RBU+ provides optimal routing in nested mobile networks. RBU+ reduces the pinball routing cost, and this reduction becomes more significant as the degree of nesting becomes higher and the distance between the home agents of the mobile router and its parent/child mobile routers becomes longer. When combined with an appropriate reverse route optimization scheme, the routing costs are independent of the degree of nesting and the distance between the Home Agents (HAs).

  • HSNMC - RBU+: Recursive Binding Update for End-to-End Route Optimization in Nested Mobile Networks
    Lecture Notes in Computer Science, 2004
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, in this paper we propose the Recursive Binding Update (RBU) and three distinct solutions for the end-to-end routing in mobile networks using the method of obtaining the route from the Top Level Mobile Router (TLMR) to the destination Mobile Network Node (MNN). The solutions for end-to-end routing include source routing, Table Driven Forwarding (TDF), and Route Request Broadcast (RRB). From the results of the simulations, it was shown that RBU+RRB presents the best performances among the different solutions. When combined with an end-to-end routing capability, RBU+ provides optimal routing in nested mobile networks. RBU+ reduces the pinball routing cost, and this reduction becomes more significant as the degree of nesting becomes higher and the distance between the home agents of the mobile router and its parent/child mobile routers becomes longer. When combined with an appropriate reverse route optimization scheme, the routing costs are independent of the degree of nesting and the distance between the Home Agents (HAs).

  • R-BU: recursive Binding Update for route optimization in nested mobile networks
    2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484), 2003
    Co-Authors: Hosik Cho, Eun Kyoung Paik, Yanghee Choi
    Abstract:

    This paper proposes recursive Binding Update (R-BU) that optimizes routing for nested mobile networks. Nested mobile network is a hierarchical form of mobile networks, e.g. a wireless personal area network (PAN) in a vehicular network. A mobile network moves as a single unit with one or more mobile routers that connect it to the global Internet. Nested mobile networks have pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, we propose routing optimization scheme called R-BU based on recursive Binding Update. R-BU maintains optimal route to the destination by updating its Binding recursively. R-BU requires no changes in existing mobile IP except Binding Update operation. By using R-BU, correspondent nodes can maintain optimal route to their destinations after some convergent time. R-BU reduces pinball routing cost and the reduction is more useful as the degree of nesting becomes deeper and the distance between the home agents of a mobile router and its parent/child mobile routers becomes longer.