Optimal solution for data collision avoidance in radio frequency identification networks

Ngoc Tu Nguyen, Ming C. Leu, Sherali Zeadally, Bing Hong Liu, Shao I. Chu

Research output: Contribution to journalLetterpeer-review

13 Scopus citations


When data collisions happen in radio frequency identification (RFID) networks, inaccurate tag's information or the communication between the RFID reader and the RFID tag occur. Although recent technological advances have improved the inquiry capacity performance of RFID readers, the performance of RFID networks can still be affected by collisions. We propose a novel solution that helps select RFID readers which have the appropriate interrogation range to enable the highest number of tags to be read without collisions (often referred to as the reader-tag-data collision avoidance [RTDCA] problem). To solve the RTDCA problem, we introduce a relative collision graph to transform the original problem into one that involves finding the maximum weight independent set. We then formulate the RTDCA problem using a mathematical model. To solve the RTDCA problem by using a linear programming model requires an exponential number of variables which cannot be solved in polynomial time. Our proposed solution makes use of dynamic programming with path decomposition to determine the optimal number of RFID tags that can be read without data collisions.

Original languageEnglish
Article numbere49
JournalInternet Technology Letters
Issue number3
StatePublished - May 1 2018

Bibliographical note

Publisher Copyright:
Copyright © 2018 John Wiley & Sons, Ltd.


  • collision avoidance
  • mathematical programming
  • maximum number of read tags
  • optimal solution
  • radio frequency identification

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Information Systems
  • Computer Networks and Communications


Dive into the research topics of 'Optimal solution for data collision avoidance in radio frequency identification networks'. Together they form a unique fingerprint.

Cite this