• DocumentCode
    2762035
  • Title

    A Rapid Tag Identification Method with Two Slots in RFID Systems

  • Author

    Kim, Yong Hwan ; Kim, Sung Soo ; Ahn, Kwang Seon

  • Author_Institution
    Dept. of Comput. Eng., Kyungpook Nat. Univ., Daegu, South Korea
  • fYear
    2009
  • fDate
    9-11 July 2009
  • Firstpage
    292
  • Lastpage
    295
  • Abstract
    RFID is core technology in the area of ubiquitous computing. Identify the objects begin with the reader´s query to the tag attached to the subject. When multiple tags exist in the reader´s interrogation zone, these tags simultaneously respond to the reader´s query, resulting in collision. In RFID system, the reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. This paper proposes tree based Rapid Tag Identification Method with Two Slots(RTIMTS). The proposed algorithm rapidly identifies a tag with the information of Two Slots and MSB(Most Significant Bit). Two Slots resolve the tag collision by receiving the response from the tag to the Slot 0 and 1. The reader can identify two tags at once using MSB of information added to the tag ID. With RTIMTS algorithm, the total time of tag identification can be shortened by decreasing the number of query-responses from the reader.
  • Keywords
    radiofrequency identification; telecommunication congestion control; ubiquitous computing; anti-collision algorithm; radiofrequency identification; rapid tag identification method; reader interrogation zone; ubiquitous computing; Algorithm design and analysis; Application software; Computer applications; Computer networks; Design methodology; Intrusion detection; Manufacturing industries; Pervasive computing; Radiofrequency identification; Ubiquitous computing; Anti-collision; RFID; Two Slots; the number of query-responses;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Computing and Applications, 2009. NCA 2009. Eighth IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    978-0-7695-3698-9
  • Electronic_ISBN
    978-0-7695-3698-9
  • Type

    conf

  • DOI
    10.1109/NCA.2009.21
  • Filename
    5190388