Flood Diversion Algorithm for Anticollision in RFID System
Radio frequency identification (RFID) provides a contactless approach for object identification. If there are multiple tags in the interrogation zone of a reader, tag collision occurs due to radio signal interference. To solve tags identification collision and improve identification efficiency in RF...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-04-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/245914 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547246318551040 |
|---|---|
| author | Hua Huo Jun Qiang Liu Yong Jie Wang |
| author_facet | Hua Huo Jun Qiang Liu Yong Jie Wang |
| author_sort | Hua Huo |
| collection | DOAJ |
| description | Radio frequency identification (RFID) provides a contactless approach for object identification. If there are multiple tags in the interrogation zone of a reader, tag collision occurs due to radio signal interference. To solve tags identification collision and improve identification efficiency in RFID system, a flood division anticollision (FDAC) algorithm has been presented. Firstly, the algorithm launches an estimation of the number of tags and according to the estimation result decides whether a flood diversion processing needs to be started or not. Secondly, when the flood diversion processing needs to be done, all tags are grouped and assigned to different models in which the tags are to be processed and identified in parallel. Thirdly, in the identification processing, for reducing data transmission, the reader needs only to send a three-dimensional-vector command to tags, tags respond to the command with part of collision-bit parameters, and stack and queue are adopted to store precious request command and tags' ID to avoid repeatedly transmitting them between the reader and the tags. Simulation experiment results show that FDAC is superior to the dynamic frame slotted (DFS) Aloha algorithm, the binary-retreat tree algorithm (BRT) and the dynamic binary-search tree (DBST) algorithm, in the performances of data bits transmission, identification time delay, and energy consumption by the reader. |
| format | Article |
| id | doaj-art-ae0c19d239064637b24e0e90f6fddda3 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2015-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-ae0c19d239064637b24e0e90f6fddda32025-02-03T06:45:36ZengWileyInternational Journal of Distributed Sensor Networks1550-14772015-04-011110.1155/2015/245914245914Flood Diversion Algorithm for Anticollision in RFID SystemHua HuoJun Qiang LiuYong Jie WangRadio frequency identification (RFID) provides a contactless approach for object identification. If there are multiple tags in the interrogation zone of a reader, tag collision occurs due to radio signal interference. To solve tags identification collision and improve identification efficiency in RFID system, a flood division anticollision (FDAC) algorithm has been presented. Firstly, the algorithm launches an estimation of the number of tags and according to the estimation result decides whether a flood diversion processing needs to be started or not. Secondly, when the flood diversion processing needs to be done, all tags are grouped and assigned to different models in which the tags are to be processed and identified in parallel. Thirdly, in the identification processing, for reducing data transmission, the reader needs only to send a three-dimensional-vector command to tags, tags respond to the command with part of collision-bit parameters, and stack and queue are adopted to store precious request command and tags' ID to avoid repeatedly transmitting them between the reader and the tags. Simulation experiment results show that FDAC is superior to the dynamic frame slotted (DFS) Aloha algorithm, the binary-retreat tree algorithm (BRT) and the dynamic binary-search tree (DBST) algorithm, in the performances of data bits transmission, identification time delay, and energy consumption by the reader.https://doi.org/10.1155/2015/245914 |
| spellingShingle | Hua Huo Jun Qiang Liu Yong Jie Wang Flood Diversion Algorithm for Anticollision in RFID System International Journal of Distributed Sensor Networks |
| title | Flood Diversion Algorithm for Anticollision in RFID System |
| title_full | Flood Diversion Algorithm for Anticollision in RFID System |
| title_fullStr | Flood Diversion Algorithm for Anticollision in RFID System |
| title_full_unstemmed | Flood Diversion Algorithm for Anticollision in RFID System |
| title_short | Flood Diversion Algorithm for Anticollision in RFID System |
| title_sort | flood diversion algorithm for anticollision in rfid system |
| url | https://doi.org/10.1155/2015/245914 |
| work_keys_str_mv | AT huahuo flooddiversionalgorithmforanticollisioninrfidsystem AT junqiangliu flooddiversionalgorithmforanticollisioninrfidsystem AT yongjiewang flooddiversionalgorithmforanticollisioninrfidsystem |