检索结果-内蒙古大学图书馆

query tree Algorithm for RFID Tag with Binary-Coded Decimal EPC

IEEE COMMUNICATIONS LETTERS 2012年第10期16卷 1616-1619页

作者： Yang, Ching-Nung Hu, Li-Jen Lai, Jia-Bin Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Shoufeng Township Taiwan

A tag-collision problem in Radio Frequency Identification (RFID) system is the event that a reader cannot identify a tag if many tags respond to a reader at the same time. Although binary Electronic Product Code (EPC) is the most natural for a computer, most people are accustomed to the decimal system. In RFID applications, we need to convert binary EPC to decimal numbers. Since converting binary-coded decimal (BCD) data into the decimal numbers is much less complex than converting binary data into decimal numbers. This motivates us to represent EPC by BCD. However, using BCD-based EPC delivers two problems: (i) Is the existing query tree algorithm suitable for identifying BCD-based EPC? (ii) How do we design a new query tree algorithm to enhance the tag-identification efficiency? In this work, we solved the problems.

关键词： RFID EPC tag collision query tree

来源：评论

学校读者我要写书评

暂无评论

Novel RFID anti-collision algorithm based on the Monte-Carlo query tree search

引用

WIRELESS NETWORKS 2021年第1期27卷 621-634页

作者： Samsami, Mohammad Mehdi Yasrebi, Navid Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran Shiraz Univ Sch Elect & Comp Engn Dept Commun & Elect Shiraz *** Iran

Tag collision is a pressing issue in radio frequency identification systems which significantly lowers the system performance if not mitigated carefully. This paper presents the Monte-Carlo query tree Search (MCQTS) method as a novel and fast anti-collision algorithm. This method combines the capabilities of the conventional Monte-Carlo tree Search and query tree by applying a few heuristics on the tree traversal to raise the chance of facing the most promising states. The collision mitigation based on the MCQTS is presented and its performance in terms of time, and space (memory) complexity is analytically verified. Simulations are performed, and the effects of tree size, number of tags, and tag ID length on the performance of the proposed method are investigated. The results are compared to the previously presented tree-based algorithms, and it is shown that for typical tag lengths, the MCQTS method performs between 3.89% and 62.06% (in average) faster than the conventional methods for multi-tag identification.

关键词： Anti-collision Monte Carlo tree search RFID Tag identification query tree

来源：评论

学校读者我要写书评

暂无评论

A Novel query tree Anti-collision Algorithm for RFID

引用

APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL 2019年第3期34卷 490-496页

作者： Yang, Fan Zhao, Lei Chen, Hu Hao, Shuixia Jiangsu Normal Univ Jiangsu Key Lab Educ Big Data Sci & Engn Xuzhou 221116 Jiangsu Peoples R China Nanjing Agr Univ Coll Engn Nanjing 210031 Jiangsu Peoples R China China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Jiangsu Peoples R China

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using query tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by using tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.

关键词： Anti-collision algorithm data clipping query tree RFID

来源：评论

学校读者我要写书评

暂无评论

An Effective 16-bit Random Number Aided query tree Algorithm for RFID Tag Anti-Collision

引用

IEEE COMMUNICATIONS LETTERS 2011年第5期15卷 539-541页

作者： Yang, Ching-Nung He, Jyun-Yan Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan

A tag-collision problem (or missed reads) in RFID system is the event that a reader cannot identify the tag if many tags respond to a reader at the same time. Recently, Choi et al. proposed a 16-bit random number query tree algorithm (RN16QTA) for RFID tag anti-collision by using a RN16 as the tags temporary ID. RN16QTA successfully reduce the time consumption for tag identification than the present identification implemented in EPC Class 1 Gen. 2. However, simulation results and the theoretical estimation imply that the length of RN16 is actually not enough in real environments to successfully identify tags. In this letter, we propose an effective RN16QTA (ERN16QTA) to really solve the tag collision in tags identification. Moreover, our new algorithm saves the responded bits.

关键词： RFID tag collision query tree

来源：评论

学校读者我要写书评

暂无评论

Heuristic query tree Protocol: Use of Known Tags for RFID Tag Anti-Collision (vol E95B, pg 603, 2012)

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第4期E95B卷 1485-1485页

作者： Sung, Jongwoo Kim, Daeyoung Kim, Taehong Choi, Jinhyuk KAIST

Existing query tree protocols deal with RFID tags in a blind manner. They query tags in a fixed bit order based on the assumption that the tag ID numbers are uniformly distributed throughout the range of the entire ID space because readers have no prior knowledge of the tags. This paper attempts to distinguish RFID applications where readers are already aware of all tags used by the application. We propose a heuristic query tree (H-QT) protocol that uses heuristic to select effective bits from known tags for the best queries in a divide and conquer approach. The performance evaluation shows that the proposed protocol is superior to original query tree protocols because it significantly reduces the number of tag collisions and no tag response.

关键词： RFID anti-collision query tree heuristic divide and conquer

来源：评论

学校读者我要写书评

暂无评论

A RFID anti-collision approach for efficient query tree

引用

INTERNATIONAL JOURNAL OF RF TECHNOLOGIES-RESEARCH AND APPLICATIONS 2023年第1期13卷 21-36页

作者： Li, Gang Wang, Jingfang Hunan Int Econ Univ Changsha Peoples R China

