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

A pair-resolution blocking algorithm on adaptive binary splitting for RFID tag identification

IEEE COMMUNICATIONS LETTERS 2008年第6期12卷 432-434页

作者： Lai, Yuan-Cheng Lin, Chih-Chung Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei Taiwan

For RFID tag identification, this research proposes a novel anti-collision method, the Pair-Resolution blocking algorithm (PRB). It inherits the essence of a previous algorithm, the Adaptive Binary Splitting algorithm (ABS), and thus uses the information of recognized tags obtained from the last process of tag identification. Furthermore, PRB adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags and utilizes a pair resolution technique which couples recognized tags to significantly reduce the identification delay. The analytical and simulation results show that PRB significantly outperforms ABS.

关键词： RFID tag identification anti-collision blocking algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid blocking algorithm for Identification of Overlapping Staying Tags Between Multiple Neighboring Readers in RFID Systems

引用

IEEE SENSORS JOURNAL 2015年第7期15卷 4076-4085页

作者： Hu, Yu-Min Chang, Iang-Chong Li, Jung-Shian Natl Cheng Kung Univ Inst Comp & Commun Engn Tainan 70101 Taiwan

Many algorithms have been proposed for avoiding tag collisions in radio-frequency identification (RFID) systems. However, most of these algorithms consider only a single reader in the current frame. Real-world Radio Frequency Identification systems typically contain multiple readers, and the interrogation zones of neighboring readers often overlap. This situation damages the performance of algorithms considering staying tags and each reader will ignore the overlapping staying tags due to counter states reset by other readers in the next frame. As a result, the efficiency of the tag identification process in the intersection region is seriously degraded. Accordingly, this paper analyzes the performance of three existing binary tree-based anticollision algorithms in detecting overlapping staying tags and then proposes a new hybrid blocking algorithm (HBA) to alleviate the overlapping staying tag problem. The simulation results show that the proposed HBA scheme provides a better identification performance than existing schemes, particularly, in dense RFID systems.

关键词： Anticollision RFID blocking algorithm overlapping staying tag hybrid blocking scheme

来源：评论

学校读者我要写书评

暂无评论

A semi-blocking algorithm on adaptive query splitting for RFID tag identification

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2013年第1期2013卷 1页

作者： Lai, Yuan-Cheng Lin, Chih-Chung Lee, Chiung-Hon Leon Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 106 Taiwan Nanhua Univ Ctr Teaching & Learning Dev Dalin Township 62249 Chiayi County Taiwan Nanhua Univ Dept Comp Sci & Informat Engn Dalin Township 62249 Chiayi County Taiwan

Radio frequency identification (RFID) is a promising wireless technology for using tiny, remotely powered chips as identifiers. The number of RFID applications is rapidly increasing because RFID technology is convenient, fast, and contactless. However, collisions occur when multiple tags simultaneously transmit their IDs. Therefore, an efficient anti-collision algorithm is needed to accelerate tag identification. In some applications, the reader may repeatedly identify staying tags, which constantly exist in the reader's range. The adaptive query splitting algorithm (AQS) was proposed for reserving information obtained from the last identification process to enable rapid re-identification of staying tags. However, since AQS is a non-blocking algorithm that allows newly arriving tags to use the slots reserved for staying tags, collisions among them are problematic. Thus, semi-blocking AQS (SBA) proposed in this study is designed to reduce the collisions between arriving tags and staying tags by applying a semi-blocking technique in which only a minority of arriving tags use the slots reserved for staying tags. By counting the number of minor arriving tags, SBA estimates the number of unrecognized arriving tags and generates proper queries to minimize their collisions. The identification delay of SBA is analyzed, and simulation results show that SBA significantly outperforms AQS.

关键词： RFID Anti-collision Tag identification blocking algorithm

来源：评论

学校读者我要写书评

暂无评论

Comparison of type I error for multiple test corrections in large single-nucleotide polymorphism studies using principal components versus haplotype blocking algorithms

引用

BMC GENETICS 2005年第Sup1期6卷 S78-S78页

