An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration

Authors:
J. Myung;Wonjun Lee;T. K. Shih
Affiliations:
Dept. of Comput. Sci. & Eng., Korea Univ., Seoul;-;-
Venue:
IEEE Transactions on Multimedia
Year:
2006

Citing 0
Cited 10

A framework for fast RFID tag reading in static and mobile environments

Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple performance analysis of RFID networks with binary tree collision arbitration

International Journal of Sensor Networks
Two blocking algorithms on adaptive binary splitting: single and pair resolutions for RFID tag identification

IEEE/ACM Transactions on Networking (TON)
A blocking RFID anti-collision protocol for quick tag identification

WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
Using generalized query tree to cope with the capture effect in RFID singulation

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
An efficient RFID solution to expedite services

Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
On Object Identification Reliability Using RFID

Mobile Networks and Applications
A fast RFID tag identification algorithm based on counter and stack

Expert Systems with Applications: An International Journal
What Drives a Successful Technology Implementation?: Exploring Drivers and Challenges of RFID Systems Implementation in a Public Sector Organisation

International Journal of Electronic Government Research
An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. This paper presents an adaptive memoryless protocol, which is an improvement on the query tree protocol. Memoryless means that tags need not have additional memory except ID for identification. To reduce collisions and identify tags promptly, we use information obtained from the last process of tag identification at a reader. Our performance evaluation shows that the adaptive memoryless protocol causes fewer collisions and takes shorter delay for recognizing all tags while preserving lower communication overhead than other tree based tag anticollision protocols