A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process
Recently, RFID technology has come into end-user applications for monitoring, tracking, and so forth. In RFID system, a reader identifies a set of tags over a shared wireless channel. When multiple tags communicate with the same reader simultaneously, all packages will be lost and no tag can be reco...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/641327 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547277947797504 |
|---|---|
| author | Jian Yang Yonghua Wang Qingling Cai Yiju Zhan |
| author_facet | Jian Yang Yonghua Wang Qingling Cai Yiju Zhan |
| author_sort | Jian Yang |
| collection | DOAJ |
| description | Recently, RFID technology has come into end-user applications for monitoring, tracking, and so forth. In RFID system, a reader identifies a set of tags over a shared wireless channel. When multiple tags communicate with the same reader simultaneously, all packages will be lost and no tag can be recognized, which is known as tag collision. Tag collision is a significantly important issue for fast tag identification. We firstly make a thorough analysis among a variety of traditional RFID anticollision algorithms. Then a novel hybrid anticollision algorithm called T-GDFSA is proposed. Tags are assigned to different groups based on the initial tag estimation and then experience several dynamic read frames for identification. When a collision occurs in current slot, a tree-based recursive process will be deployed immediately. T-GDFSA combines the advantages of ALOHA-based and tree-based together and acquires higher system throughput by reducing unnecessary idle and collision slots and lower communication complexity by decreasing the data transmitted, which makes it identify tags faster with less power consumption. Simulations show that the theoretical values match well the simulation results. Moreover, T-GDFSA also has a good tolerance for the inaccuracy of initial tag estimation and the length variation of tag's ID. |
| format | Article |
| id | doaj-art-365c4aa70db5484bb2ce6bae35c23306 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2015-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-365c4aa70db5484bb2ce6bae35c233062025-02-03T06:45:25ZengWileyInternational Journal of Distributed Sensor Networks1550-14772015-08-011110.1155/2015/641327641327A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive ProcessJian Yang0Yonghua Wang1Qingling Cai2Yiju Zhan3 Faculty of Automation, Guangdong University of Technology, Guangzhou 510006, China Faculty of Automation, Guangdong University of Technology, Guangzhou 510006, China School of Engineering, Sun Yat-sen University, Guangzhou 510006, China School of Engineering, Sun Yat-sen University, Guangzhou 510006, ChinaRecently, RFID technology has come into end-user applications for monitoring, tracking, and so forth. In RFID system, a reader identifies a set of tags over a shared wireless channel. When multiple tags communicate with the same reader simultaneously, all packages will be lost and no tag can be recognized, which is known as tag collision. Tag collision is a significantly important issue for fast tag identification. We firstly make a thorough analysis among a variety of traditional RFID anticollision algorithms. Then a novel hybrid anticollision algorithm called T-GDFSA is proposed. Tags are assigned to different groups based on the initial tag estimation and then experience several dynamic read frames for identification. When a collision occurs in current slot, a tree-based recursive process will be deployed immediately. T-GDFSA combines the advantages of ALOHA-based and tree-based together and acquires higher system throughput by reducing unnecessary idle and collision slots and lower communication complexity by decreasing the data transmitted, which makes it identify tags faster with less power consumption. Simulations show that the theoretical values match well the simulation results. Moreover, T-GDFSA also has a good tolerance for the inaccuracy of initial tag estimation and the length variation of tag's ID.https://doi.org/10.1155/2015/641327 |
| spellingShingle | Jian Yang Yonghua Wang Qingling Cai Yiju Zhan A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process International Journal of Distributed Sensor Networks |
| title | A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process |
| title_full | A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process |
| title_fullStr | A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process |
| title_full_unstemmed | A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process |
| title_short | A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process |
| title_sort | novel hybrid anticollision algorithm for rfid system based on grouped dynamic framed recognition and binary tree recursive process |
| url | https://doi.org/10.1155/2015/641327 |
| work_keys_str_mv | AT jianyang anovelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT yonghuawang anovelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT qinglingcai anovelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT yijuzhan anovelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT jianyang novelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT yonghuawang novelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT qinglingcai novelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess AT yijuzhan novelhybridanticollisionalgorithmforrfidsystembasedongroupeddynamicframedrecognitionandbinarytreerecursiveprocess |