基于标签分组和码分多址的帧时隙ALOHA算法

摘要

针对经典ALOHA算法识别效果差的缺点,提出了一种基于标签分组和码分多址的帧时隙ALOHA (G-CD-FSA)算法.该算法先对大量标签进行合理分组,控制标签响应的数量,再利用帧时隙ALOHA算法对标签进行识别,最后利用码分多址技术对碰撞时隙中的标签进行区分.在分组过程中,提出了以吞吐率为标准的分组准则.仿真实验中将该算法与已有ALOHA算法及其改进算法作比较,结果表明,该算法吞吐率高、识别相同数量的标签所需总时隙数量和碰撞时隙数量少,具有一定的实际应用价值.%In view of the shortcomings of the classical ALOHA algorithm poor recognition,a novel anti-collision algorithm is proposed,which is called the frame slotted ALOHA algorithm based on tag grouping and code division multiple access. In this algorithm,alarge number of tags are grouped in a reasonable way to control the number of responding tags,and then frame slotted ALOHA algorithm is used to identify tags. Finally,code division multiple access (CDMA)technique is applied to identify the tags which are in the collision slot. In the process of grouping,the grouping principle based on throughput rate is put forward. The proposed algorithm is compared with the existing ALOHA algorithm and its improved algorithm in simulation experiment. The results show that the proposed algorithm has high throughput;and the number of total slots and the number of collision slots are small when identifying the same number of tags. It has certain practical application value.