Interference cancellation-based RFID tags identification

  • Authors:
  • Raju Kumar;Thomas F. La Porta;Gaia Maselli;Chiara Petrioli

  • Affiliations:
  • Computer Science and Engineering, Pennsylvania State University, University Park, USA;Computer Science and Engineering, Pennsylvania State University, University Park, USA;Computer Science Department, University of Rome , Roma, Italy;Computer Science Department, University of Rome , Roma, Italy

  • Venue:
  • Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we investigate interference cancellation to faster identify tags in RFID networks. We explore how interference cancellation can be applied to ALOHA and tree-based identification schemes, its limitations, the extent of achievable improvements, and the overhead incurred to obtain effective gains. Analytical and simulation results show that for an ALOHA-based scheme interference cancellation allows us to identify nearly 23% of tags without directly interrogating them. This speeds up tag identification (over 20% faster) while producing little overhead. For a tree-based scheme nearly 50% of the tags are identified by exploiting interference cancellation, resulting in an improvement of the identification rate of over 20%. Finally, we propose an enhancement of the tree-based scheme with interference cancellation that achieves a further identification speed up of 50%.