Journal of Guangdong University of Technology ›› 2013, Vol. 30 ›› Issue (2): 84-89.doi: 10.3969/j.issn.1007-7162.2013.02.016

• Comprehensive Studies • Previous Articles     Next Articles

A New Adaptive Anti-collision Algorithm Based on Multi-Tree Search

Chen Gang1, Duan Yuan1, Liu Bing-quan2   

  1. 1. Department of Computer Science, Guangdong University of Science & Technology, Dongguan 523083,China; 2. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001,China
  • Received:2013-01-21 Online:2013-06-27 Published:2013-06-27

Abstract: For the radio frequency identification (RFID) systems, the tag collision brings about low efficiency in the process of tag identification. On the basis of the traditional adaptive multi-tree, it raises a new improved adaptive multi-tree (NAMS) anti-collision algorithm. Before calculating the collision factor and selecting fork number, in the algorithm it first estimated collided tag number N and the statistical collision digit capacity m, directly identified leaf nodes which satisfied the N=2m to shorten the search time; simultaneously it introduced autosleep counting mechanism which decreased on average half of the number of executive commands, thereby shortening the communication time. Finally, the required total number of slots of the algorithm was analyzed and experiments were conducted. The results show that the improved multi-tree anti-collision algorithm has higher recognition speed and system throughput rate than the traditional anti-collision algorithm.

Key words: radio frequency identification; multi-tree; anti-collision algorithm; collision factor

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!