A New Multi Tree Query Based Protocol for Reducing Tag Collision in RFID Systems

One of the important challenges in RFID systems is reducing time of identifying tag readers. This problem is happened when tag reader asks tags for information and confront with several answers, concurrently. Most of techniques for confronting with collision are based on multiple access method based on time division. Thus, main protocols on confronting with collision are divided into two basic deterministic and non-deterministic protocols. We evaluate some available protocol and compare them and then present a model based on multi groups tree combination, which in this method, tags are divided into groups based on size frames, and each group consist a tree. In fact, we break a large binary tree into the several smaller trees to reduce the number of collisions. Our simulation result shows that multi query tree outperforms some tree based tag anti-collision protocols when the number of tags is increased

کلیدواژه ها:

Tag Anti-collision protocols ، RFID ، multi query tree ، Tree based