Title: An algorithm based on bit-by-bit binary-tree of backtracking
Abstract: Tag collision is a key problem in radio frequency identification(RFID) when many tags are identified.The binary-tree searching(BS) algorithm is usually used to solve this problem.On the basis of the BS algorithm,a bit-by-bit binary-tree(BBT) searching algorithm has been proposed,which is actually derived from the BS.This paper offers a new algorithm,which is an improvement on the BBT,and proves that the new algorithm has some advantages by comparing with other algorithms.Finally,software realization is also presented.
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot