检索结果-南通市图书馆

An Improved Binary Search anti-collision Protocol for RFID Tag Identification

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第11期65卷 1855-1868页

作者： Guozhong Dong Weizhe Zhang Sichang Xuan Feng Qin Haowen Tan The Cyberspace Security Research Center Peng Cheng LaboratoryShenzhen518000China School of Computer Science and Technology Harbin Institute of TechnologyHarbin150001China Information Security Research Center Harbin Engineering UniversityHarbin150001China Wuhan Maritime Communication Research Institute Wuhan430205China Department of Computer Engineering Chosun UniversityGwangju61452Korea

Radio frequency identification(RFID)has been widespread used in massive items tagged ***,tag collision increases both time and energy consumption of RFID *** collision can seriously affect the success of tag *** efficient anti-collision protocol is very crucially in RFID *** this paper,an improved binary search anti-collision protocol namely BRTP is proposed to cope with the tag collision concern,which introduces a Bi-response *** Bi-response mechanism,two groups of tags allowed to reply to the reader in the same *** to Bi-response mechanism,the BRTP strengthens the tag identification of RFID network by reducing the total number of queries and exchanged messages between the reader and *** theoretical analysis and numerical results verify the effectiveness of the proposed BRTP in various performance metrics including the number of total slots,system efficiency,communication complexity and total identification *** BRTP is suitable to be applied in passive RFID systems.

关键词： RFID anti-collision binary search Bi-response mechanism

A New RFID anti-collision Algorithm Based on the Q-Ary Search Scheme

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第4期24卷 679-683页

作者： SU Jian WEN Guangjun HONG Danfeng School of Communication and Information Engineering University of Electronic Science and Technology of China College of Information Engineering Qingdao University

Deterministic tree-based algorithms are mostly used to guarantee that all the tags in the reader field are successfully identified, and to achieve the best performance. Through an analysis of the deficiencies of existing tree-based algorithms, a Q-ary search algorithm was proposed. The Q-ary search(QAS) algorithm introduced a bit encoding mechanism of tag ID by which the multibit collision arbitration was implemented. According to the encoding mechanism, the collision cycle was reduced. The theoretical analysis and simulation results showed that the proposed MS algorithm overcame the shortcoming of existing tree-based algorithms and exhibited good performance during identification.

关键词： Radio frequency identification(RFID) anti-collision Encoding Energy efficiency

A Physical Layer Algorithm for Estimation of Number of Tags in UHF RFID anti-collision Design

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2019年第7期61卷 399-408页

作者： Zhong Huang Jian Su Guangjun Wen Wenxian Zheng Chu Chu Yijun Zhang Yibo Zhang School of Information and Communication Engineering University of Electronic Science and Technology of ChinaChengdu611731China Nanjing University of Information Science&Technology Nanjing210044China Shenzhen Intellifusion Technologies Co. Shenzhen518000China School of Foreign Languages University of Electronic Science and Technology of ChinaChengdu611731China Department of Mechanical Engineering University of British ColumbiaVancouverCanada

A priori knowledge of the number of tags is crucial for anti-collision protocols in slotted UHF RFID *** number of tags is used to decide optimal frame length in dynamic frame slotted ALOHA(DFSA)and to adjust access probability in random access *** researches estimate the number of tags in MAC layer based on statistics of empty slots,collided slots and successful ***,a collision detection algorithm is employed to determine types of time *** three types are distinguished because of lack of ability to detect the number of tags in single time *** this paper,a physical layer algorithm is proposed to detect the number of tags in a collided *** shift algorithm is utilized,and some properties of backscatter signals are *** results verify the effectiveness of the proposed solution in terms of low estimation error with a high SNR range,outperforming the existing MAC layer approaches.

关键词： UHF RFID anti-collision cluster algorithm

A Dynamic Multi-ary Query Tree Protocol for Passive RFID anti-collision

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第9期72卷 4931-4944页

作者： Gang Li Haoyang Sun Zhenbing Li Peiqi Wu Daniele Inserra Jian Su Xiaochuan Fang Guangjun Wen Centre for RFIC and System School of Information and Communication EngineeringUniversity of Electronic Science and Technology of ChinaChengdu611731P.R.China Nanjing University of Information Science&Technology Nanjing210044China Queen Mary University of London LondonUnited Kingdom

