• Title/Summary/Keyword: Intermediate Node Mobility

Search Result 16, Processing Time 0.021 seconds

Supporting Intermediate-node Mobility in CCN Real-time Service (CCN 실시간 서비스에서 중간노드의 이동성 지원)

  • Lee, Eunkwan;Kwon, Taewook
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.9
    • /
    • pp.1527-1540
    • /
    • 2017
  • Recently, due to the rapid development of the internet, the production and demand of high capacity contents are rapidly increasing. In order to accommodate the changing trend of internet usage, researches on CCN, the future internet architecture, are actively being conducted. Mobility support is an important challenge in CCN real-time services, given that today's internet environment is changing to mobile and real-time services are increasing. In CCN real-time services, the mobility problem can be largely divided into consumer mobility, provider mobility, and intermediate-node mobility. Among them, when the intermediate-node moves in the CCN real-time services, the service disconnection occurs and the QoS degradation is caused. In this paper. we propose Intermediate-Node Mobility Support(INMS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

Supporting Intermediate-node Mobility in CCN Real-time Service according to Mobility Detection (CCN 실시간 서비스에서 이동성 탐지에 따른 중간노드의 이동성 지원)

  • Seong, Kukil;Kwon, Taewook
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.12
    • /
    • pp.1438-1446
    • /
    • 2019
  • Recently, the number of mobile users as well as high-speed Internet user has been increasing rapidly. Moreover, traffic is growing fast as services that provide real-time content such as Youtube and Netflix become popular. The problem of traffic control in real-time content services is important because many people use cell phones to receive real-time content. In this regard, the field of CCN is currently being studied. We studied the mobility of nodes among CCN research fields. Node mobility can be divided into three categories : consumer mobility, intermediate node, and provide mobility. In this paper, we propose Mobility Node Support(MD-INS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

A Study on the Support of Intermediate Node Mobility by Double Paths in CCN Real-Time Services (CCN 실시간 서비스 간 이중 경로에 의한 중간노드 이동성 지원에 관한 연구)

  • Keum, Suk-Ju;Kwon, Tae-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.5
    • /
    • pp.825-834
    • /
    • 2021
  • With the development of various devices and Internet platforms, production and demand for content are increasing rapidly. However, effective response to exponentially increasing data usage is difficult in current TCP/IP schemes. As a result, with the emergence of an alternative called CCN, data can be transmitted and received from the host-centered to the content-oriented, and large-capacity content can be handled with more mitigated network resources. In this paper, we will address intermediate node mobility, which is one of the areas studied in CCN. In CCN, real-time services are a very important factor for information providers as well as requestors. However, when a node departure situation occurs, packet transmission and transmission speed decreases. Therefore, to ensure these numbers, even if the intermediate node deviates using a dual path, it provides a complete QoS (Quality of Service) using an alternative path.

A Novel Scheme for an RSVP Session Handoff in Wireless IP Networks with Micro-Mobility (Micro-Mobility 환경에서의 RSVP Session Handoff를 위한 연구)

  • Kim, Jeong-Hoe;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.199-206
    • /
    • 2008
  • In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider path-comparing route (PCR) a PCR algorithm to find an intermediate node in the charge of downlink re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node (NSN) and an existing support node (ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new AR is configured by the ESN.

A Novel Scheme for an RSVP Session Handoff in Wireless IP Networks with Micro-Mobility (Micro-Mobility 환경에서의 RSVP Session Handoff를 위한 연구)

  • Kim, Jeong-Hoe;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.296-303
    • /
    • 2008
  • In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider a path-comparing route(PCR) algorithm to find an intermediate node in the charge of down-link re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node(NSN) and an existing support node(ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new access router is configured by the ESN.

GPS-Based Shortest-Path Routing Scheme in Mobile Ad Hoc Network

  • Park, Hae-Woong;Won, Soo-Seob;Kim, So-Jung;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1529-1532
    • /
    • 2004
  • A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

  • PDF

A Mobility Header Conversion Mechanism for Mobile IPv4 and Mobile IPv6 Communications (Mobile IPv4/Mobile IPv6 통신을 위한 모바일 헤더 변환 메커니즘)

  • Kim, Dae-Sun;Hong, Choong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.61-70
    • /
    • 2007
  • An interworking translator for IPv6 and IPv4 services can be defined as an intermediate component between a native IPv4 host and a native IPv6 host to enable direct communication between them without requiring any modifications to the hosts. But if the host is a mobile node, triangle routing problem occurs, since Mobile IPv4 allows mobile node to roam transparently in my network. In this situation, mobile node must notify transfer information to its own home agent and correspondent node in IPv6 network. But current NAT-PT does not permit mobility header translation. Therefore, NAT-PT does not support efficient communication between Mobile IPv4 and Mobile IPv6. In this paper, we propose a mobility header conversion mechanism to resolve the triangle routing problem between Mobile IPv4 and Mobile IPv6.

Intermediate Node Mobility Management Technique by Real-Time Monitoring in CCN Environment (CCN 환경에서 실시간 모니터링에 의한 중간노드 이동성 관리 기법)

  • Ko, Seung-Beom;Kwon, Tae-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.5
    • /
    • pp.783-790
    • /
    • 2022
  • The development of SNS and video platforms provided an opportunity to explode the activation of content production and consumption. However, in the legacy system, due to the host-based location-oriented data transmission, there are inherent limitations in efficient operation and management. As an alternative to this, a Contents Centric Network (CCN) was studied. In this paper, when intermediate nodes located between the information provider and the information requester between the real-time streaming services in the CCN environment move or restrict their use, failure through monitoring of wireless reception strength to solve problems like disconnection of transmission quality at the information consumer. We propose a stable intermediate node management mechanism through active response before occurrence.

Efficient Intermediate Node mobility Management Technique in CCN Real-time Streaming Environment (CCN 실시간 스트리밍 환경에서 효율적인 중간노드 이동성 관리 기법)

  • Yoon-Young Kim;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1073-1080
    • /
    • 2023
  • The development and speed improvement of the Internet network, and the development of many platforms based on it, have brought about a rapid expansion of production and consumption of various contents. However, the existing IP-based Internet system cannot efficiently cope with such an urgent increase in data. Accordingly, an alternative called the CCN(Contents Centric Network) has emerged, enabling more efficient data transmission and reception centered on content rather than host. In this paper, we will deal with the mobility of intermediate nodes in CCN real-time streaming service, which is one of the major research fields of CCN, and minimize network overload through more efficient path switching through RSSI detection. In other words, by improving the method of selecting and switching a spare path when an intermediate node located between the requester(consumer) and the provider moves, a mechanism for managing data transmission is not interrupted and unnecessary load due to route switching does not occur in the network.

Explicit Path Assignment(EPA) Algorithm using the Cache Information of MAP in Nested Mobile Network of HMIPv6 (HMIPv6의 중첩된 이동 네트워크에서 MAP의 캐시 정보를 이용한 명시적 경로 지정(Explicit Path Assignment) 알고리즘)

  • Song, Ji-Young;Kim, Byung-Gi
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.6
    • /
    • pp.451-460
    • /
    • 2006
  • In HMIPv6, the nested mobile network because of the mobility of node and router can be constituted. Many subnets exist and many mobile router(MR)s and mobile node(MN)s activate in the nested mobile network. If the nested depth is deeper, the number of mobile router that packet goes through, increases and data transmission delay owing to this might be larger. This paper proposes EPA algorithm which finds out the path from Mobility Anchor Point(MAP) to a destination mobile node using the binding cache information of MAP and processes the path information by adding it to packet header. If we apply EAP algorithm, the quantity of unnecessary packet within MAP domain can be decreased. Also, the transmission delay can be decreased in a intermediate mobile router because it supports packet re-transmission just by simple packet substitution.