Welcome to the InfoSci Platform
Reference Hub2
RFID Tag Collision Problem in Supply Chain Management

RFID Tag Collision Problem in Supply Chain Management

Kamalendu Pal
Copyright: © 2019 |Volume: 11 |Issue: 3 |Pages: 12
ISSN: 1937-965X|EISSN: 1937-9668|EISBN13: 9781522564966|DOI: 10.4018/IJAPUC.2019070101
Cite Article Cite Article

MLA

Pal, Kamalendu. "RFID Tag Collision Problem in Supply Chain Management." IJAPUC vol.11, no.3 2019: pp.1-12. http://doi.org/10.4018/IJAPUC.2019070101

APA

Pal, K. (2019). RFID Tag Collision Problem in Supply Chain Management. International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC), 11(3), 1-12. http://doi.org/10.4018/IJAPUC.2019070101

Chicago

Pal, Kamalendu. "RFID Tag Collision Problem in Supply Chain Management," International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC) 11, no.3: 1-12. http://doi.org/10.4018/IJAPUC.2019070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The use of Radio Frequency Identification (RFID) technology has attracted a huge attention from the supply chain business community. This is due to the use of RFID technology wide range of applications in the fields of logistics and supply chain management. This paper presents a brief overview of a simple industrial RFID system and then describe the basic concept of tag collision problem. Despite many useful applications, the RFID tag collision creates a major problem for fast tag identification process. There are different algorithmic solutions available to overcome tag collision problem in industrial supply chains. Based on binary search algorithm (BSA) of dynamic and backtracking, two variations of binary anti-collision search algorithms for tag identification processes are described in this paper. Simulation-based experimental results on the performance of these algorithms are evaluated when handling multiple RFID tags simultaneously. The backtracking binary search algorithm has obvious advantages in terms of tag identification process compared to the other two algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.