Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (5): 50-55.doi: 10.13190/j.jbupt.2014.05.011

• Papers • Previous Articles     Next Articles

An Anti-collision Algorithm Based on Flat-N-tree Search for RFID

ZHAO Bin1,2, HE Jing-sha1,3, HUANG Na1, QU Hui-fang2, LIU Gong-zheng1   

  1. 1. School of Software Engineering, Beijing University of Technology, Beijing 100124, China;
    2. Department of Computer Science, Jining University, Shandong Qufu 273155, China;
    3. Low-carbon Research Center, Beijing Development Area Co, Beijing 100176, China
  • Received:2013-12-01 Online:2014-10-28 Published:2014-11-07

Abstract:

The anti-collision technology is a key technology in the radio frequency identification (RFID) system. In order to avoid the low efficiency problem of reading massive data labels via the binary-tree search algorithm, by analyzing the character of mass data and the regularity of tags encoding, a flat-N-tree search anti-collision algorithm is proposed according to the regularity of massive data tags encoding and the principle of binary-tree search algorithm in the management systems, which is suitable for reading massive data RFID labels. The result shows that the reading efficiency of the multi-tree search algorithm is better than that of the binary-tree search algorithm when the total quantity of tags is greater than a certain value.

Key words: radio frequency identification system, anti-collision, mass data, flat-N-tree

CLC Number: