• Title/Summary/Keyword: anchor point

Search Result 160, Processing Time 0.026 seconds

A Study of Performance Enhancement in Hierarchical Mobile IPv6 using Fast-Handoff

  • Kim, Hong-Sik;Kim, Hyun-Yong;Jung, Joseph;Song, Joo-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1417-1420
    • /
    • 2004
  • The combination of Fast-Handoff and Hierarchical Mobile IPv6 (F-HMIPv6) allows the anticipation of the layer3 handoff such that data traffic can be efficiently redirected to the mobile node's new location before it moves there. However, after moving to the new Access Router (NAR), if the mobile node (MN) sends the Local Binding Update (LBU) to the Mobility Anchor Point (MAP) before receiving all of the buffered packet from the NAR, the MN may receive the general packet from the MAP. That is, the MN may simultaneously receive two types of packet which has different sequence number. These cause the confusion in packet order, and the MN sends the dup ack for the packet retransmission to the CN. It results in the degradation of the TCP performance. Therefore, we propose the scheme for minimizing the out-of-sequence packet in F-HMIPv6.

  • PDF

Accurate Localization Scheme using Lateration in Indoor Environments (실내 환경에서 래터레이션을 이용한 위치 측위 기법)

  • Lim, Yu-Jin;Park, Jae-Sung
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.251-258
    • /
    • 2010
  • In an indoor localization method taking the lateration-based approach, the location of a target is estimated with the location of anchor points (APs) and the approximated distances between the target and APs using received signal strength (RSS) measurements. The accuracy of distance estimation affects the localization accuracy of a lateration-based method. Since a radio propagation environment varies randomly in time and space, the highest RSSs do not necessarily give the best estimation of the distances between a target and APs. Thus, all APs hearing a target have been used for localization. However, the accuracy of a lateration-based method degrades if more APs beyond a certain threshold are used because the area of polygon with the APs increases. In this paper, we focus on reducing the size of the polygon to further increase the localization accuracy. We use the centroid of the polygon as a reference point to estimate the relative location of a target in the polygon. Once the relative location is estimated, only the APs which are closest to the target are used for localization to reduce the area of the polygon with the APs. We validate the proposed method by implementing an indoor localization system and evaluating the accuracy of the proposed method in the various experimental environments.

