Improved tree structure anti-collision algorithm of RFID
The whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix...
Saved in:
Main Authors: | Xue WANG, Zhi-hong QIAN, Xiao-hui LIU, Chao CHENG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2015-07-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015161/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bit arbitration query tree anti-collision algorithm based on grouping mechanism
by: Yu FU, et al.
Published: (2016-01-01) -
LRST: searching tree anti-collision algorithm with low-redundancy
by: Qiong HUANG, et al.
Published: (2014-06-01) -
BIS:an RFID anti-collision algorithm minimizing the cost of empty slots
by: WANG Zhong-xiang, et al.
Published: (2009-01-01) -
Slot-predicting based ALOHA algorithm for RFID anti-collision
by: LI Meng, et al.
Published: (2011-01-01) -
CATPE protocol with capture effect for RFID tag anti-collision
by: Xi YANG, et al.
Published: (2014-07-01)