The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Evaluation of RFID Tag Anti-Collision Algorithms in Supply Chain Automation
|
Author(s): Kamalendu Pal (City, University of London, UK)
Copyright: 2019
Pages: 17
Source title:
The IoT and the Next Revolutions Automating the World
Source Author(s)/Editor(s): Dinesh Goyal (Poornima Institute of Engineering & Technology, India), S. Balamurugan (QUANTS Investment Strategy & Consultancy Services, India), Sheng-Lung Peng (National Dong Hwa University, Taiwan)and Dharm Singh Jat (Namibia University of Science and Technology, Namibia)
DOI: 10.4018/978-1-5225-9246-4.ch004
Purchase
|
Abstract
Radio Frequency Identification (RFID) is a technology that uses radio frequency signals to identify tagged objects. RFID is an important technology used by the Internet of Things (IoT) applications. This technology enables communication between the main devices used in RFID system, the reader, and the tags. The tags share a common communication channel. Therefore, if more than one tag tries to send information at the same time, the reader will be incapable of differentiating these signals in the case of radio signals interference. This phenomenon is known as tag collision problem. The problem of tag collision is one of the major disadvantages for fast tagged-object identification in supply chain management. This chapter describes four different types of binary search algorithms for avoidance of tag collision, and then presents a performance measurement mechanism for RFID application system. Finally, simulation-based experimental results on the performance of these algorithms are presented.
Related Content
Nalini M..
© 2023.
22 pages.
|
Balachandar S., Chinnaiyan R..
© 2023.
19 pages.
|
V. A. Velvizhi, G. Senbagavalli, S. Malini.
© 2023.
29 pages.
|
Amuthan Nallathambi, Kannan Nova.
© 2023.
25 pages.
|
Amuthan Nallathambi, Sivakumar N., Velrajkumar P..
© 2023.
17 pages.
|
Nayana Hegde, Sunilkumar S. Manvi.
© 2023.
18 pages.
|
Udayakumar K., Ramamoorthy S., Poorvadevi R..
© 2023.
26 pages.
|
|
|