IDEAS home Printed from https://ideas.repec.org/a/igg/jwnbt0/v7y2018i1p39-52.html
   My bibliography  Save this article

An RFID Best Effort Mechanism for in Motion Tracking Applications

Author

Listed:
  • Rafael Perazzo Barbosa Mota

    (University of Sao Paulo, Sao Paulo, Brazil)

  • Daniel Macedo Batista

    (University of Sao Paulo, Sao Paulo, Brazil)

Abstract

In this article, the authors propose an algorithm that reduces useless responses for RFID systems in a motion environment, for tracking applications. The mechanism achieves its goals by reducing the number of packets exchanged between readers and tags. They analyze the behavior of their proposal by considering the average number of identification rounds. With extensive simulations using an RFID module for the ns-2 simulator, the authors show the benefit of the proposed mechanism. When compared to the Pure Q Algorithm and Binary Tree Slotted Aloha, their mechanism reduces the number of packets up to 43%, which is a good result in terms of performance of motion applications and energy consumption of the devices used in the communications.

Suggested Citation

  • Rafael Perazzo Barbosa Mota & Daniel Macedo Batista, 2018. "An RFID Best Effort Mechanism for in Motion Tracking Applications," International Journal of Wireless Networks and Broadband Technologies (IJWNBT), IGI Global, vol. 7(1), pages 39-52, January.
    • Handle: RePEc:igg:jwnbt0:v:7:y:2018:i:1:p:39-52
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWNBT.2018010104
    Download Restriction: no
    ---><---

    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:igg:jwnbt0:v:7:y:2018:i:1:p:39-52. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.