摘要
多标签防碰撞系统为了提高识别效率也会使通信复杂度更高,不利于提升系统信息传递的效率。针对防碰撞系统中识别效率与通信复杂度之间的矛盾关系,提出一种基于标签预测的分组映射查询树防碰撞算法。首先使用标签预测算法对阅读范围内的标签数量进行预测,根据预测结果使用不同的查询前缀,标签据此返回不同的信息;在此基础上根据标签ID特性对其进行分组并设计了映射码机制,阅读器根据映射规律反推出碰撞信息得到查询码进行查询识别。仿真结果表明,与QT算法、A4PQT、GBAQT以及DGMQT算法相比,所提算法能够有效减少识别总时隙数,在提高系统效率的同时大大降低了通信复杂度。
In order to improve the identification efficiency,the multi-tag anti-collision system will also make the communication more complex,which is not conducive to improving the efficiency of system information transmission.Aiming at the contradiction relationship between recognition efficiency and communication complexity in anti-collision system,a group mapping query tree anti-collision algorithm based on label prediction is proposed.Firstly,this paper uses the tag prediction algorithm to predict the number of tags in the reading range.According to the prediction results,different query prefixes are used,and the labels return different information accordingly.On this basis,the tag ID is grouped according to its characteristics and a mapping code mechanism is designed.The reader reversely deduces the collision information according to the mapping law to obtain the query code for query and identification.The simulation results show that compared with QT algorithm,A4PQT,GBAQT and DGMQT algorithm,the proposed algorithm can effectively reduce the total numbers of identification time slots,improve the system efficiency and greatly reduce the communication complexity.
作者
董轩江
DONG Xuanjiang(College of Big Data,Qingdao Huanghai University,Qingdao 266427,China)
出处
《现代信息科技》
2023年第14期66-70,共5页
Modern Information Technology
