One-Time Collision Arbitration Algorithm in RFID Based on the Manchester Code

勤益科大機構典藏 > 電資學院 > 電子工程系(所) > 【電子工程系所】期刊論文 > Item 987654321/6693

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/6693

题名:	One-Time Collision Arbitration Algorithm in RFID Based on the Manchester Code
作者:	劉正忠
贡献者:	電子工程(學)系
日期:	2011-02
上传时间:	2017-11-23 09:28:19 (UTC+8)
摘要:	In radio-requency identification (RFID) systems, when multiple tags transmit data to a reader simultaneously, these data may collide and create unsuccessful identifications; hence, anticollision algorithms are needed to reduce collisions (collision cycles) to improve the tag identification speed. We propose a one-time collision arbitration algorithm to reduce both the number of collisions and the time consumption for tags' identification in RFID. The proposed algorithm uses Manchester coding to detect the locations of collided bits, uses the divide-and-conquer strategy to find the structure of colliding bits to generate 96-bit query strings as the 96-bit candidate query strings (96BCQSs), and uses query-tree anticollision schemes with 96BCQSs to identify tags. The performance analysis and experimental results show that the proposed algorithm has three advantages: (i) reducing the number of collisions to only one, so that the time complexity of tag identification is the simplest O(1), (ii) storing identified identification numbers (IDs) and the 96BCQSs in a register to save the used memory, and (iii) resulting in the number of bits transmitted by both the reader and tags being evidently less than the other algorithms in one-tag identification or in all tags identification.
關聯:	Optical Engineering
显示于类别:	[電子工程系(所)] 【電子工程系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.

数据加载中.....