• Title/Summary/Keyword: pathID

Search Result 46, Processing Time 0.026 seconds

Development of a System Security Unit using RFID (RFID를 이용한 시스템 보안 장치 개발)

  • Jang, Jae-Hyuk;Sim, Gab-Sig
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.11-18
    • /
    • 2011
  • This study developed a digital security device which power is on/off by the RFID card. This device is based on the wireless data transmit/receive circuits, built in RS-232C chip and applied to computer and other digital devices. We can check whether this device is operated or not by connecting the LED. In this system, 13.56MHz frequency circuit supplies power with ID card, and DC inputs check the proximity operating distance of the card field for verifying the existence of a card. The security level of this system is much stronger than that of a compared system[13]. Anyone cannot use the system without RFID card. All illegal access is prevented except for authorized path.

Embedded System Implementation of Tree Routing Structure for Ubiquitous Sensor Network (유비쿼터스 센서 네트워크를 위한 트리 라우팅 구조의 임베디드 시스템 구현)

  • Park, Hyoung-Keun;Lee, Cheul-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.10
    • /
    • pp.4531-4535
    • /
    • 2011
  • In this paper, USN(Ubiquitous Sensor Network) is used in the structure of the tree routing was implemented in embedded systems. Tree Routing in the USN to the sink node to transmit sensor data is one of the techniques. When routing, sensor data is transmitted based on pre-defined ID according hop number. In order to have optimal routing path, the current state of the wireless sector and the sensor node informations were used. Also, received sensor data and the results of the tree routing by implementing an embedded system. This embedded system can be applied to a portable sensor information collecting system.

A Tree-Based Indexing Method for Mobile Data Broadcasting (모바일 데이터 브로드캐스팅을 위한 트리 기반의 인덱싱 방법)

  • Park, Mee-Hwa;Lee, Yong-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.141-150
    • /
    • 2008
  • In this mobile computing environment, data broadcasting is widely used to resolve the problem of limited power and bandwidth of mobile equipments. Most previous broadcast indexing methods concentrate on flat data. However. with the growing popularity of XML, an increasing amount of information is being stored and exchanged in the XML format. We propose a novel indexing method. called TOP tree(Tree Ordering based Path summary tree), for indexing XML document on mobile broadcast environments. TOP tree is a path summary tree which provides a concise structure summary at group level using global IDs and element information at local level using local IDs. Based on the TOP tree representation, we suggest a broadcast stream generation and query Processing method that efficiently handles not only simple Path queries but also multiple path queries. We have compared our indexing method with other indexing methods. Evaluation results show that our approaches can effectively improve the access time and tune-in time in a wireless broadcasting environment.

  • PDF

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.

DDoS Attack Path Retracing Using Router IP Address (라우터 IP주소를 이용한 DDoS 공격경로 역추적)

  • 원승영;구경옥;오창석
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.05a
    • /
    • pp.223-226
    • /
    • 2003
  • The best way in order to protect the system resource front Distributed Denial of Service(DDoS) attack is cut off the source of DDoS attack with path retracing the packet which transferred by attacker. Packet marking method can not use ICMP cause by using IP identifier field as marking field. And in case of increasing the number of router, retracing method using router ID has the size of marking field's increasing problem. In this paper, we propose that retracing method can be available the ICMP using marking field for option field in IP header and the size of making Held do not change even though the number of router is increased using the mark information which value obtained through XOR operation on IP address.

  • PDF

Accuracy Improvement of the Transport Index in AFC Data of the Seoul Metropolitan Subway Network (AFC기반 수도권 지하철 네트워크 통행지표 정확도 향상 방안)

  • Lee, Mee-Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.41 no.3
    • /
    • pp.247-255
    • /
    • 2021
  • Individual passenger transfer information is not included in Seoul metropolitan subway Automatic Fare Collection (AFC) data. Currently, basic data such as travel time and distance are allocated based on the TagIn terminal ID data records of AFC data. As such, knowledge of the actual path taken by passengers is constrained by the fact that transfers are not applied, resulting in overestimation of the transport index. This research proposes a method by which a transit path that connects the TagIn and TagOut terminal IDs in AFC data is determined and applied to the transit index. The method embodies the concept that a passenger's line of travel also accounts for transfers, and can be applied to the transit index. The path selection model for the passenger calculates the line of transit based on travel time minimization, with in-vehicle time, transfer walking time, and vehicle intervals all incorporated into the travel time. Since the proposed method can take into account estimated passenger movement trajectories, transport-related data of each subway organization included in the trajectories can be accurately explained. The research results in a calculation of 1.47 times the values recorded, and this can be evaluated directly in its ability to better represent the transportation policy index.

