IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p848746.html
   My bibliography  Save this article

An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree

Author

Listed:
  • Wei Zhang
  • Yajun Guo
  • Xueming Tang
  • Guohua Cui
  • Longkai Wu
  • Ying Mei

Abstract

In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n -ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system.

Suggested Citation

  • Wei Zhang & Yajun Guo & Xueming Tang & Guohua Cui & Longkai Wu & Ying Mei, 2013. "An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 848746-8487, December.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:848746
    DOI: 10.1155/2013/848746
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/848746
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/848746?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:848746. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.