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

Wireless Power Supply Sensing Tags Based on anti-collision algorithm for Sensing Systems

IEEE ACCESS 2024年 12卷 32381-32394页

作者： Pi, Daneng Hubei Normal Univ Sch Elect Engn & Automat Huangshi 435002 Peoples R China

In wireless sensor networks, sensing tags are battery powered, which also limits the battery life. Therefore, it is particularly important to study self powered sensing tags. At present, passive wireless identification systems can achieve self powered communication through tags. However, wireless power supply sensing systems have problems such as low efficiency and short communication distance. To reduce the power consumption of sensing tags and improve the efficiency of sensing systems, a passive wireless low-power hydrogen concentration sensing system is designed. To further reduce the power consumption of sensing tags, a passive wireless magnetic field intensity sensing system is developed. In addition, to solve the low efficiency of multiple sensing labels in wireless power supply sensing systems, an efficient anti-collision algorithm based on dynamic binary query trees is designed. According to the research results, in the cold start indoor environment, the energy collection rate of the sensing tag designed in the research was 0.081mJ/s, and the energy collection efficiency was 25.7%. In single/dual sensor mode, the maximum values of sensing error were 2.1% and 5.2%, respectively. The maximum recognition time of the anti-collision algorithm based on dynamic multi base query tree was 2.78s, and the minimum value was 1.31s. The research results can provide methodological and technical support for the improvement of wireless power supply sensing systems, expanding the application range of wireless power supply sensing systems.

关键词： Sensors Wireless sensor networks Wireless communication Heuristic algorithms Power demand Hydrogen Radiofrequency identification Battery management systems anti-collision algorithm sensing wireless passive tag

来源：评论

学校读者我要写书评

暂无评论

A Fast anti-collision algorithm for RFID Tag Identification 6

A Fast Anti-Collision Algorithm for RFID Tag Identification

引用

6th IEEE Advanced Information Technology, Electronic and Automation Control Conference (IEEE IAEAC)

作者： Zheng, Kai Zhang, KaiTing Xia, LiXia Wang, Xin Chen, YouQun Wang, Hui Huaiyin Normal Univ Sch Phys & Elect Elect Engn Huaian 223003 Jiangsu Peoples R China

ISBN: (数字)9781665458641

ISBN: (纸本)9781665458641