Study on WP-IBE compliant Mobile IPSec (WP-IBE 적용 Mobile IPSec 연구)

  • Choi, Cheong Hyeon
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.11-26
    • /
    • 2013
  • In the wireless Internet, it is so restrictive to use the IPSec. The MIPv4 IPSec's path cannot include wireless links. That is, the IPSec of the wireless Internet cannot protect an entire path of Host-to-Host connection. Also wireless circumstance keeps a path static during the shorter time, nevertheless, the IKE for IPSec SA agreement requires relatively long delay. The certificate management of IPSec PKI security needs too much burden. This means that IPSec of the wireless Internet is so disadvantageous. Our paper is to construct the Mobile IPSec proper to the wireless Internet which provides the host-to-host transport mode service to protect even wireless links as applying excellent WP-IBE scheme. For this, Mobile IPSec requires a dynamic routing over a path with wireless links. FA Forwarding is a routing method for FA to extend the path to a newly formed wireless link. The FA IPSec SA for FA Forwarding is updated to comply the dynamically extended path using Source Routing based Bind Update. To improve the performance of IPSec, we apply efficient and strong future Identity based Weil Pairing Bilinear Elliptic Curve Cryptography called as WP-IBE scheme. Our paper proposes the modified protocols to apply 6 security-related algorithms of WP-IBE into the Mobile IPSec. Particularly we focus on the protocols to be applied to construct ESP Datagram.

A Study on Course Correction Performance Expectation & Algorithm Implementation of 1D CCM (1D CCM 탄도수정 성능예측 및 알고리즘 구현 연구)

  • Kim, Ki-Pyo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.5-13
    • /
    • 2007
  • The trajectory of an current artillery munition is subject to a variety of different error sources resulting in more or less big deviation from the nominal predicted flight path. The 1D CCM(Course Correction Munition) has appeared to solve this problem and the mechanism of 1D CCM is a simple and low cost one using the influence of drag to range behavior of an artillery munition. In the paper 1D CCM concept has been simulated using wind tunnel experiment results of the specified Korean munition with CCF(Course Correction Fuze) and calculated the performance of its rang error reduction. From the simulated results it can be numerically explained that the possibility of adaptation of 1D CCM concept to Korean artillery munitions.

A Strength Analysis of Welded Plates Using the J-integral (J-적분을 이용한 용접부 강도 해석)

  • 이민호;양영수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.326-329
    • /
    • 2000
  • Study of Weldment fracture behavior mcludes thermal analysis, residual stress analysis, and fracture analysis The 1-integral loses its path-independency in a res~dual stress field Therefore, it id necessary to develop a program to calculate the J-integral in a welded plate. m this study, theoretical formulation and program were developed for the evaluation of the 1-integral at the crack tip o i weldments. To verify equations and program, welded thin plate and thick plate were used to calculate residual stress and the J-integral.

  • PDF

Design of an Arm Section for a Direct Drive SCARA Robot having the Minimum Cycle Time (직접구동방식 수평다관절형 로봇의 최소 싸이클시간을 갖는 로봇팔의 단면설계)

  • Kang, B.S.;Park, K.H.;Kwak, Y.K.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.12
    • /
    • pp.165-172
    • /
    • 1995
  • Many algorithms to enhance a speed performance of a robot have been studied, but it's rare to consider disign aspect of a robot arm for time optimal problem. In this paper, section demensions of a robot arm and a velocity profile of an end-effector were optimally designed to minimize the cycle time. Capacity of actuators, deflections of end-effector, and a fundamental natural frequency of the robot arm were constrained in optimal design. For a given path with a trapezoidal velocity profile, torques of each joint were calculated using the inverse kinematics and dynamics. For the SCARA type robot which is mainly used for assembly tasks, the time optimal design of each robot arm id presented with the above constraints.

  • PDF