Distributed Efficient & Fair Anticollision for RFID Protocol

International audienceRFID technology suffers from a recurring issue: the reader-to-reader collision. Numerous protocols have been proposed to attempt to reduce them, but, remaining reading errors still heavily impact the performances and fairness of dense RFID deployments. This paper introduces a new Distributed Efficient & Fair Anticollision for RFID (DEFAR) protocol. It reduces both monochannel and multichannel collisions as well as interference by a factor of almost 90% in comparison with the best state of the art protocols. The fairness of the medium access among the readers is improved to a 99% level. Such improvements are achieved applying a TDMA-based "server-less" approach and assigning different priorities to readers depending on their behavior over precedent rounds. A distributed reservation phase is organized between readers with at least one winning reader afterwards. Then, multiple reading phases occur within a single frame in order to obtain fast coverage and high throughput. The use of different reader priorities based on reading behaviors of previous frames also contributes to improve both fairness and efficiency. Simulation results show the robustness of the proposed solution in terms of different metrics such collision avoidance, fairness and coverage and in comparison with a centralized literature solution

A survey of RFID readers anticollision protocols

International audienceWhile RFID technology is gaining increased attention from industrial community deploying different RFID-based applications, it still suffers from reading collisions. As such, many proposals were made by the scientific community to try and alleviate that issue using different techniques either centralized or distributed, monochannel or multichannels, TDMA or CSMA. However, the wide range of solutions and their diversity make it hard to have a clear and fair overview of the different works. This paper surveys the most relevant and recent known state-of-the-art anti-collision for RFID protocols. It provides a classification and performance evaluation taking into consideration different criteria as well as a guide to choose the best protocol for given applications depending on their constraints or requirements but also in regard to their deployment environments

Data Gathering Solutions for Dense RFID Deployments

International audienceThe advent of RFID (Radio Frequency Identification) has allowed the development of numerous applications. Indeed, solutions such as tracking of goods in large areas or sensing in smart cities are now made possible. However, such solutions encounter two main issues, first is inherent to the technology itself which is readers collisions, the second one being the gathering of read data up to a base station, potentially in a multihop fashion. While the first one has been a main research subject in the late years, the next one has not been investigated for the sole purpose of RFID, but rather for wireless adhoc networks. This multihop tag information collection must be done in regards of the application requirements but it should also care for the deployment strategy of readers to take advantage of their relative positions, coverage, reading activity and deployment density to avoid interfering between tag reading and data forwarding. To the best of our knowledge, the issue for a joint scheduling between tag reading and forwarding has never been investigated so far in the literature, although important.In this paper, we propose two new distributed, crosslayer solutions meant for the reduction of collisions and better efficiency of the RFID system but also serve as a routing solution towards a base station. Simulations show high levels of throughput while not lowering on the fairness on medium access staying above 85% in the highest deployment density with up to 500 readers, also providing a 90% data rate

RFID Anticollision in Dense Mobile Environments

International audienceThe popularization of RFID systems has conducted to large deployments of RFID solutions in various areas under different criteria. However, such deployments, specially in dense environments, can be subject to RFID collisions which in turn affect the quality of readings.In this paper we propose two distributed and efficient solutions for dense mobile deployments of RFID systems. mDEFAR is an adaptation of a previous work highly performing in terms of collisions reduction, efficiency and fairness in dense static deployments. CORA is more of a locally mutual solution where each reader relies on its neighborhood to enable itself or not. Using a beaconing mechanism, each reader is able to identify potential (non-)colliding neighbors in a running frame and as such chooses to read or not. Performance evaluation shows high performance in terms of coverage delay for both proposals quickly achieving 100% coverage depending on the considered use case while always maintaining consistent efficiency levels above 70%. Compared to GDRA, our solutions proved to be better suited for highly dense and mobile environments, offering both higher throughput and efficiency. The results reveal that depending on the application considered, choosing either mDEFAR or CORA helps improve efficiency and coverage delay

RFID Anticollision in Dense Mobile Environments

