Welcome to the InfoSci Platform
Reference Hub2
An RFID Best Effort Mechanism for in Motion Tracking Applications

An RFID Best Effort Mechanism for in Motion Tracking Applications

Rafael Perazzo Barbosa Mota, Daniel Macedo Batista
Copyright: © 2018 |Volume: 7 |Issue: 1 |Pages: 14
ISSN: 2155-6261|EISSN: 2155-627X|EISBN13: 9781522546177|DOI: 10.4018/IJWNBT.2018010104
Cite Article Cite Article

MLA

Mota, Rafael Perazzo Barbosa, and Daniel Macedo Batista. "An RFID Best Effort Mechanism for in Motion Tracking Applications." IJWNBT vol.7, no.1 2018: pp.39-52. http://doi.org/10.4018/IJWNBT.2018010104

APA

Mota, R. P. & Batista, D. M. (2018). An RFID Best Effort Mechanism for in Motion Tracking Applications. International Journal of Wireless Networks and Broadband Technologies (IJWNBT), 7(1), 39-52. http://doi.org/10.4018/IJWNBT.2018010104

Chicago

Mota, Rafael Perazzo Barbosa, and Daniel Macedo Batista. "An RFID Best Effort Mechanism for in Motion Tracking Applications," International Journal of Wireless Networks and Broadband Technologies (IJWNBT) 7, no.1: 39-52. http://doi.org/10.4018/IJWNBT.2018010104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.