In the radio frequency identification technology system, there are too many time slots which are caused by tag collision, and the communication complexity is high. On the basis of the anti-collision algorithm of the binary tree and the quadtree query tree, the methods of locking the collision bit and predicting the child node are used, a newlock-bit hybrid querytree (novel lock-bit hybrid query tree, NLHQT) algorithm is proposed. In the algorithm, the collision bit information is extracted through the lock instruction, and the extracted collision bit information is predicted. While reducing the collision time slot, the reader generates a new query prefix through prediction, thereby avoiding the generation of idle child nodes. Compared with the improved hybrid query tree (IHQT) anti-collision algorithm and the regression lock adaptive multi-tree search (RLAMS), the algorithm in this paper is more effective in reducing the total number of time slots and communication complexity, and the efficiency of identifying tags can be effectively improved.

关键词： Radio frequency identification (RFID) anti-collision algorithm query tree lock position prediction instruction

来源：评论

学校读者我要写书评

暂无评论

Rule-based query tree evaluation over fragmented XML documents

Rule-based query tree evaluation over fragmented XML documen...

引用

2nd International Conference on Web Information Systems and Technologies

作者： McFadyen, Ron G. Chen, Yangjun Univ Winnipeg Dept Appl Comp Sci 515 Portage Ave Winnipeg MB R3B 2E9 Canada

ISBN: (纸本)9728865465

XML documents are used to hold information and to make exchanges between systems. In this paper, we consider documents that embed knowledge and rules, which may contain considerable redundancy. To control redundancy and to provide for efficient execution of queries, documents are decomposed into fragments that are stored separately. Then, to materialize documents for end-users, they need to be dynamically constructed from their sources (separately stored fragments) by evaluating rules, which requires database queries to be executed according to the document structure.

关键词： XML business rule query tree query evaluation document fragmentation and assembly

来源：评论

学校读者我要写书评

暂无评论

A Novel query tree Protocol Based on Partial Responses for RFID Tag Anti-Collision

A Novel Query Tree Protocol Based on Partial Responses for R...

引用

19th IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yeh, Ming-Kuei Jiang, Jehn-Ruey Natl Taipei Coll Business Dept Informat Management Taipei Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Jhongli Taiwan

ISBN: (纸本)9781479920815

In the RFID system, when two or more tags respond their IDs to the reader simultaneously, wireless signal collision occurs and no tag can be identified successfully by the reader. How to reduce such collisions in order to speed up the identification performance is thus important. There are many anti-collision protocols proposed to solve the tag collision problem. They can be categorized into two classes: ALOHA-based and tree-based protocols. The query tree (QT) protocol is a famous tree-based protocol having many advantages. It is stateless and uses no on-tag memory to keep protocol states;it is a plain protocol and uses no special techniques, such as bit-tracking, ID-revising, and re-identification. In this paper, we propose a stateless and plain tree based anti-collision protocol, called PRQT, by using tag ID partial responses to speed up tag identification. We also conduct simulation experiments for PRQT and compare it with QT in terms of the number of iterations to identify tags. As we will show, the PRQT protocol uses less numbers of iterations to identify tags than the QT protocol.

关键词： RFID anti-collision query tree tag identification

来源：评论

学校读者我要写书评

暂无评论

A Low Complexity Anti-collision Algorithm for RFID Using query tree

A Low Complexity Anti-collision Algorithm for RFID Using Que...

引用

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)

作者： Yang, Fan Yang, Yong Chen, Hu Ren, Shougang Zhao, Lei Jiangsu Noimal Univ Sch Math & Stat Jiangsu Key Lab Educ Big Data Sci & Engn Xuzhou 221116 Jiangsu Peoples R China China Univ Min Technol Sch Comp Sci & Technol Xuzhou 22116 Jiangsu Peoples R China Nanjing Agr Univ Coll Informat Sci & Technol Nanjing 210095 Jiangsu Peoples R China

ISBN: (纸本)9781538664230

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using query tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.

关键词： RFID Anti-collision algorithm query tree Data Clipping

来源：评论

学校读者我要写书评

暂无评论

A query tree anti-collision algorithm based on multi-dimensional group mappin 35

A query tree anti-collision algorithm based on multi-dimensi...

引用

35th Youth Academic Annual Conference of Chinese-Association-of-Automation (YAC)

作者： Shen, Jinwei Xie, Shiyi Huang, Yuqin Zhang, Ping Zhao, Yi Guangdong Ocean Univ Coll Math & Comp Sci Zhanjiang Peoples R China Ctr South China Sea Southern Marine Sci & Engn Guangdong Lab Marine Resources Big Data Zhanjiang Peoples R China Guangdong Med Univ Clin Med Coll 1 Zhanjiang Peoples R China

ISBN: (纸本)9781728176840

To solve the problem of high space overhead and high deployment cost, a multi-dimensional block map query tree anti-collision algorithm is proposed. In this algorithm, the tag ID grouping dimension is added, and the tag ID is processed with the new mapping rules. The mapping result does not increase the encoding length. It not only speeds up the collision processing speed but also adds no additional communication data. Simulation results show that compared with the traditional QT algorithm, the A4PQT algorithm, and the GBAQT algorithm, the MDGQT algorithm has higher traffic and throughput, and the total number of time slots does not increase significantly under the same environment. The performance of the GBAQT algorithm is better than other algorithms in the case of a large number of tags.

关键词： RFID Tag anti-collision query tree Double grouping Map mechanism

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：