In this paper,a dynamic multi-ary query tree(DMQT)anti-collision protocol for Radio Frequency Identification(RFID)systems is proposed for large scale passive RFID tag *** proposed DMQT protocol is based on an iterative process between the reader and tags which identifies the position of collision bits through map commands and dynamically encodes them to optimize slots allocation through query *** this way,the DMQT completely eliminates empty slots and greatly reduces collision slots,which in turn reduces the identification time and energy *** addition and differently to other known protocols,the DMQT does not need to estimate the number of tags,reducing the protocol implementation complexity and eliminating the uncertainty caused by the estimation algorithm.A numerical analysis shows that DMQT has better performance than other algorithms for a number of tags larger than ***,when the number of tags is 2000 and the tag identity(ID)length is 128 bits,the total identification time is 2.58 s and the average energy cost for a tag identification is 1.2 mJ,which are 16.9%and 10.4%less than those of state-of-the-art algorithms,*** addition,a DMQT extension based on ACK command has also been presented to deal with capture effect and avoid missing identification.

关键词： anti-collision DMQT RFID dynamic multi-ary query seamless identification

A Novel Time-aware Frame Adjustment Strategy for RFID anti-collision

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2018年第11期57卷 195-204页

作者： Haipeng Chen Kexiong Liu Chunyang Ma Yu Han Jian Su Department of Electrical Engineering Northeast Electric Power UniversityJilin132012China School of Technology Beijing Forestry UniversityBeijing100083China Department of Electro-Optics and Photonics University of DaytonDaytonOH 45469USA School of Information and Communication Engineering University of Electronic Science and TechnologyChengdu611731China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China

Recently,object identification with radio frequency identification(RFID)technology is becoming increasingly *** time is a key performance metric to evaluate the RFID *** present paper analyzes the deficiencies of the state-of-the-arts algorithms and proposes a novel sub-frame-based algorithm with adaptive frame breaking policy to lower the tag identification time for EPC global C1 Gen2 UHF RFID *** the observation of slot statistics in a sub-frame,the reader estimates the tag quantity and efficiently calculates an optimal frame size to fit the unread *** when the expected average identification time in the calculated frame size is less than that in the previous frame size,the reader starts the new ***,the estimation of the proposed algorithm is implemented by the look-up tables,which allows dramatically reduction in the computational *** results show noticeable throughput and time efficiency improvements of the proposed solution over the existing approaches.

关键词： Radio frequency identification anti-collision alpha time efficiency

Framed slotted ALOHA with grouping tactic and binary selection for anti-collision in RFID systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2009年第4期16卷 47-52页

作者： WANG Ya-qi JIANG Guo-ping WANG Jing Center for Control and Intelligence Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China

In radio frequency identification （RFID） systems, tag collision arbitration is a significant issue for fast tag identification. This article proposes a novel tag anti-collision algorithm called framed slotted ALOHA with grouping tactic and binary selection （GB-FSA）. The novelty of GB-FSA algorithm is that the reader uses binary tree algorithm to identify the tags according to the collided slot counters information. Furthermore, to save slots, tags are randomly divided into several groups based on the number of collided binary bits in the identification codes （IDs） of tags, and then only the number of the first group of tags is estimated. Performance analysis and simulation results show that the GB-FSA algorithm improves the identification efficiency by 9.9%-16.3% compared to other ALOHA-based tag anti-collision algorithms when the number of tags is 1000.

关键词： RFID anti-collision binary tree identification efficiency

Research on the adaptive hybrid search tree anti-collision algorithm in RFID system

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2016年第1期22卷 107-112页

作者：靳晓芳 Liu Mengxuan Shao Min Jin Libiao Huang Xianglin Information Engineering Communication University of China

Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) ***,so far decreases in communication time and increases in throughput are very *** order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search *** the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.

关键词： anti-collision adaptive binary-tree disassembly( ABD) hybrid search tree discrimination

Bi-slotted Binary Tree Algorithm with Stack for Radio Frequency Identification Tag anti-collision

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2013年第2期18卷 173-179页

作者：田芸陈恭亮李建华 School of Information Security Engineering Shanghai Jiaotong University Department of Electronic Engineering Shanghai Jiaotong University

A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the performance of binary tree algorithm (BTA). In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities (IDs) match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.

关键词： radio frequency identification (RFID) anti-collision binary tree tag identification

An Adaptive Tag anti-collision Protocol in RFID Wireless Systems

在线全文

学校读者我要写书评

暂无评论

China Communications 2014年第7期11卷 117-127页

作者： LIU Xiaohui QIAN Zhihong ZHAO Yanhang GUO Yuqi College of Communication Engineering Jilin University Changchun 130012China

A novel anti-collision algorithm in RFID wireless network is *** it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system *** strategy means that query strings will divide into two or four branches adaptively according to the label *** scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same *** theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.

关键词： RFID anti-collision collisiontree(CT) improved collision tree(ICT) ADstrategy.