Computer Science ›› 2019, Vol. 46 ›› Issue (10): 122-127.doi: 10.11896/jsjkx.180801602

• Network & Communication • Previous Articles     Next Articles

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

SHI Jing, ZHENG Jia-li, YUAN Yuan, WANG Zhe, LI Li   

  1. (School of Computer,Electronics and Information,Guangxi University,Nanning 530004,China)
    (Guangxi Key Laboratory of Multimedia Communications and Network Technology,Nanning 530004,China)
  • Received:2018-08-30 Revised:2019-02-02 Online:2019-10-15 Published:2019-10-21

Abstract: 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 throughputvaries 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 to reasonably allocate the limited channel resources,thus effectively improving the recognition efficiency of the RFID multi-reader system.

Key words: Multi-tag and multi-reader, Radio frequency identification, Restless multi-armed bandit model, Whittle index algorithm

CLC Number: 

  • TN92
[1]RAJARAMAN V.Radio frequency identification[J].Re-sonance,2017,22(6):549-575.
[2]YU Y,YU X,ZHAO Z,et al.Image Analysis System for Optimal Geometric Distribution of RFID Tags Based on Flood Fill and DLT[J].IEEE Transactions on Instrumentation and Mea-surement,2018,67(4):839-848.
[3]DU J,SUGUMARAN V,GAO B.RFID and Multi-Agent Based Architecture for Information Sharing in Prefabricated Component Supply Chain[J].IEEE Access,2017,5:4132-4139.
[4]REZAIE H,GOLSORKHTABARAMIRI M.A fair reader collision avoidance protocol for RFID dense reader environments[J].Wireless Networks,2018,24(6):1953-1964.
[5]CHEN H,WANG Z,XIA F,et al.Efficiently and Completely Identifying Missing Key Tags for Anonymous RFID Systems[J].IEEE Internet of Things Journal,2018,5(4):2915-2926.
[6]NAFAR F,SHAMSI H.Design and Implementation of an RFID-GSM based Vehicle Identification System on Highways[J].IEEE Sensors Journal,2018,18(17):7281-7293.
[7]ZHANG Y,YANG F,WANG Q,et al.An anti-collision algorithm for RFID-based robots based on dynamic grouping binary trees[J].Computers & Electrical Engineering,2017,63:91-98.
[8]ZHOU S K,DENG M L.Survey on ALOHA tag anti-collision algorithm[J].Computer Engineering and Applications,2017,53(14):9-17.(in Chinese)
[9]WANG C H,LIU C S,XU H,et al.An enhanced binary tree-based anti-collision algorithm[J].Journal of Hunan University(Natural Sciences),2013,40(8):97-101.(in Chinese)
[10]GOLSORKHTABARAMIRI M,ISSAZADEHKOJIDI N.A Distance Based RFID Reader Collision Avoidance Protocol for Dense Reader Environments[J].Wireless Personal Communications,2017,95(2):1781-1798.
[11]YANG X M,DU L,WANG J H,et al.Improved RFID anti-collision algorithm based on identity competition and cooperation[J].Journal of University of Electronic Science and Technology of China,2015,44(5):764-768.(in Chinese)
[12]SAFA H,EL-HAJJ W,MEGUERDITCHIAN C.A distributed multi-channel reader anti-collision algorithm for RFID environments[J].Computer Communications,2015,64(1):44-56.
[13]SOHN S,JUNG J J.Channel and time slot allocation for dense RFID networks[J].Wireless Personal Communications,2013,73(2):329-339.
[14]ZHU J,HAN C,YANG H L,et al.Dynamic spectrum access mechanism of multi-users based on restless multi-armed bandit model in cognitive networks[J].Journal of Computer Applications,2014,34(10):2782-2786.(in Chinese)
[15]REVERDY P,SRIVASTAVA V,LEONARD N E.Satisficing in multi-armed bandit problems[J].IEEE Transactions on Automatic Control,2015,62(8):3788-3803.
[16]HE X,YANG X S,KARAMANOGLU M,et al.Global convergence analysis of the flower pollination algorithm:a discrete-time Markov chain approach[J].Procedia Computer Science,2017,108:1354-1363.
[17]BORKAR V S.Whittle index for partially observed binary Markov decision processes[J].IEEE Transactions on Auto-matic Control,2017,62(12):6614-6618.
[18]MOSHREF M.Improved Anti-Collision Algorithm for Tag Identification in Future Internet of Things[J].International Journal of Computer Network and Information Security,2017,9(3):11.
[1] LIU Jia-chen, QIN Xiao-lin, ZHU Run-ze. Prediction of RFID Mobile Object Location Based on LSTM-Attention [J]. Computer Science, 2021, 48(3): 188-195.
[2] YUAN Yuan, ZHENG Jia-li, SHI Jing, WANG Zhe, LI Li. Anti-collision Algorithm Based on Q-learning for RFID Multiple Readers [J]. Computer Science, 2019, 46(6): 124-127.
[3] WANG Zhe, ZHENG Jia-li, LI Li, YUAN Yuan, SHI Jing. RFID Indoor Positioning Algorithm Combining Grasshopper Optimization Algorithm and Extreme Learning Machine [J]. Computer Science, 2019, 46(12): 120-125.
[4] GAN Yong, WANG Kai, HE Lei. New Ownership Transfer Protocol of RFID Tag [J]. Computer Science, 2018, 45(11A): 369-372.
[5] GUAN Yang, YAN Guo-yu, WANG Ying and JIANG Sui-ping. Data Filtration Method for RFID Based Indoor RTLS [J]. Computer Science, 2017, 44(Z11): 293-296.
[6] HUANG Qi and LING Jie. Ultra-lightweight Mutual Authentication Protocol for Mobile Radio Frequency Identification [J]. Computer Science, 2017, 44(7): 111-115.
[7] ZHANG Ya-li, GUO Ya-jun, CUI Jian-qun and ZENG Qing-jang. New Ultra-lightweight RFID Authentication Protocol [J]. Computer Science, 2017, 44(1): 183-187.
[8] HOU Li-hong and LI Wei-dong. Internet of Things Technology in Application of ETC System [J]. Computer Science, 2015, 42(Z11): 532-535.
[9] MENG Fan-zhen,WU Jie,BU Xu-song and FENG Feng. Underground Target Track Prediction Algorithm Based on Markov Chain Model [J]. Computer Science, 2014, 41(Z6): 321-323.
[10] YANG Chao,ZHANG Hong-qi and QING Meng-yu. Security RFID Authentication Scheme in Supply Chains [J]. Computer Science, 2014, 41(4): 134-138.
[11] CAO Zheng,YANG Lin and XIE Hui. Design and Analysis of Secure Anti-collision Search Protocol for RFID [J]. Computer Science, 2014, 41(4): 116-119.
[12] XU Xue-song,XU Jia,GUO Li-wei,ZHANG Hong and ZHOU Jin-hai. Algorithm for Choosing Optimal Uncertain Data of Complete Data Streams [J]. Computer Science, 2013, 40(7): 182-186.
[13] . Improved Design and Implementation of Adaptive Binary Searching Anti-collision Algorithm [J]. Computer Science, 2012, 39(Z11): 135-138.
[14] . Identification and Positioning Method for VANET [J]. Computer Science, 2012, 39(Z11): 131-134.
[15] . Improved Binary Anti-collision Algorithm for Internet of Things [J]. Computer Science, 2012, 39(9): 24-27.
Full text



No Suggested Reading articles found!