Download now Free registration required
In this paper, the authors propose a hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, they use a 4-ary query tree instead of a binary query tree. To reduce idle time, the authors introduce a slotted backoff mechanism to reduce the number of unnecessary query commands. For static scenarios of tags, they extended the proposed protocol by adopting two phases. First, in leaf query phase for existing tags, the interrogator queries leaf-nodes directly to reuse query strings in the previous session. Second, in root query phase for new arriving tags, the interrogator starts the query process from the root-node.
- Format: PDF
- Size: 235.4 KB