Efficient memoryless protocol for tag identification (extended abstract)

Law, C.; Lee, Kayi; Siu, Kai‐Yeung

doi:10.1145/345848.345865

Cited by 309 publications

(255 citation statements)

References 5 publications

Supporting

Mentioning

243

Contrasting

Unclassified

Order By: Relevance

“…Generally, the existing RFID tag identification protocols can be classified into two categories [10,11]: ALOHA-based protocols [27][28][29][30] and tree-based protocols [19,31]. In ALOHA-based protocols, on average a tag needs to transmit its ID e times to the reader before being successfully identified [10,27], where e is the base of natural logarithm whose value is approximately equal to 2.72.…”

Section: Related Workmentioning

confidence: 99%

“…[18] [19] [17], because the reader has no simple way to distinguish the tags that are not enrolled yet from those that have already been enrolled, it has to collect all the tags in its interrogation region. In fact, how to efficiently read only the tags that have not been enrolled into the system is an interesting problem called unknown tag identification [20][21][22] that has not been thoroughly solved.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Energy-efficient active tag searching in large scale RFID systems

Zhang

Wang

et al. 2015

Information Sciences

View full text Add to dashboard Cite

Radio Frequency Identification (RFID) is a key enabling technology of Internet of Things (IoTs) and has attracted much research attention in recent years. RFID can support automatic information tracing and management during the management process in many fields. A typical application of RFID is modern warehouse management, where products are attached with RFID tags and the inventory is managed by retrieving tag IDs. Many practical applications require searching a group of tags to determine whether they are in the system or not. The existing studies on tag searching have mainly focused on improving time efficiency and paid little attention to energy efficiency that is extremely important for active tags powered by built-in batteries. To fill in this gap, this paper investigates the tag searching problem from the angle of energy efficiency. We first propose an Energy-efficient tag Searching protocol in Multiple reader RFID systems, namely ESiM, which pushes per tag energy consumption to the limit as each tag needs to exchange only one bit

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Energy-efficient active tag searching in large scale RFID systems

Zhang

Wang

et al. 2015

Information Sciences

View full text Add to dashboard Cite

show abstract

“…If there is a collision the reader will divide the tags into two groups and then query one group again. The reader continues splitting and probing until each individual tag is identified (Law et al, 2000;Micic et al, 2005;Myung and Lee, 2005). The second category is based on the ALOHA protocol and the Slotted ALOHA protocol (Madden et al, 2002a;Cha and Kim, 2005;Bonuccelli et al, 2006;Sheng et al, 2008;Tan et al, 2008;Sheng et al, 2010;Xie et al, 2010).…”

Section: Related Workmentioning

confidence: 99%

Efficient median estimation for large-scale sensor RFID systems

Mustafa

Zhu

et al. 2012

IJSNET

View full text Add to dashboard Cite

Abstract:We consider the median estimation problem in a large-scale sensor augmented RFID system. The large-scale deployment of RFID technology has opened the door to innovative ways to integrate RFID and sensor technology. Sensor-tags are tags that can report over 50 types of physical information to a reader. The traditional way to obtain information from sensor-tags is to query each tag. When the number of tags is large, however, it is prohibitive to query tags individually due to the high delay. In this paper, we present a probabilistic algorithm to estimate the median of a set of sensor-RFID tags without individually querying each tag. The median estimation problem is solved using binary search. Our evaluation demonstrates that the median search algorithm exhibits high accuracy and reasonable time latency. Moreover, we also design an exact algorithm for the continuous median update problem. Our algorithm can incrementally compute the exact median in less time.

show abstract

“…Among tree search methods, Binary Tree Search [6] and Query Tree [7] have been suggested specifically for collision resolution in RFID systems. In Binary Tree Search protocol [6], tags continue to transmit the remainder of their Electronic Product Code (EPC) strings if their last transmitted bit matches with the one transmitted by the reader in the current bit interval, otherwise the tags get muted.…”

Section: Introductionmentioning

confidence: 99%

OPT: Optimal Protocol Tree for Efficient Tag Identification in Dense RFID Systems

Khandelwal

Yener

Chen

2006

2006 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-We propose a novel collision resolution scheme termed the Optimal Protocol Tree (OPT), which is based on the tree search algorithm for RFID systems. The basic principle of OPT relies on taking advantage of the similarities in the identification strings of different tags, having the reader prompt the tags to send only the mutually exclusive sub-portion of their identification strings. The aim of OPT is to significantly reduce the total identification time, in order to render the deployment of dense RFID systems feasible. Simulation results are presented to demonstrate the performance of OPT, and the considerable improvement it provides with respect to the existing tree search protocols.

show abstract

Efficient memoryless protocol for tag identification (extended abstract)

Cited by 309 publications

References 5 publications

Energy-efficient active tag searching in large scale RFID systems

Energy-efficient active tag searching in large scale RFID systems

Efficient median estimation for large-scale sensor RFID systems

OPT: Optimal Protocol Tree for Efficient Tag Identification in Dense RFID Systems

Contact Info

Product

Resources

About