• Title, Summary, Keyword: Tag Proximity

Search Result 10, Processing Time 0.044 seconds

The Proximity Scheme of the Perceptual Space for Indexing The Trajectories of Tags (태그 궤적 색인을 위한 인식공간 근접성 기법)

  • Kim, Dong-Hyun;Ahn, Swng-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2140-2146
    • /
    • 2009
  • Since tags do not have location informations, the identifiers of tags which are symbolic data are used as the location informations. Therefore, it is difficult to define the proxmity between two trajectories of tags and inefficient to process the user queries for tags. In this paper, we define the perceptual space to model the location of a tag and propose the proximity of the perceptual spaces. The proximity of the perceptual spaces is composed of the static proximity and dynamic proximity. Using the proximity of the perceptual spaces, it is possible to measure the proximity between two trajectories of tags and build the efficient indexes for tag trajectories. We evaluated the performance of the proposed proximity function for tag trajectories on the IR-tree and the $R^*$-tree.

A Tag Proximity Information Acquisition Scheme for RFID Yoking Proof (RFID 요킹증명을 위한 인접태그 정보 획득 기법)

  • Ham, Hyoungmin
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.9
    • /
    • pp.476-484
    • /
    • 2019
  • RFID yoking proof proves that a pair of tags is scanned at the same time. Since the tags scanned simultaneously by a single reader are adjacent to each other, the yoking proof is used in applications that need to check the physical proximity of tagged objects. Most of the yoking proof schemes require pre-knowledge on adjacent tags. If an error occurs in the process of collecting information about adjacent tags, all subsequent proofs will fail verification. However, there is no research that suggests specific methods for obtaining information about adjacent tags. In this study, I propose a tag proximity information acquisition scheme for a yoking proof. The proposed method consists of two steps: scanning area determination and scanning area verification. In the first step, the size and position of the area to scan tags is determined in consideration of position and transmission range of the tags. In the next step, whether tag scanning is performed within the scanning area or not is verified through reference tags of the fixed position. In analysis, I show that the determined scanning area assures acquisition of adjacent tag information and the scanning area verification detects deformation and deviation of the scanning area.

Reordering Scheme of Location Identifiers for Indexing RFID Tags (RFID 태그의 색인을 위한 위치 식별자 재순서 기법)

  • Ahn, Sung-Woo;Hong, Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.36 no.3
    • /
    • pp.198-214
    • /
    • 2009
  • Trajectories of RFID tags can be modeled as a line, denoted by tag interval, captured by an RFID reader and indexed in a three-dimensional domain, with the axes being the tag identifier (TID), the location identifier (LID), and the time (TIME). Distribution of tag intervals in the domain space is an important factor for efficient processing of a query for tracing tags and is changed according to arranging coordinates of each domain. Particularly, the arrangement of LIDs in the domain has an effect on the performance of queries retrieving the traces of tags as times goes by because it provides the location information of tags. Therefore, it is necessary to determine the optimal ordering of LIDs in order to perform queries efficiently for retrieving tag intervals from the index. To do this, we propose LID proximity for reordering previously assigned LIDs to new LIDs and define the LID proximity function for storing tag intervals accessed together closely in index nodes when a query is processed. To determine the sequence of LIDs in the domain, we also propose a reordering scheme of LIDs based on LID proximity. Our experiments show that the proposed reordering scheme considerably improves the performance of Queries for tracing tag locations comparing with the previous method of assigning LIDs.

RFID Tag Antenna Coupled by Shorted Microstrip Line for Metallic Surfaces

  • Choi, Won-Kyu;Kim, Jeong-Seok;Bae, Ji-Hoon;Choi, Gil-Young;Pyo, Cheol-Sig;Chae, Jong-Suk
    • ETRI Journal
    • /
    • v.30 no.4
    • /
    • pp.597-599
    • /
    • 2008
  • This letter presents the design of a small and low-profile RFID tag antenna in the UHF band that can be mounted on metallic objects. The designed tag antenna, which uses a ceramic material as a substrate, consists of a radiating patch and a microstrip line with two shorting pins for a proximity-coupled feeding structure. Using this structure, impedance matching can be simply obtained between the antenna and tag chip without a matching network. The fractional impedance bandwidth for $S_{11}$ <3 dB and radiation efficiency are about 1.4% and 56% at 911 MHz, respectively. The read range is approximately from 5 m to 6 m when the tag antenna is mounted on a metallic surface.

  • PDF

