基于Whittle索引的RFID多阅读器信道资源分配算法  

RFID Multi-reader Channel Resources Allocation Algorithm Based on Whittle Index

作　　者：石静 郑嘉利[1,2] 袁源 王哲 李丽 SHI Jing;ZHENG Jia-li;YUAN Yuan;WANG Zhe;LI Li(School of Computer,Electronics and Information,Guangxi University,Nanning 530004,China;Guangxi Key Laboratory of Multimedia Communications and Network Technology,Nanning 530004,China)

机构地区：[1]广西大学计算机与电子信息学院,南宁530004 [2]广西多媒体通信与网络技术重点实验室,南宁530004

出　　处：《计算机科学》2019年第10期122-127,共6页Computer Science

基　　金：国家自然科学基金项目(61761004)资助

摘　　要：针对无线射频识别(RFID)系统中多标签-多阅读器环境下标签与信道资源的分配问题,提出了一种基于Whittle索引的多阅读器信道资源分配算法。在RFID多阅读器信道分配问题中建立无休止多臂赌博机(RMAB)模型,并采用Whittle索引算法进行求解。该算法依据信道前期的忙、闲状态,将信道空闲概率作为信任值赋予每个信道,并根据信道当前的信任值计算其Whittle索引值。标签选择索引值最大的信道作为可能感知接入的信道,随后根据每个时隙数据发送成功与否来动态更新信道信任值。对信道分配过程中可能出现的标签碰撞问题,采用等待一个时隙后再根据识别反馈信息重新选择接入信道的方式来解决。将文中所提算法从两个方面与典型的DiCa算法和Gentle算法进行比较:一是在阅读器数量固定的前提下,其系统吞吐量随待识别标签数量的变化情况;二是在待识别标签数量固定的前提下,其系统吞吐量随阅读器数量的变化情况。仿真结果表明,所提算法在上述两种情况下的系统吞吐量均优于DiCa算法和Gentle算法,其吞吐量在阅读器数量固定的前提下分别平均提高了150.34%和23.98%,在待识别标签数量固定的前提下分别平均提高了205.01%和43.37%。随着阅读器和待识别标签数量的增多,所提算法在系统吞吐量方面的优势更加明显。因此,采用提出的算法可以对有限的信道资源进行合理的动态分配,有效提高RFID多阅读器系统的识别效率。This paper proposed amulti-reader channel resources allocation algorithm based on Whittle index for the problem that how to allocate the correspondence between tags and channel resources in the environment of Radio Frequency Identification (RFID) system with multi-tag and multi-reader.The Restless Multi-Armed Bandit (RMAB) mo- del is established and the Whittle index algorithm is adopted to solve the problem of RFID multi-reader channels allocation.According to the previous state of channels:idle or busy,the readers achieve one trust value for every channel based on its idle probability and use the current trust value to calculate the Whittle index for each channel.The tags choose the one with the largest index value as a possible sensing and accessing channel.Then,the trust value of the channels is dynamically updated based on the successful or failing data transmission in each time slot.For the collisions that may occur between tags during channel allocation,the method of reselecting and accessing based on the identified feedback information after waiting for one time slot can solve it.The proposed algorithm is compared with the typical DiCa algorithm and Gentle algorithm in the following two aspects.Firstly,the system throughput varies with the number of tags to be identified under the premise that the number of readers is fixed.Secondly,the system throughput varies with the number of readers to be identified under the premise that the number of tags is fixed.The simulation results show that the system throughput of the proposed algorithm is superior to DiCa algorithm and Gentle algorithm in both cases.The throughput increases by an average of 150.34% and 23.98% respectively on the premise of fixed number of readers,205.01% and 43.37% respectively on the premise of fixed number of tags to be identified.Moreover,with the increase of the number of readers and tags to be identified,the advantages of the proposed algorithm in terms of system throughput are more obvious.Therefore,the proposed algorithm can be used

关 键 词：无线射频识别 多标签-多阅读器 无休止多臂赌博机模型 Whittle索引算法 

分 类 号：TN92.TN391[电子电信—通信与信息系统] TN391[电子电信—信息与通信工程]