An Enhanced Anti-collision Algorithm in RFID Based on Counter and Stack

Authors:
Wei-Chih Chen;Shi-Jinn Horng;Pingzhi Fan
Affiliations:
National Taiwan University of Science and Technology, Taiwan;National Taiwan University of Science and Technology, Taiwan/ National United University, China;Southwest Jiaotong University, China
Venue:
ICSNC '07 Proceedings of the Second International Conference on Systems and Networks Communications
Year:
2007

Citing 0
Cited 5

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
Optimal Dynamic Framed Slotted ALOHA Based Anti-collision Algorithm for RFID Systems

Wireless Personal Communications: An International Journal
Optimal scheduling-based RFID reader-to-reader collision avoidance method using artificial immune system

Applied Soft Computing
A power control technique for anti-collision schemes in RFID systems

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Radio Frequency Identification has been developed for many years and it got much attention from researchers recently as there are lots of applications being used practically in the real world. Owing to the shared wireless channel between tags and reader during communication, the tag collision arbitration is a significant issue for reducing the communication overhead. This paper presents a novel anti-collision algorithm named as EAA (Enhanced Anti-collision Algorithm) which is based on ABS (Adaptive Binary Splitting) algorithm proposed by Myung et al. [5], [6]. We improve the ABS algorithm, and inherit the advantages of the ABS algorithm. EAA uses counter, stack, and Manchester code [2], [3], [9] to reduce the probability of collision efficiently. Compared to the methods proposed by other researchers [1], [5] the performance evaluation shows that the proposed scheme in this paper uses fewer timeslots for indentifying tags.