Implementation of the Passenger Positioning Systems using Beacon (Beacon을 활용한 선박 탑승자 위치확인 시스템의 구현)

  • Jeong, Seon-Jae;Yim, Jae-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.153-160
    • /
    • 2016
  • In this paper, we propose a system that tracks the position of the passengers and sailors using a Bluetooth-based Beacon in the ship. The position of the tracking passengers, sometimes fatal emergencies of the rescue team, such as the sinking of the ship is utilized in order to efficiently and quickly rescue the passengers, and the collected data can be utilized additionally by grasping the flow of human traffic patterns. The system proposed in this paper, install MAC data acquisition called AP (Access Point) for each cabin, and in the installed AP retrieves Tag of the information provided to the passenger and collected. A Tag has only its own MAC Address to the privacy, no user information is not collected. All data communication by sending and receiving MAC Address was only to ensure anonymity.

Study on NFC Security Analysis and UICC Alternative Effect (NFC 보안 기술 분석 및 UICC 적용 효과 연구)

  • Lim, Sun-Hee;Jeon, Jae-Woo;Jung, Im-Jin;Yi, Ok-Yeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.29-36
    • /
    • 2011
  • Near Field Communication is an emerging short-range wireless connectivity technology that offers proximity and different operating modes. Particularly, NFC technology has the potential to revolutionize mobile applications like payment and ticketing because NFC is more complex and mutual connectivity than RFID as the simple tag reader. Finally, NFC security technology defines the robust security protocols. This paper will specify and analyze the NFC security technology, and study the chance and its beneficial effect of the UICC card as the NFC Secure Element.

Design of Efficient 8bit CMOS AD Converter for SOC Application (SOC 응용을 위한 효율적인 8비트 CMOS AD 변환기 설계)

  • Kwon, Seung-Tag
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.12
    • /
    • pp.22-28
    • /
    • 2008
  • This paper designed a efficient 8-bit CMOS analog-to-digital converter(ADC) for an SOC(System On Chip) application. The architecture consists of two modified 4-bit full-flash ADCs, it has been designed using a more efficient architecture. This is to predict roughly the range in which input signal residers and can be placed in the proximity of input signal based on initial prediction. The prediction of input signal is made available by introducing a voltage estimator. For 4-bit resolution, the modified full-flash ADC need only 6 comparators. So a 8-bit ADC require only 12 comparators and 32 resistors. The speed of this ADC is almost similar to conventional full-flash ADC, but the die area consumption is much less due to reduce numbers of comparators and registors. This architecture uses even fewer comparator than half-flash ADC. The circuits which are implemented in this paper is simulated with LT SPICE tool of computer.

Single Nucleotide Polymorphism Marker Discovery from Transcriptome Sequencing for Marker-assisted Backcrossing in Capsicum

  • Kang, Jin-Ho;Yang, Hee-Bum;Jeong, Hyeon-Seok;Choe, Phillip;Kwon, Jin-Kyung;Kang, Byoung-Cheorl
    • Horticultural Science & Technology
    • /
    • v.32 no.4
    • /
    • pp.535-543
    • /
    • 2014
  • Backcross breeding is the method most commonly used to introgress new traits into elite lines. Conventional backcross breeding requires at least 4-5 generations to recover the genomic background of the recurrent parent. Marker-assisted backcrossing (MABC) represents a new breeding approach that can substantially reduce breeding time and cost. For successful MABC, highly polymorphic markers with known positions in each chromosome are essential. Single nucleotide polymorphism (SNP) markers have many advantages over other marker systems for MABC due to their high abundance and amenability to genotyping automation. To facilitate MABC in hot pepper (Capsicum annuum), we utilized expressed sequence tags (ESTs) to develop SNP markers in this study. For SNP identification, we used Bukang $F_1$-hybrid pepper ESTs to prepare a reference sequence through de novo assembly. We performed large-scale transcriptome sequencing of eight accessions using the Illumina Genome Analyzer (IGA) IIx platform by Solexa, which generated small sequence fragments of about 90-100 bp. By aligning each contig to the reference sequence, 58,151 SNPs were identified. After filtering for polymorphism, segregation ratio, and lack of proximity to other SNPS or exon/intron boundaries, a total of 1,910 putative SNPs were chosen and positioned to a pepper linkage map. We further selected 412 SNPs evenly distributed on each chromosome and primers were designed for high throughput SNP assays and tested using a genetic diversity panel of 27 Capsicum accessions. The SNP markers clearly distinguished each accession. These results suggest that the SNP marker set developed in this study will be valuable for MABC, genetic mapping, and comparative genome analysis.

A Light-Weight RFID Distance Bounding Protocol (경량 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Bu, Ki-Dong;Yoon, Eun-Jun;Nam, In-Gil
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.307-314
    • /
    • 2010
  • Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.