Probabilistic Dynamic Framed Slotted ALOHA for RFID Tag Identification

Nguyen, Chuyen T.; Hayashi, Kazunori; Kaneko, Megumi; Popovski, Petar; Sakai, Hideaki

doi:10.1007/s11277-012-0981-z

Cited by 14 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EPC C1G2 standard assumes that the reader can only read one tag ID at a time. Dynamic Framed Slotted ALOHA (DFSA) [16]- [20] is implemented to deal with tag collisions, where each frame consists of a certain number of equal-duration slots. It is proved that the theoretical upper bound of identification throughput using DFSA is approximately tags per slot ( is the natural constant), which 1 If perfect accuracy is necessary, a post-step may be taken by the reader to broadcast the identified IDs.…”

Section: A Tag Identificationmentioning

confidence: 99%

“…We define and , which are the tags to be filtered out. Because is always a subset of both and , we have (16) Instead of exchanging a single filtering vector at a time, we generalize our iterative approach by allowing multiple filtering vectors to be sent consecutively. Each round consists of two phases.…”

Section: E Generalized Approachmentioning

confidence: 99%

“…This process repeats until all tag IDs are read successfully. Unlike the basic ALOHA-based protocols where the frame size is fixed, RFID systems with DFSA [16]- [20] dynamically adjust the frame size in each round to improve throughput.…”

Section: A Prior Rfid Researchmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel

Chen

Luo

Zhang

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Radio frequency identification (RFID) technology has many applications in inventory management, supply chain, product tracking, transportation, and logistics. One research issue of practical importance is to search for a particular group of tags in a large-scale RFID system. Time efficiency is a crucial factor that must be considered when designing a tag search protocol to ensure its execution will not interfere with other normal inventory operations. In this paper, we design a new technique called filtering vector, which can significantly reduce transmission overhead during search process, thereby shortening search time. Based on this technique, we propose an iterative tag search protocol. In each round, we filter out some tags and eventually terminate the search process when the search result meets the accuracy requirement. Furthermore, we extend our protocol to work under noisy channel. The simulation results demonstrate that our protocol performs much better than the best existing work.

show abstract

Section: A Tag Identificationmentioning

confidence: 99%

Section: E Generalized Approachmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel

Chen

Luo

Zhang

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Tags not receiving positive acknowledgements from the reader will continue participating in the subsequent frames. The dynamic frame slotted ALOHA (DFSA) [20], [21] adjusts the frame size round by round.…”

Section: Related Workmentioning

confidence: 99%

Identifying State-Free Networked Tags

Chen

2015

2015 IEEE 23rd International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

Traditional radio frequency identification (RFID) technologies allow tags to communicate with a reader but not among themselves. By enabling peer communications between nearby tags, the emerging networked tags represent a fundamental enhancement to today's RFID systems. They support applications in previously infeasible scenarios where the readers cannot cover all tags due to cost or physical limitations. This paper is the first study on identifying state-free networked tags, which is a basic, fundamental function for most tagged systems. To prolong the lifetime of networked tags and make identification protocols scalable to large systems, energy efficiency and time efficiency are most critical. Our investigation reveals that the traditional contention-based protocol design will incur too much energy overhead in multihop tag systems. Surprisingly, a readercoordinated design that significantly serializes tag transmissions performs much better. In addition, we show that load balancing is important in reducing the worst-case energy cost to the tags, and we present a solution based on serial numbers.

show abstract

“…The main challenge in those works is to resolve the radio collision when tags respond to the reader in the same time slot. Although significant contribution has been gained in the literature so far [13,14], proposed algorithms/protocols probably take much time for the ID collection due to a huge number of tags with corresponding 96-bit (or 128-bit) IDs. Another approach is to monitor the existence of expected tags (i.e., the tags whose IDs are already known to the reader) and give a necessary warning/alarm to system managers.…”

Section: Introductionmentioning

confidence: 99%

Efficient Missing-Tag Event Detection Protocols to Cope with Unexpected Tags and Detection Error in RFID Systems

Nguyen

Hoang

et al. 2019

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

This paper investigates the issue of missing-tag event detection in practical radio frequency identification (RFID) systems with the presence of not only unexpected tags but also the detection error. Among all the previous works, the recently proposed protocol “RFID monitoring with UNexpected tags (RUN)” is one of the first studies taking the unexpected tags into account. The protocol is proven to outperform conventional ones in terms of achieving a required reliability. Nevertheless, it completely ignores the effect of the so-called detection error, which is a common phenomenon in the literature of RFID, on tag reading. The phenomenon might result in the false-alarm detection of the event and it is believed that RUN is no longer efficient and reliable. We therefore propose two modified versions of the RUN protocol, namely, mRUN1 and mRUN2, as solutions for the issue. Similarly to RUN, the protocols execute multiple Aloha reading rounds to cope with the unexpected tags. On the other hand, they utilize tracking counters supposedly available at the reader to mitigate the effect of the detection error. While mRUN1 requires many counters to monitor the existence of each expected tag (the tag’s identity is already known), mRUN2 uses only one counter to deal with the event caused by either real missing tags or the detection error. Performance analysis will be investigated to find optimal parameter settings for the protocols. Computer simulation results are also provided to validate our analysis as well as to show the merit of the proposed protocols in comparison with the conventional protocols.

show abstract

Probabilistic Dynamic Framed Slotted ALOHA for RFID Tag Identification

Cited by 14 publications

References 26 publications

An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel

An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel

Identifying State-Free Networked Tags

Efficient Missing-Tag Event Detection Protocols to Cope with Unexpected Tags and Detection Error in RFID Systems

Contact Info

Product

Resources

About