This paper proposes a fast tag anti-collision algorithm called the Improved collision Tree algorithm (ICT). ICT is an improved technique based on collision Tree algorithm (CD, it inherits the essence of CT that both the generating of prefixes and the splitting of tag group are according to the first collided bit. Furthermore, for fast tag identification, ICT uses a pointer and a counter in each tag to memorize the query history of the reader, thus the reader does not need to transmit the whole query preftx. The simulation results show that ICT outperforms CT in scenarios where tag IDs have some common prefix.

关键词： collision tree anti-collision algorithm radio frequency identification tag identification

来源：评论

学校读者我要写书评

暂无评论

Research on hybrid of ALOHA and multi-fork tree anti-collision algorithm for RFID 10

Research on hybrid of ALOHA and multi-fork tree Anti-collisi...

引用

10th Annual International Conference of Information and Communication Technology (ICICT)

作者： Zhou, Weihui Jiang, Niande East China Univ Technol Yangtze River Coll Fuzhou 344000 Peoples R China East China Univ Technol Nanchang 330013 Peoples R China

The work aims at the problem of multi-tag collision in RFID system, then analysis the binary tree algorithm and ALOHA and points out their shortcomings, we proposed a Hybrid of ALOHA and Tree (HAMT) algorithm. The algorithm first uses the DFSA algorithm for tag identification, and dynamically selects the multi-fork tree algorithm for tag identification based on the number of unidentified tags secondly, thus ensuring that the tag is 100% identified, and improves recognition efficiency and shortens recognition time. The results of the simulation show that when the number of tags is about 1000, the recognition efficiency of the HAMT algorithm can reach around 0.72. So the HAMT algorithm can solve the multi-tag collision problem. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： RFID Multi-fork tree ALOHA tags anti-collision algorithm

来源：评论

学校读者我要写书评

暂无评论

CNCAA: A new anti-collision algorithm using both collided and non-collided parts of information

引用

COMPUTER NETWORKS 2020年 172卷 107159-107159页

作者： Abbasian, Amir Safkhani, Masoumeh Shahid Rajaee Teacher Training Univ Comp Engn Dept Tehran Iran

Nowadays, identification through radio frequency systems (RFID) has been employed in many applications such as supply chain management, banking, toll payment, theft prevention, E-health and so on. One of the main challenges in RFID systems is the tag's collision problem in collision slot. Up to now, to solve RFID tag's collision issue, many anti-collision algorithms have been proposed. However, most of them don't have high efficiency and are not able to identify tags in collision slot. In this paper, we propose a new anti-collision algorithm based on ALOHA called CNCAA which uses both collided and non-collided parts of information in collision slots for tag's identification. To the best of our knowledge, all of the anti-collision algorithms until now either use the collided part of information or the non-collided part of information in collision slot. Based on our simulation results, the system efficiency of the proposed algorithm has a significant difference compared to other anti-collision algorithms and improves it. The system efficiency of the CNCAA is 1.04 at best when the frame length is half of the number of tags which has improved by at least 20% compared to existing anti-collision algorithms.

关键词： CNCAA RFID anti-collision algorithm Collided Information Non-collided System Efficiency

来源：评论

学校读者我要写书评

暂无评论

Research on hybrid of ALOHA and multi-fork tree anti-collision algorithm for RFID

引用

Procedia Computer Science 2021年 183卷 389-394页

作者： Weihui Zhou Niande Jiang East China University of Technology Yangtze River College Fuzhou 344000 China East China University of Technology Nangchang 330013 China

关键词： RFID Multi-fork tree ALOHA tags anti-collision algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Fast and Universal RFID Tag anti-collision algorithm for the Internet of Things

引用

IEEE ACCESS 2019年 7卷 92365-92377页

作者： Zhang, Guofeng Tao, Sha Xia, Wan'ang Cai, Qiang Gao, Wanlin Jia, Jingdun Wen, Juan China Agr Univ Coll Informat & Elect Engn Beijing 100083 Peoples R China China Agr Univ Key Lab Agr Informatizat Standardizat Minist Agr & Rural Affairs Beijing 100083 Peoples R China Chinese Acad Sci Inst Semicond Beijing 100083 Peoples R China Univ Chinese Acad Sci Ctr Mat Sci & Optoelect Engn Beijing 100049 Peoples R China Univ Chinese Acad Sci Sch Microelect Beijing 100049 Peoples R China Beijing Technol & Business Univ Beijing Key Lab Big Data Technol Food Safety Beijing 100048 Peoples R China

To address the problems of high computational complexity, inflexible frame length adjustment, and sub-optimal system efficiency of the RFID tag anti-collision algorithms in the Internet-of-Things systems, a low-complexity, and universal fast RFID tag anti-collision algorithm is proposed in this paper. A faster and less-complex tag number estimation method depends less on computing and storage resources, making it easier to integrate into the Internet of Things. Using the concepts of sub-frame and system efficiency priority, after each sub-frame is identified, the number of tags is estimated quickly and the frame length is adjusted dynamically to ensure the algorithm's efficiency. Moreover, the proposed algorithm is fully compatible with the EPC Class-1 Generation-2 standard, which ensures its universality and compatibility with the existing systems. The simulation results show that the proposed algorithm can achieve a system efficiency of 0.3554, a time efficiency of 0.7851, and an identification speed of 433 n/s. Compared with the standard Q algorithm, the performance is improved by 9.691%, 5.002%, and 8.250%, respectively. It is, hence, demonstrated that the proposed algorithm meets the requirements for the rapid identification of the RFID tags in the Internet-of-Things applications.

关键词： anti-collision algorithm Internet of Things low cost RFID tag system efficiency priority

来源：评论

学校读者我要写书评

暂无评论

An improved RFID anti-collision algorithm and its application in food tracking 14

An improved RFID anti-collision algorithm and its applicatio...

引用

14th International Conference on Computer Science and Education (ICCSE)

作者： Lu, Jinsheng Yang, Lvqing Qiu, Yishu Li, Dingzhao Xiamen Univ Sch Software Xiamen 361005 Peoples R China

ISBN: (纸本)9781728118468

Food safety issues are frequent in today's society, and how to accurately and accurately track food is an urgent problem to be solved. In the information age of the Internet of Things (IOT), the "connected objects" feature allows food to provide detailed information from the production to the sales process, tracking the processing flow of each link, and when the food quality and safety issues arise, it can be accurate. Quickly find the source of food and related product flows, effectively prevent problem foods from entering the market, and let consumers eat safe food. This thesis mainly studies the multi-tag recognition collision avoidance in the Internet of Things technology, and improves the multi-fork tree anti-collision algorithm. By introducing the slot idea in the ALOHA algorithm, a dual-slot dynamic search algorithm (GMT) is proposed. Simulation experiments show that the algorithm effectively reduces the time spent on RFID tags recognition, reduces the number of collisions of tags, and reduces the energy consumption of the system. It is an effective anti-collision algorithm.

关键词： RFID IOT Food tracking system anti-collision algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on data fusion algorithm and anti-collision algorithm based on internet of things

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 85卷 107-115页

作者： Cui, Yongfeng Ma, Yuankun Zhao, Zhongyuan Li, Ya Liu, Wei Shu, Wanneng Zhoukou Normal Univ Sch Sci & Technol Zhoukou 466001 Henan Peoples R China South Cent Univ Nationalities Coll Comp Sci Wuhan 430074 Hubei Peoples R China

Internet of Things is involved in all aspects of human life, work, health and social areas, which will have a significant impact on the future development of the global economic society. Perception and recognition technology is the basis of the Internet of things, and data fusion and anti-collision technology are the sensor network and radio frequency identification research focus. This paper focuses on the key technology of the sensing layer of the internet of things, that is, the data fusion of the sensor network and the multi-label anti-collision technology of the radio frequency identification system, which mainly includes the following work. This paper introduces the hierarchical architecture of the Internet of things and its key technologies, and introduces the sensing and recognition technology of the internet of things, and expatiates the data fusion model and routing algorithm of the sensor network and the working principle and anti-collision problem of the RFID system. The improved clustering routing protocol Leach based on distributed data fusion effectively prolongs the lifetime of the sensor network. A data fusion algorithm based on Gauss membership function has introduced, and the fusion technology and routing technology have combined to process the data, which improves the efficiency and accuracy of data acquisition in Sensor Networks. An efficient binary search anti-collision algorithm called AEBS, with unknown tag number estimation, which has proposed to recognize unknown tags in the range of reader's function. Theoretical analysis and experimental simulation results show that the AEBS algorithm improves the efficiency and stability of the system identification and reduces the recognition time of the whole system. (C) 2018 Elsevier B.V. All rights reserved.

关键词： anti-collision algorithm Data fusion Internet of things RFID system Sensor network

来源：评论

学校读者我要写书评

暂无评论

A Novel anti-collision algorithm in RFID for Internet of Things

引用

IEEE ACCESS 2018年 6卷 45860-45874页

作者： Bai Zhi Wang Sainan He Yigang Hunan Inst Technol Xiangtan 411101 Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China

This paper studies a novel anti-collision algorithm that is proposed in view of the problem, i.e., label reading collision in radio-frequency identification for Internet of Things. Based on the theoretical foundation of label grouping, the algorithm introduces the Mahalanobis distance and density function to traditional fuzzy C-means clustering grouping algorithm by using EPC code and effectively solves the problem of isolated points of clustering and the optimization problem of initial clustering center. Then, the algorithm realizes effective grouping of labels and distributing identification serial numbers to labels upon the distance from interior labels to the center of clustering. Meanwhile, the efficiency of algorithm can be improved through dynamically setting the frame slot time of readers upon the grouping condition to prevent collision. This paper analyzes the throughput rate theoretically in detail. The simulation results of throughput capacity, throughout rate, and slot efficiency of the algorithm manifest that the algorithm is superior to the most commonly used dynamic binary-tree algorithm and current dynamic ALOHA algorithm in performance.

关键词： Radio frequency identification sensors system Internet of Things (IOT) anti-collision algorithm tag grouping Mahalanobis distance density function

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：