• Title/Summary/Keyword: multiple tags

Search Result 119, Processing Time 0.033 seconds

An Anti Collision Algorithm Using Efficient Separation in RFID system (RFID 시스템에서 효율적인 분리를 이용한 충돌 방지 알고리즘)

  • Kim, Sung-Soo;Yun, Tae-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.87-97
    • /
    • 2013
  • In the RFID system, multiple tags respond in the process of identifying multiple tags in the reader's interrogation zone, resulting in collisions. Tag collision occurs when two or more tags respond to one reader, so that the reader cannot identify any tags. These collisions make it hard for the reader to identify all tags within the interrogation zone and delays the identifying time. In some cases, the reader cannot identify any tags. The reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. The proposed algorithm efficiently divides tag groups through an efficient separation to respond, preventing collisions. Moreover, the proposed algorithm identifies tags without checking all the bits in the tags. The prediction with efficient separation reduces the number of the requests from the reader.

Fair Identification Scheme for STAC Protocol in 13.56MHz RFID Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.260-265
    • /
    • 2011
  • In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

Improvement and Performance Analysis of Hybrid Anti-Collision Algorithm for Object Identification of Multi-Tags in RFID Systems (RFID 시스템에서 다중 태그 인식을 위한 하이브리드 충돌방지 알고리즘의 개선 및 성능 분석)

  • Choi, Tae-Jeong;Seo, Jae-Joon;Baek, Jang-Hyun
    • IE interfaces
    • /
    • v.22 no.3
    • /
    • pp.278-286
    • /
    • 2009
  • The anti-collision algorithms to identify a number of tags in real-time in RFID systems are divided into the anti-collision algorithms based on the Framed slotted ALOHA that randomly select multiple slots to identify the tags, and the anti-collision algorithms based on the Tree-based algorithm that repeat the questions and answer process to identify the tags. In the hybrid algorithm which is combined the advantages of these algorithms, tags are distributed over the frames by selecting one frame among them and then identified by using the Query tree frame by frame. In this hybrid algorithm, however, the time of identifying all tags may increase if many tags are concentrated in a few frames. In this study, to improve the performance of the hybrid algorithm, we suggest an improved algorithm that the tags select a specific group of frames based on the earlier bits of the tag ID so that the tags are distribute equally over the frames. By using the simulation and mathematical analysis, we show that the suggested algorithm outperforms traditional hybrid algorithm from the viewpoint of the number of queries per frame and the time of identifying all tags.

Estimation for the Number of Tags in the Slotted-ALOHA based RFID Systems

  • Quan, Chang-Hao;Mo, Hee-Sook;Choi, Gil-Young
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.203-206
    • /
    • 2005
  • Recently, the RFID(Radio Frequency Identification) technology has gained significant attention. One of the performance issues in RFID systems is to resolve the tag collision among responses from RFID tags. In this paper, we proposed a new scheme for estimation of the number of tags in the reader filed. The scheme is used by anti-collision algorithm to identify multiple tags efficiently. And we also present the simulation result that shows the proposed scheme to estimate tags efficiently and also to improve the systems efficiency.

  • PDF

A Scheme for Estimating Number of Tags in FSA-based RFID Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.164-169
    • /
    • 2009
  • An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA (Framed Slot ALOHA) algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

A Analysis on system performance by initial number of Tag in RFID Systems (RFID 시스템에서 초기 태그 수가 시스템 성능에 미치는 영향 분석)

  • Yang, Seong-Ryong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.17-20
    • /
    • 2012
  • In the RFID system, A collision occurs when the multiple tags transmit at the concurrent in slot. Reduce conflicts, in order to maximize the efficiency of the system, the number of tags with the same number of slots are allocated. the number of slots to the next frame determined by the number of contention tags. In this paper, it estimate the number of tags based on the DFSA. Analyzed the performance of the system by the initial set number of tags through simulation.

  • PDF

A Study on the Application of Spatial-Knowledge-Tags using Human Motion in Intelligent Space

  • Jin, Tae-Seok;Morioka, Kazuyuki;Niitsuma, Mihoko;Sasaki, Takeshi;Hashimoto, Hideki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.31-36
    • /
    • 2005
  • Intelligent Space (iSpace) is the space where many intelligent devices, such as computers and sensors, are distributed. According to the cooperation of many intelligent devices, the environment comes to have intelligence. In iSpace, the locations of multiple humans and other objects are obtained and tracked by using multiple camera and color-based method. In addition, we describe a context-aware information system which is based on Spatial-Knowledge-Tags (SKT). SKT system enables humans to access information and data by using spatial location of human and stored information in storage. The proposed tracking method is applied to the intelligent environment and its performance is verified by the experiments.

  • PDF

Adaptive RFID anti-collision scheme using collision information and m-bit identification (충돌 정보와 m-bit인식을 이용한 적응형 RFID 충돌 방지 기법)

  • Lee, Je-Yul;Shin, Jongmin;Yang, Dongmin
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.1-10
    • /
    • 2013
  • RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

MRCT: An Efficient Tag Identification Protocol in RFID Systems with Capture Effect

  • Choi, Sunwoong;Choi, Jaehyuk;Yoo, Joon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1624-1637
    • /
    • 2013
  • In RFID systems, one important issue is how to effectively address tag collision, which occurs when multiple tags reply simultaneously to a reader, so that all the tags are correctly identified. However, most existing anti-collision protocols assume isotropic collisions where a reader cannot detect any of the tags from the collided signals. In practice, this assumption turns out to be too pessimistic since the capture effect may take place, in which the reader considers the strongest signal as a successful transmission and the others as interference. In this case, the reader disregards the other collided tags, and in turn, fails to read the tag(s) with weaker signal(s). In this paper, we propose a capture effect-aware anti-collision protocol, called Multi-Round Collision Tree (MRCT) protocol, which efficiently identifies the tags in real RFID environments. MRCT deals with the capture effect as well as channel error by employing a multi-round based identification algorithm. We also analyze the performance of MRCT in terms of the number of slots required for identifying all tags. The simulation results show that MRCT significantly outperforms the existing protocol especially in a practical environment where the capture effect occurs.

An Efficient Tag Identification Scheme based on the Reader's Power Control

  • Lim, Intaek
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.9 no.1
    • /
    • pp.39-46
    • /
    • 2019
  • This paper proposes an efficient tag identification scheme for ISO/IEC18000-7 standard by dividing the tags into smaller groups. Tag grouping is based on the reader's transmission power. This can reduce the responding tags in the collection round. If the small number of tags exists, we can anticipate the collision probability will decrease. And it makes the identification speed high. A collection round initiated by the reader's collection command. It also proceeds with increasing the power of the reader until all tags are identified. The results showed that 25% of the performance improved.