skip to main content
10.1145/1516241.1516344acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

An anti-collision algorithm without idle cycle using 4-ary tree in RFID system

Published: 15 February 2009 Publication History

Abstract

This paper proposes an anti-collision algorithm needed in the process of recognizing data of the tags when one reader and multiple passive tags simultaneously have data communications in RFID system. QTA And 4-ary QTA which are based on the Tree algorithm, have the problem that the numbers of query - response are many and the idle cycle (requesting about non-existent tag) exists in the process of recognizing the tags. Advanced 4-ary Query Tree Algorithm(A4QTA) has a 4-ary tree structure and when tag responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to detect the collision point. Also, this algorithm reduces the number of query-response compared to QTA and 4-ary QTA by devising a method for one bit collision and series two bit?s collision in these bits as well as improves the performance by removing the idle cycle.

References

[1]
K. Finkenzeller, RFID Hand Book: Fundamentals and Applications in Contactless Smart Card and Identification, Second Edition, John Wiley & Sons Ltd, 2003
[2]
P. H. Cole, "Fundamentals in RFID part1," Korean RFID course, 2006, Available at:http://autoidlab.eleceng.adelaide.edu.au/education/FundamentalsInRfidPart1.pdf.
[3]
S. Sarma, D. Brock, and D. Engels, "Radio Frequency Identification and the Electronic Product Code," IEEE Micro, vol. 21, no. 6, pp. 50--54, November 2001.
[4]
D. W. Engels and S. E. Sarma, "The Reader Collision Problem," In Proceedings of IEEE International Conference on System, Man and Cybernetics, Hammamet, Tunisie, October 2002.
[5]
J. Myung, and W. Lee, "Adaptive Binary Splitting: A RFID Tag Collision Arbitration Protocol for Tag Identification," ACM/Springer Mobile networks and Applications (ACM MoNET), vol. 11, no.5, pp. 711--722, October 2006.
[6]
C. Law, K. Lee, and K. Y. Siu, "Efficient Memoryless protocol for Tag Identification", In Proceedings of the 4th international workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'00), ACM, pp. 75--84, 2000.
[7]
P. Mathys and P. Flajolet, "Q-ary collision resolution algorithms in random-access systems with free or blocked channel access," in IEEE Trans. Inform. Theory, pp. 21 7--243, 1985.

Index Terms

  1. An anti-collision algorithm without idle cycle using 4-ary tree in RFID system

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
      February 2009
      704 pages
      ISBN:9781605584058
      DOI:10.1145/1516241
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 15 February 2009

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. 4-ary query tree
      2. RFID
      3. anti-collision
      4. idle-cycle
      5. the number of query-responses

      Qualifiers

      • Research-article

      Conference

      ICUIMC '09
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 251 of 941 submissions, 27%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 185
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 13 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media