International audienceThe popularization of RFID systems has conducted to large deployments of RFID solutions in various areas under different criteria. However, such deployments, specially in dense environments, can be subject to RFID collisions which in turn affect the quality of readings.In this paper we propose two distributed and efficient solutions for dense mobile deployments of RFID systems. mDEFAR is an adaptation of a previous work highly performing in terms of collisions reduction, efficiency and fairness in dense static deployments. CORA is more of a locally mutual solution where each reader relies on its neighborhood to enable itself or not. Using a beaconing mechanism, each reader is able to identify potential (non-)colliding neighbors in a running frame and as such chooses to read or not. Performance evaluation shows high performance in terms of coverage delay for both proposals quickly achieving 100% coverage depending on the considered use case while always maintaining consistent efficiency levels above 70%. Compared to GDRA, our solutions proved to be better suited for highly dense and mobile environments, offering both higher throughput and efficiency. The results reveal that depending on the application considered, choosing either mDEFAR or CORA helps improve efficiency and coverage delay

How to improve CSMA-based MAC protocol for dense RFID reader-to-reader Networks?

International audienceDue to the dedicated short range communication feature of passive radio frequency identification (RFID) and the closest proximity operation of both tags and readers in a large-scale dynamic RFID system, when nearby readers simultaneously try to communicate with tags located within their interrogation range, serious interference problems may occur. Such interferences may cause signal collisions that lead to the reading throughput barrier and degrade the system performance. Although many efforts have been done to maximize the throughput by proposing protocols such as NFRA or more recently GDRA, which is compliant with the EPCglobal and ETSI EN 302 208 standards. However, the above protocols are based on unrealistic assumptions or require additional components with more control packet and perform worse in terms of collisions and latency, etc. In this paper, we explore the use of some well-known Carrier Sense Multiple Access (CSMA) backoff algorithms to improve the existing CSMA-based reader-to-reader anti-collision protocol in dense RFID networks. Moreover, the proposals are compliant with the existing standards. We conduct extensive simulations and compare their performance with the well-known state-of-the-art protocols to show their performance under various criteria. We find that the proposals improvement are highly suitable for maximizing the throughput, efficiency and for minimizing both the collisions and coverage latency in dense RFID Systems

On the design and implementation of efficient antennas for high frequency-radio frequency identification read/write devices

AbstractThis article describes an in‐depth methodical approach to the development of efficient high‐frequency (HF) antennas for use in radio frequency identification (RFID) systems operating at 13.56 MHz. It presents brief theory relevant to RFID communication and sets up a framework within which features and requirements of antennas are linked to key design parameters such as antenna form‐factor and size; RF power level, material and communication protocol. Tuning circuits necessary to adjust the resonance and power matching characteristics of antennas for good transponder interrogation and response recovery are discussed. To validate the approaches outlined, a stepwise design and measurement of an HF antenna for an ISO/IEC 15693 compliant read/write device (RWD) is described. Common practical problems that are often encountered in such design processes are also commented on. The prototyped antenna was tuned, connected to the RWD via a 50 coaxial cable and tested

LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks

Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft

Protocoles d'anticollision de lecteurs RFID pour des déploiements denses et mobiles

International audienceLe développement de la technologie RFID a permis son adoption importante et conduit à un déploiement croissant de solutions RFID dans divers environnements sous divers scénarios et contraintes. La nature de ces contraintes va de la quantité à la mobilité des lecteurs déployés ce qui affecte la qualité du système RFID en provoquant des collisions de lecture. Bien que plusieurs solutions aient été proposées pour aborder la question de la collision de la lecture, peu d'entre elles se sont préoccupées de la densification et/ou de la mobilité des lecteurs. Cet article propose deux approches TDMA distribuées conçues pour réduire ces collisions par une coordination locale entre des dispositifs voisins pour différents scénarios testés ici. La première proposition est basée sur une phase de réservation organisée entre lecteurs avec différents niveaux de priorité donnés aux lecteurs en fonction de leur succès antérieur. La seconde tire profit du cas particulier des collisions RFID permettant une décision locale et mutuelle de chaque lecteur d'accéder ou non aux tags dans son voisinage. Des simulations ont été effectuées sur différents environnements contraignants en termes de densité et de mobilité des tags/lecteurs. Elles ont montré que nos propositions obtiennent les meilleures performances en termes de débit, de collisions et de délai de couverture par rapport à d'autres systèmes de réduction de collision

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft