Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
DOI: 10.1109/isit.1998.708695
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of tree algorithms for RFID arbitration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
169
0
1

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 271 publications
(172 citation statements)
references
References 3 publications
2
169
0
1
Order By: Relevance
“…This modification implements the estimator of the OQTT with a simple Binary Tree (BT) protocol [60]. The estimator establishes the inital upper bound for tags' counters.…”
Section: Optimal Query Tracking Tree Protocolmentioning
confidence: 99%
“…This modification implements the estimator of the OQTT with a simple Binary Tree (BT) protocol [60]. The estimator establishes the inital upper bound for tags' counters.…”
Section: Optimal Query Tracking Tree Protocolmentioning
confidence: 99%
“…[6]With RFID technology, Wal-Mart can detect the product information in real time, which greatly enhanced the supply chain efficiency of Wal-Mart, However, because RFID technology standards were still not perfect at that time, the production cost of RFID tags was high, and the high RFID label leakage rate led to the full development of RFID in Wal-Mart's supply chain. Today, the price of RFID tags has dropped to a few cents from the first generation of $ 1.25 in 2003, [7]and the high cost of labeling is no longer a problem, and with the continuous improvement of RFID protocols in recent years, RFID technology has made rapid progress Development, this project through in-depth study of the effective distance of medium-power card reader produced by Guangzhou East Core Technology Co., Ltd. under ISO5693 agreement, found and mastered the valid card reading range and card reader blind zone of the card reader under the ISO15693 protocol.…”
Section: Iso15693 Protocol Readermentioning
confidence: 99%
“…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%