• Title/Summary/Keyword: pathID

Search Result 46, Processing Time 0.024 seconds

Optimal Path Finding Considering Smart Card Terminal ID Chain OD - Focused on Seoul Metropolitan Railway Network - (교통카드 단말기ID Chain OD를 반영한 최적경로탐색 - 수도권 철도 네트워크를 중심으로 -)

  • Lee, Mee Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.40-53
    • /
    • 2018
  • In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.

A Study of Spreading code for Watermarking of TxID of ATSC-DTV (ATSC-DTV의 송신기 식별을 위한 워터마킹용 확산코드에 관한 연구)

  • Cha Jae-Sang;Choi Seong-Jin;Lee Seon-Hee;Lee Kwang-Jik;Lee Yong-Tae;Park Goo-Man
    • Journal of Broadcast Engineering
    • /
    • v.11 no.1 s.30
    • /
    • pp.100-106
    • /
    • 2006
  • In this paper, we proposed a TxID(Transmitter Identification) system using ZCD (Zero Correlation Duration) code as interference-cancelled spread codes for single frequency network of ATSC terrestrial DTV broadcasting. ZCD codes are simply implemented and have ZCD characteristics. Then, Proposal system can fundamentally solve interference problems caused by ICI(Inter Code Interference) and MPI(Multi-Path Interference) which happens in TxID system using spread coding method. Also, those can cancel truncated error which happens at watermarking for TxID since those can remove its period. In this paper, we identified the availability of TxID system applying interference-cancelled ZCD codes by analyzing DER (Detection Error Rate) which is simulated in various interference environments such as AWGN, ICI, and MPI.

A Privacy Protection REID System using Random basis ID Allocating (난수 기반의 ID 할당을 이용한 프라이버시 보호 RFID 시스템)

  • Park, Jin-Sung;Choi, Myung-Ryul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.6
    • /
    • pp.1155-1159
    • /
    • 2006
  • In this paper, we have proposed a privacy protection RFID system using random number based ID allocation. Currently, there are rising issues about privacy violation in RFID system. This issues caused by tracking the ID of tag which present unique identity of tag. The proposed system dynamically allocates random basis ID to tag, then the tag can not be traced. The random ID allocation procedures of this system can be operate in cryptographic mode or normal(non-cryptographic) mode. This system can be applied to privacy protected customer tracking RFID system in mesa-outlet stores which tracing customer's moving path.

  • PDF

A Point-to-Multipoint Routing Path Selection Algorithm for Dynamic Routing Based ATM Network (동적 라우팅기반의 점대다중점 라우팅 경로 선택)

  • 신현순;이상호;이경호;박권철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8A
    • /
    • pp.581-590
    • /
    • 2003
  • This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

Energy Efficient Cross Layer Multipath Routing for Image Delivery in Wireless Sensor Networks

  • Rao, Santhosha;Shama, Kumara;Rao, Pavan Kumar
    • Journal of Information Processing Systems
    • /
    • v.14 no.6
    • /
    • pp.1347-1360
    • /
    • 2018
  • Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.

A Study of applying Method of Unipolar-ZCD Spreading Code for LED-ID in Interference Environment (LED-ID용 간섭채널환경하에서의 단극형 ZCD확산코드 적용 기법에 관한 연구)

  • Cha, Jae-Sang;Kim, Jin-Young;Jang, Yeong-Min;Kim, Jong-Tae;Lee, Kyong-Gun;Moon, Kyung-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.275-280
    • /
    • 2010
  • Recently, This paper suggests that LED-ID technique applying positioning method for LED light. also, Authors in this paper has launched this investigation earnestly. However, there are various interferences such as MPI(Multi Path Interference) by reflected waves of the surface and interfere factors by their correlation properties of the ID in LED-ID wireless channel. Therefore, in this paper, we propose a novel OOK(On-Off Keying)-CDMA(Code Division Multiple Access) system using unipolar ZCD(Zero Correlation Duration) spreading code and verify the availability of the proposed system via the evaluation performance simulation.

Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network - (역사환승페널티를 고려한 링크표지기반 최적경로탐색 - 교통카드기반 철도네트워크를 중심으로 -)

  • Lee, Mee Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.6
    • /
    • pp.941-947
    • /
    • 2018
  • Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.

Implementation of a very small 13.56[MHz] RFID Reader ensuring machine ID recognition in a noise space within 3Cm (3Cm 이내의 잡음 공간 속 기계 ID 인식을 보장하는 초소형 13.56[MHz] RFID Reader의 구현)

  • Park, Seung-Chang;Kim, Dae-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.10 s.352
    • /
    • pp.27-34
    • /
    • 2006
  • This paper has implemented a very small($1.4{\times}2.8[Cm^2]$) 13.56[MHz] RFID reader ensuring machine ID recognition correctly in a noise space of Tag-to-Reader within 3Cm. For operation of the RFID system, at first, this paper has designed the loop antenna of a reader and the fading model of back-scattering on microwave propagation following to 13.56[MHz] RFID Air Interface ISO/IEC specification. Secondly, this paper has proposed the automatically path selected RF switching circuit and the firmware operation relationship by measuring and analyzing the very small RFID RF issues. Finally, as a very small reader main body, this paper has shown the DSP board and software functions made for extraction of $1{\sim}2$ machine ID information and error prevention simultaneously with carrying of 13.56[MHz] RFID signals that the international standard specification ISO/IEC 18000-3 defined.

A Study of Spreading code for Watermarking of TxID of ATSC-DTV (ATSC-DTV의 송신기 식별을 위한 워터마킹용 확산코드에 관한 연구)

  • Cha, Jae-Sang;Choi, Sung-Jin;Lee, Seon-Hee;Lee, Kwang-Jik;Kim, Seung-Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.105-108
    • /
    • 2005
  • 본 논문에서는 지상파 디지털 방송시스템의 단일 주파수망 (SFN; Single Frequency Network) 구성을 위해 DTV (Digital Television) TxID (Transmitter Identification)용 저간섭 ZCD (Zero Correlation Duration) 확산코드를 제시하였다. ZCD 확산코드는 코드발생기의 구현이 용이함과 동시에 ZCD특성을 가짐으로 인해서, TxID에서 발생되는 인접코드 간섭 (ICI; Inter Code Interference) 및 다중경로 간섭 (MPI; Multi-Path Interference) 문제를 확산코딩기법을 이용하여 근원적으로 해결해주는 역할을 하고 있으며, 주기를 가변적으로 조절할 수 있어 TxID를 위한 워터마킹 (Watermarking)시에 발생하는 Truncated error를 제거할 수 있다. 본 논문에서는 AWGN (Additive White Gaussian Noise) 잡음 및 ICI, MPI와 같은 다양한 간섭환경을 모의실험에 반영하여 도출된 DER (Detection Error Rate)특성을 분석함으로써, TxID용 저간섭 ZCD 확산코드의 유용성을 입증하였다.

  • PDF

Implementation of Multidimensional Trace System for Specific Object by RFID (RFID를 이용한 다차원 특정 객체 추적 시스템의 구현)

  • Min, So-Yeon;Jung, Yong-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3694-3701
    • /
    • 2009
  • This paper suggests that location tracking system by RFID. It uses the location tracking and the authentication to entrance after inserts passive RFID tag into user Identification card. The readers periodically broadcast their signal, and then the readers understand where users are by analyzing them. In one of tracking systems, it is possible to detect the area where user had stayed for the longest time during moving according to signal power, to know user moved path and user next moving path. Also, it can be used in entrance authentication system in security area by using tag ID value which stored to backend server.