基于分支定界的動(dòng)態(tài)樹(shù)形搜索反碰撞算法

針對(duì)RFID系統(tǒng)中最常見(jiàn)的反碰撞問(wèn)題，論文提出了一種基于分支定界的動(dòng)態(tài)樹(shù)形搜索反碰撞算法，算法采用分支定界的樹(shù)形搜索機(jī)理，動(dòng)態(tài)調(diào)整指令發(fā)送長(zhǎng)度和發(fā)送值，并對(duì)一位碰撞進(jìn)行智能識(shí)別。最后利用樹(shù)的遍歷思想予以實(shí)現(xiàn)，該算法能高效地識(shí)別所有標(biāo)
簽，時(shí)間復(fù)雜度低，在RFID領(lǐng)域有較好的應(yīng)用前景。
關(guān)鍵詞：分支定界；動(dòng)態(tài)傳輸；反碰撞；無(wú)線(xiàn)射頻識(shí)別
Abstract: For solving the common problem of anti-collision in RFID, this article brings
forward a binary-tree dynamic searching anti-collision algorithm based on branching and
bounding. The algorithm uses the principle of binary-tree searching on branching and bounding, adjusts the length and the value of sending code, and recognizes the collision of one bit intelligent .Finally, the algorithm is put into practice based on the traversing idea of tree, can identify all tags efficient, be proved by the analysis of time complexity, and has more extensive application prospects in radio frequency identification field.
Key words：Branch and bound; Dynamic send; anti-collision; RFID