A bit arbitration tree anti-collision protocol in radio frequency identification systems

Yu Fu, Xue Wang, Enshu Wang and Zhihong Qian

International Journal of Distributed Sensor Networks, 2017, vol. 13, issue 11, 1550147717741571

Abstract: Radio frequency identification technology has been extensively used in various practical applications, such as inventory management and logistics control. When numerous tags respond to reader simultaneously, tags-to-tag collision occurs and causes the reader to identify tags unsuccessfully. Therefore, how to reduce tag collisions has already emerged as an urgent and crucial problem to be solved for speeding up the identification operation. This article designs a characteristic-value-based grouping rule and a collision bits rule to determine transmitted bit string combinations accurately and proposes a bit arbitration tree anti-collision protocol based on these two rules to decrease the time for collecting all tag IDs. Furthermore, we consider the case that received bit string less than three bits, which occurs during the tag identification operation. Both theory and simulation analyses show that the proposed protocol can reduce the number of idle slots and total number of slots and thereby improve system efficiency.

Keywords: Anti-collision; bit arbitration; radio frequency identification; tag identification (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1550147717741571 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741571

DOI: 10.1177/1550147717741571

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().