Table of Content

Open AccessOpen Access


An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification

Guozhong Dong1, Weizhe Zhang1, 2, *, Sichang Xuan3, Feng Qin4, Haowen Tan5

1 The Cyberspace Security Research Center, Peng Cheng Laboratory, Shenzhen, 518000, China.
2 School of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China.
3 Information Security Research Center, Harbin Engineering University, Harbin, 150001, China.
4 Wuhan Maritime Communication Research Institute, Wuhan, 430205, China.
5 Department of Computer Engineering, Chosun University, Gwangju, 61452, Korea.

* Corresponding Author: Weizhe Zhang. Email: .

Computers, Materials & Continua 2020, 65(2), 1855-1868.


Radio frequency identification (RFID) has been widespread used in massive items tagged domains. However, tag collision increases both time and energy consumption of RFID network. Tag collision can seriously affect the success of tag identification. An efficient anti-collision protocol is very crucially in RFID system. In this paper, an improved binary search anti-collision protocol namely BRTP is proposed to cope with the tag collision concern, which introduces a Bi-response mechanism. In Biresponse mechanism, two groups of tags allowed to reply to the reader in the same slot. According to Bi-response mechanism, the BRTP strengthens the tag identification of RFID network by reducing the total number of queries and exchanged messages between the reader and tags. Both theoretical analysis and numerical results verify the effectiveness of the proposed BRTP in various performance metrics including the number of total slots, system efficiency, communication complexity and total identification time. The BRTP is suitable to be applied in passive RFID systems.


Cite This Article

G. Dong, W. Zhang, S. Xuan, F. Qin and H. Tan, "An improved binary search anti-collision protocol for rfid tag identification," Computers, Materials & Continua, vol. 65, no.2, pp. 1855–1868, 2020.


This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1880


  • 1007


  • 0


Related articles

Share Link