Tag anti-collision algorithms in RFID systems: a new trend

  • Authors:
  • Majid Alotaibi;Adam Postula;Marius Portmann

  • Affiliations:
  • Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD, Australia;Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD, Australia;Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD, Australia

  • Venue:
  • WSEAS TRANSACTIONS on COMMUNICATIONS
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

RFID is a wireless communication technology that provides automatic identification or tracking and data collection from any tagged object. Due to the shared communication channel between the reader and the tags during the identification process in RFID systems, many tags may communicate with the reader at the same time, which causes collisions. The problem of tag collision has to be addressed to have fast multiple tag identification process. There are two main approaches to the tag collision problem: ALOHA based algorithms and tree based algorithms. Although these methods reduce the collision and solve the problem to some extent, they are not fast and efficient enough in real applications. A new trend emerged recently which takes the advantages of both ALOHA and tree based approaches. This paper describes the process and performance of the tag anti-collision algorithms of the tree-ALOHA trend.