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

Fu, Yu; Wang, Xue; Wang, Enshu; Qian, Zhihong

doi:10.1177/1550147717741571

Cited by 6 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fu et al [10] designed a characteristic-value-based grouping rule and a collision bits rule to determine transmitted bit string combinations accurately and proposed a bit arbitration tree anti-collision protocol based on these two rules to decrease the time for collecting all tag IDs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Improved Anti-Collision Algorithm for the Application on Intelligent Warehouse

Qiu¹,

Xu²,

Yang³

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

As an important part of economic development, warehousing logistics also needs to be transformed and upgraded in order to adapt to the development of the new situation. The RFID reader records the related information of the goods to improve the efficiency of warehouse operation by identifying the RFID tags attached to the goods in batches. This paper also proposes an improved group-based anti-collision algorithm (GMQT) to solve the problem of tag collision in the process of Radio Frequency Identification (RFID) identification. The simulation results show that the GMQT algorithm improves the recognition efficiency of the system. The algorithm has the advantages of small data transmission and stable performance; in particular, the recognition efficiency is not affected by the number of tags.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In this section, we compare GMQT algorithm to QT [1], 8-ary QT, IACA [5], BAT [10], MQT [11] from system efficiency and communication complex. We consider an ideal transmission channel, without capture-effect and path-loss affects.…”

Section: Simulation and Comparisonmentioning

confidence: 99%

Improved Anti-Collision Algorithm for the Application on Intelligent Warehouse

Qiu¹,

Xu²,

Yang³

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Manchester code [26][27][28][29][30] is widely used in tree-based RFID multi-tag anti-collision protocols. It is mainly used to accurately detect the positions of collision bits.…”

Section: Manchester Codementioning

confidence: 99%

“…Simulation comparisons show that these two protocols significantly reduce energy consumption, but at the same time, this leads to a notable increase in the total number of timeslots. Subsequently, Y Fu et al 30 improved the A4PQT protocol and proposed the bit arbitration tree (BAT) anti-collision protocol which could further improve the performance of system identification. However, in some cases, there are still many collision timeslots.…”

Section: Introductionmentioning

confidence: 99%

A multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree

Chu

Qian

Wang

2018

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

In order to solve the problem of multi-tag anti-collision in radio frequency identification systems, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree is proposed in this article. According to Manchester code, the highest collision bit can be detected. In the process of tag identification, the protocol only locks the target on the three consecutive bits which start from the highest collision bit. The protocol has two tag identification mechanisms, and which one is chosen is determined by the value of collision coefficient. Using the collision information characteristics of the three bits, idle timeslots are evitable, and some collision timeslots are eliminated at the same time. The 8-ary adaptive pruning query tree protocol fully takes into account several important performance indicators such as the number of query timeslots, communication complexity, transmission delay, and throughput. Both theoretical analysis and simulation results show that this protocol performs better than other tree-based anti-collision protocols. The throughput of 8-ary adaptive pruning query tree protocol remains approximately 0.625.

show abstract

“…If the quantity of responding tags is more than one, the query signal is further restricted until the tag ID is uniquely identified. These algorithms include query tree (QT) [6] , quadtree [7] , adaptive multiway tree [8] , collision tree (CT) [9] and A4PQT [10] . Although tree-based algorithms can identify all tags, the recognition time will increase sharply when the number of tag bits or there is a high volume of tags and the binary tree'height will continue to increase, resulting in excessively long recognition time.…”

Section: Introductionmentioning

confidence: 99%