A Scheme for Load Distribution and Macro Mobility in Hierarchical Mobile IPv6 (HMIPv6에서 부하분산 및 매크로 이동성 지원 방안)

  • Seo, Jae-Kwon;Lee, Kyung-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.4
    • /
    • pp.49-58
    • /
    • 2007
  • Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead in employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent. However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing algorithm in which the routing path changes between mobile node (MN) and correspondent node(CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. The proposed algorithm not only enables complete handover binding-update of the on-link care of address (LCoA) only when inter-domain handover occurs, but concentrated load of a particular MAP is distributed as well. This is because the MNs registered with higher layer MAP and lower layer MAP coexist in the VD. We simulate the performance of the proposed algorithm and compare with HMIPv6.

A Performance Enhancement Scheme of Hierarchical Mobility Management in IPv6 Networks (IPv6 네트워크에서 계층적 이동성 관리의 성능향상 방안)

  • Seo, Jae-Kwon;Lee, Kyug-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.119-126
    • /
    • 2007
  • Recently, the mobility of users and mobile communication technologies have developed rapidly. The users in this state also want to connect their devices and to receive services anywhere, anytime. Hierarchical Mobile IPv6 (HMIPv6) has been proposed by the Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead when employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely Mobility Anchor Point (MAP) as a local home agent. However, HMIPv6 has been found to cause longer handover latency when the inter-domain handover occurs. This is because a Mobile Node (MN) has to generate two addresses and register them to Home Agent (HA) a MAP, respectively. In order to solve such problems, we propose a scheme that an MN generates one address and registers it to HA for supporting fast handover during the inter-domain handover process. In the proposed scheme, the load of MAP and MAP domain is reduced because the number of MNs which are managed by MAP is decreased and the MAP does not perform proxy Neighbor Discovery Protocol (NDP) to intercept packets destined to MNs. We evaluate the performance of proposed scheme in comparison to HMIPv6 through the simulation and numerical analysis.

A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks (HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.37-44
    • /
    • 2008
  • In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

An Experimental Study on the Precast Segmented PSC Girder with I-Shape and Box-Shape Cross-Section (I형 단면과 BOX형 단면을 갖는 프리캐스트 분절 PSC 거더의 실험적 연구)

  • Kim, Sun-Hee;Lee, Seng-Hoo;Park, Joon-Seok;Cheon, Jinuk;Yoon, Soon-Jong
    • Journal of the Korean Society for Advanced Composite Structures
    • /
    • v.6 no.2
    • /
    • pp.8-16
    • /
    • 2015
  • Prestressed concrete (PSC) is a method in which prestressed tendon is placed inside and/or outside the reinforced concrete member and the compressive force applied to the concrete in advance to enhance the engineering properties of concrete member which is weak under tension. In this paper we suggested the precast PSC girder assembled with segments of portable size and weight at the factory. The segments of precast PSC girder will be delivered and assembled as a unit of PSC girder at the site. Consequently, we suggested new-type of precast segmented PSC girder with different shapes of segment cross-section (i.e., I-shape, Box-shape). To mitigate the problems associated with the field splice between the segments of precast PSC girder anchor system is attached near the neutral axis of the girder and relatively uniform compression throughout the girder cross-section is applied. Prior to the experimental investigation, analytical investigation on the structural behavior of precast PSC girder was performed and the serviceability (deflection) and safety (strength) of the girder were confirmed. In addition, 4-point bending test on the girder was conducted to investigate the structural performance under bending. From the experimental investigation, it was found that the precast PSC girder spliced with 3 and 5 segments has sufficient in serviceability and safety conditions and it was also observed that the point where the segments spliced has no defects and the girder behaves as a unit.

An Instance Segmentation using Object Center Masks (오브젝트 중심점-마스크를 사용한 instance segmentation)

  • Lee, Jong Hyeok;Kim, Hyong Suk
    • Smart Media Journal
    • /
    • v.9 no.2
    • /
    • pp.9-15
    • /
    • 2020
  • In this paper, we propose a network model composed of Multi path Encoder-Decoder branches that can recognize each instance from the image. The network has two branches, Dot branch and Segmentation branch for finding the center point of each instance and for recognizing area of the instance, respectively. In the experiment, the CVPPP dataset was studied to distinguish leaves from each other, and the center point detection branch(Dot branch) found the center points of each leaf, and the object segmentation branch(Segmentation branch) finally predicted the pixel area of each leaf corresponding to each center point. In the existing segmentation methods, there were problems of finding various sizes and positions of anchor boxes (N > 1k) for checking objects. Also, there were difficulties of estimating the number of undefined instances per image. In the proposed network, an effective method finding instances based on their center points is proposed.

Improved design for mooring line with lumped weight at seabed (중량체 적용을 통한 계류선의 설계개선 방안 연구)

  • Song, JaeHa;Shin, SeungHo;Jung, DongHo;Kim, HyeonJu
    • Journal of Ocean Engineering and Technology
    • /
    • v.27 no.6
    • /
    • pp.22-26
    • /
    • 2013
  • The purpose of this study was to improve the design of a mooring line by attaching a lumped mass to it on the seabed. A numerical analysis of the redesigned mooring system is performed to analyze the effect of the weight of the attached lumped mass using the commercial software Orcaflex. The ultimate tension of the mooring system with the lumped mass is compared with that of a bare mooring line in the original design. An appropriately designed weight for the lumped mass is found to induce a critical lifted point in the mooring line by floater motion in the ultimate condition to move toward the floater position from the anchor point, while maintaining a similar safety factor for the mooring line. On the other hand, it is shown that excess weight for the lumped mass induces snapping in a mooring line, resulting in low safety factor for the mooring system. The distance between lumped weights is shown to be a minor parameter affecting the safety of a mooring line, although a shorter line has an advantage from an economic point of view. Using the optimal weight for the lumped mass attached to the mooring line on a seabed reduces the mooring line length and installation area occupied by a mooring system under real sea conditions.

Point Cloud Video Codec using 3D DCT based Motion Estimation and Motion Compensation (3D DCT를 활용한 포인트 클라우드의 움직임 예측 및 보상 기법)

  • Lee, Minseok;Kim, Boyeun;Yoon, Sangeun;Hwang, Yonghae;Kim, Junsik;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.26 no.6
    • /
    • pp.680-691
    • /
    • 2021
  • Due to the recent developments of attaining 3D contents by using devices such as 3D scanners, the diversity of the contents being used in AR(Augmented Reality)/VR(Virutal Reality) fields is significantly increasing. There are several ways to represent 3D data, and using point clouds is one of them. A point cloud is a cluster of points, having the advantage of being able to attain actual 3D data with high precision. However, in order to express 3D contents, much more data is required compared to that of 2D images. The size of data needed to represent dynamic 3D point cloud objects that consists of multiple frames is especially big, and that is why an efficient compression technology for this kind of data must be developed. In this paper, a motion estimation and compensation method for dynamic point cloud objects using 3D DCT is proposed. This will lead to switching the 3D video frames into I frames and P frames, which ensures higher compression ratio. Then, we confirm the compression efficiency of the proposed technology by comparing it with the anchor technology, an Intra-frame based compression method, and 2D-DCT based V-PCC.

Improving Performance of HMIPv6 Networks with Adaptive TUE Selection Scheme (적응적 MAP 선택을 통한 HMIPv6 네트워크의 성능 향상 알고리즘)

  • Chung, Won-Sik;Lee, Su-Kyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.945-952
    • /
    • 2006
  • In hierarchical mobile IPv6 networks, when an inter-domain handover occurs, mobile nodes suffer from excessive signaling traffic and long handover latency, resulting in possible disruption of ongoing connections. Further, the selection of MAP and its load status critically affect the overall system performance. Therefore, we propose a dynamic MAP selection scheme that seeks to distribute load among MAPs as well as reduces inter-domain handovers. Performance is evaluated from not only an analytic model of average signaling cost but also simulation. The analytical and simulation results show that our proposed scheme improves load distributedness and reduces inter-domain handovers and signaling cost compared to another existing IETF based approach.