作者： Nicodemus, KK Liu, WL Chase, GA Tsai, YY Fallin, MD Johns Hopkins Bloomberg Sch Publ Hlth Dept Epidemiol Baltimore MD 21218 USA Penn State Univ Coll Med Dept Hlth Evaluat Sci Hershey PA USA Natl Genome Res Inst Ctr Inherited Dis Res NIH Baltimore MD USA

Although permutation testing has been the gold standard for assessing significance levels in studies using multiple markers, it is time-consuming. A Bonferroni correction to the nominal p-value that uses the underlying pair-wise linkage disequilibrium (LD) structure among the markers to determine the number of effectively independent tests has recently been proposed. We propose using the number of independent LD blocks plus the number of independent single-nucleotide polymorphisms for correction. Using the Collaborative Study on the Genetics of Alcoholism LD data for chromosome 21, we simulated 1,000 replicates of parent-child trio data under the null hypothesis with two levels of LD: moderate and high. Assuming haplotype blocks were independent, we calculated the number of independent statistical tests using 3 haplotype blocking algorithms. We then compared the type I error rates using a principal components-based method, the three blocking methods, a traditional Bonferroni correction, and the unadjusted p-values obtained from FBAT. Under high LD conditions, the PC method and one of the blocking methods were slightly conservative, whereas the 2 other blocking methods exceeded the target type I error rate. Under conditions of moderate LD, we show that the blocking algorithm corrections are closest to the desired type I error, although still slightly conservative, with the principal components-based method being almost as conservative as the traditional Bonferroni correction.

关键词： Linkage Disequilibrium Linkage Disequilibrium Block blocking Method Principal Component Method blocking algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Time-Bound Collision Prevention Scheme for RFID Re-Entering Tags

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第6期12卷 1054-1064页

作者： Li, Jung-Shian Huo, Yu-Min Natl Cheng Kung Univ Inst Comp & Commun Engn Dept Elect Engn Tainan 70101 Taiwan

The efficiency of RFID applications is severely degraded when multiple tags transmit their IDs simultaneously. As a result, many anticollision algorithms have been proposed for reducing collisions at the reader. However, these algorithms focus only on the tags within communication range of the reader in the previous or current frames. That is, they ignore tags which move out of range of the reader in one frame, but then move back within range several frames later. As a result, the identification performance of the reader is seriously degraded. The present study analyzes the effect of re-entering tags on the performance of three common anticollision algorithms and proposes a new reblocking algorithm (RBA) to alleviate the problem. The lower and upper bounds of the collision probability for re-entering tags are derived using a multinomial coefficients approach. The performance evaluation results show that the proposed algorithm consumes fewer cycles and provides a more robust identification performance than existing blocking algorithms in real-world RFID systems characterized by re-entering tags.

关键词： Anticollision RFID blocking algorithm re-entering tag

来源：评论

学校读者我要写书评

暂无评论

An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

引用

COMPUTER COMMUNICATIONS 2013年第17-18期36卷 1754-1767页

作者： Lai, Yuan-Cheng Hsiao, Ling-Yen Lin, Bor-Shen Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei Taiwan

In many RFID applications, the reader repeatedly identifies the same staying,tags. Existing anti-collision protocols can rapidly identify the staying tags by remembering the order in which the tags were recognized in the previous identification process. This paper proposes a novel protocol, dynamic blocking adaptive binary splitting (DBA), based on the blocking mechanism, which prevents the newly-arriving tags from colliding with the staying tags. Moreover, DBA utilizes a dynamic condensation technique to reduce the number of idle slots produced when recognized tags leave. Following the condensation process, multiple staying tags may be required to share the same slot, and thus may cause collisions among them. Accordingly, an efficient ordering binary tree mechanism is proposed to split the collided tags deterministically according to the order in which they were recognized. The analytical and simulation results show that DBA consistently outperforms previous algorithms in all of the considered environments. (C) 2013 Elsevier B.V. All rights reserved.

关键词： RFID Anti-collision algorithm blocking algorithm Condensation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：