Efficient memoryless protocol for tag identification (extended abstract)

By Ching Law, Kayi Lee, Kai-Yeung Siu. DIALM '00, 2000

401 citations recorded by the source corpus.

This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within is read range the unique ID number of each tag. The novelty of our main protocol is that each tag is memoryless, i.e., the current response of each tag only depends on the current query of the reader but not on the past history of the reader's queries. Moreover, the only computation required for each tag is to match its ID against the binary string in the query. Theoretical resulst in both time and communication complexities are derived to demonstrate the efficiency of our protocols.

Subfields: Computer Networks and Communications, Media Technology

View Paper: https://www.semanticscholar.org/paper/4d48d15c7fe24ac949f7959224295328381d78db

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Raad Samir Raad
2. Dheeraj K. Klair
3. Kwan-Wu Chin
4. Harald Vogt

In Media Technology

1. Raad Samir Raad
2. Dheeraj K. Klair
3. Kwan-Wu Chin
4. Harald Vogt
5. Jae-Ryong Cha
6. Jae-Hyun Kim

Citations in the corpus

• A Survey and Tutorial of RFID Anti-Collision Protocols (2010, methodology): “This approach requires more queries compared to the original QT protocol [49].”
• Multiple object identification with passive RFID tags (2002, methodology): “In [5], ID prefixes determine the partitioning, while in [2], random coin flipping is used.”