Novel ID-based anti-collision approach for RFID

被引:9
作者
Zhang, De-Gan [1 ,2 ]
Li, Wen-Bin [1 ,2 ]
机构
[1] Tianjin Univ Technol, Key Lab Comp Vis & Syst, Minist Educ, Tianjin 300384, Peoples R China
[2] Tianjin Univ Technol, Tianjin Key Lab Intelligent Comp & Novel Software, Tianjin 300384, Peoples R China
基金
中国国家自然科学基金;
关键词
Internet of Things; RFID; M-tree; modulation binary pulse; correlation ID; WIRELESS SENSOR NETWORKS; TAG ANTICOLLISION; PROTOCOL; IDENTIFICATION; ALOHA;
D O I
10.1080/17517575.2014.986221
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Novel correlation ID-based (CID) anti-collision approach for RFID under the banner of the Internet of Things (IOT) has been presented in this paper. The key insights are as follows: according to the deterministic algorithms which are based on the binary search tree, we propose a method to increase the association between tags so that tags can initiatively send their own ID under certain trigger conditions, at the same time, we present a multi-tree search method for querying. When the number of tags is small, by replacing the actual ID with the temporary ID, it can greatly reduce the number of times that the reader reads and writes to tag's ID. Active tags send data to the reader by the way of modulation binary pulses. When applying this method to the uncertain ALOHA algorithms, the reader can determine the locations of the empty slots according to the position of the binary pulse, so it can avoid the decrease in efficiency which is caused by reading empty slots when reading slots. Theory and experiment show that this method can greatly improve the recognition efficiency of the system when applied to either the search tree or the ALOHA anti-collision algorithms.
引用
收藏
页码:771 / 789
页数:19
相关论文
共 15 条
[1]   Technique for Differential Timing Transfer Over Packet Networks [J].
Aweya, James .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2013, 9 (01) :325-336
[2]   Query tree-based reservation for efficient RFID tag anti-collision [J].
Choi, Ji Hwan ;
Lee, Dongwook ;
Lee, Hyuckjae .
IEEE COMMUNICATIONS LETTERS, 2007, 11 (01) :85-87
[3]   An Efficient Anti-Collision Protocol for RFID Tag Identification [J].
Jia, Xiaolin ;
Feng, Quanyuan ;
Ma, Chengzhen .
IEEE COMMUNICATIONS LETTERS, 2010, 14 (11) :1014-1016
[4]   Handling Inelastic Traffic in Wireless Sensor Networks [J].
Jin, Jiong ;
Sridharan, Avinash ;
Krishnamachari, Bhaskar ;
Palaniswami, Marimuthu .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (07) :1105-1115
[5]   Identification of RFID tags in framed-slotted ALOHA with robust estimation and binary selection [J].
Park, Jongho ;
Chung, Min Young ;
Lee, Tae-Jin .
IEEE COMMUNICATIONS LETTERS, 2007, 11 (05) :452-454
[6]   Modified DPWS Protocol Stack for 6LoWPAN-Based Wireless Sensor Networks [J].
Samaras, Ioakeim K. ;
Hassapis, George D. ;
Gialelis, John V. .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2013, 9 (01) :209-217
[7]   DYNAMIC FRAME LENGTH ALOHA [J].
SCHOUTE, FC .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (04) :565-568
[8]   An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision [J].
Yang, Ching-Nung ;
He, Jyun-Yan .
IEEE COMMUNICATIONS LETTERS, 2011, 15 (05) :539-541
[9]   A kind of novel method of service-aware computing for uncertain mobile applications [J].
Zhang, De-gan ;
Liang, Yan-pin .
MATHEMATICAL AND COMPUTER MODELLING, 2013, 57 (3-4) :344-356
[10]   A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT) [J].
Zhang, De-gan ;
Zhu, Ya-nan ;
Zhao, Chen-peng ;
Dai, Wen-bo .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 64 (05) :1044-1055