LRST: searching tree anti-collision algorithm with low-redundancy
During the RFID tag identification process, the tree-based anti-collision algorithms usually incur large amount of redundant data due to an excess of long query commands,which increases the communication overhead. To resolve this problem, a searching tree anti-collision algorithm with low-redundancy...
Saved in:
Main Authors: | Qiong HUANG, Jiang-tao LING, Min ZHANG, Xiao-long YANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2014-06-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.014/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved tree structure anti-collision algorithm of RFID
by: Xue WANG, et al.
Published: (2015-07-01) -
Bit arbitration query tree anti-collision algorithm based on grouping mechanism
by: Yu FU, et al.
Published: (2016-01-01) -
BIS:an RFID anti-collision algorithm minimizing the cost of empty slots
by: WANG Zhong-xiang, et al.
Published: (2009-01-01) -
CATPE protocol with capture effect for RFID tag anti-collision
by: Xi YANG, et al.
Published: (2014-07-01) -
Slot-predicting based ALOHA algorithm for RFID anti-collision
by: LI Meng, et al.
Published: (2011-01-01)