Q-Value Fine-Grained Adjustment Based RFID Anti-Collision Algorithm
Summary :
Fast identification is an urgent demand for modern RFID systems. In this paper, we propose a novel algorithm, access probability adjustment based fine-grained Q-algorithm (APAFQ), to enhance the efficiency of RFID identification with low computation overhead. Specifically, instead of estimation accuracy, the target of most proposed anti-collision algorithms, the APAFQ scheme is driven by updating Q value with two different weights, slot by slot. To achieve higher identification efficiency, the reader adopts fine-grained access probability during the identification process. Moreover, based on the responses from tags, APAFQ adjusts the access probability adaptively. Simulations show the superiority of APAFQ over existing Aloha-based algorithms.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E99-B No.7 pp.1593-1598
- Publication Date
- 2016/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2015EBP3475
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Jian SU
University of Electronic Science and Technology of China
Xuefeng ZHAO
Huaihai Institute of Technology
Danfeng HONG
German Aerospace Center (DLR)
Zhongqiang LUO
University of Electronic Science and Technology of China
Haipeng CHEN
Northeast Dianli University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jian SU, Xuefeng ZHAO, Danfeng HONG, Zhongqiang LUO, Haipeng CHEN, "Q-Value Fine-Grained Adjustment Based RFID Anti-Collision Algorithm" in IEICE TRANSACTIONS on Communications,
vol. E99-B, no. 7, pp. 1593-1598, July 2016, doi: 10.1587/transcom.2015EBP3475.
Abstract: Fast identification is an urgent demand for modern RFID systems. In this paper, we propose a novel algorithm, access probability adjustment based fine-grained Q-algorithm (APAFQ), to enhance the efficiency of RFID identification with low computation overhead. Specifically, instead of estimation accuracy, the target of most proposed anti-collision algorithms, the APAFQ scheme is driven by updating Q value with two different weights, slot by slot. To achieve higher identification efficiency, the reader adopts fine-grained access probability during the identification process. Moreover, based on the responses from tags, APAFQ adjusts the access probability adaptively. Simulations show the superiority of APAFQ over existing Aloha-based algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2015EBP3475/_p
Copy
@ARTICLE{e99-b_7_1593,
author={Jian SU, Xuefeng ZHAO, Danfeng HONG, Zhongqiang LUO, Haipeng CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={Q-Value Fine-Grained Adjustment Based RFID Anti-Collision Algorithm},
year={2016},
volume={E99-B},
number={7},
pages={1593-1598},
abstract={Fast identification is an urgent demand for modern RFID systems. In this paper, we propose a novel algorithm, access probability adjustment based fine-grained Q-algorithm (APAFQ), to enhance the efficiency of RFID identification with low computation overhead. Specifically, instead of estimation accuracy, the target of most proposed anti-collision algorithms, the APAFQ scheme is driven by updating Q value with two different weights, slot by slot. To achieve higher identification efficiency, the reader adopts fine-grained access probability during the identification process. Moreover, based on the responses from tags, APAFQ adjusts the access probability adaptively. Simulations show the superiority of APAFQ over existing Aloha-based algorithms.},
keywords={},
doi={10.1587/transcom.2015EBP3475},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Q-Value Fine-Grained Adjustment Based RFID Anti-Collision Algorithm
T2 - IEICE TRANSACTIONS on Communications
SP - 1593
EP - 1598
AU - Jian SU
AU - Xuefeng ZHAO
AU - Danfeng HONG
AU - Zhongqiang LUO
AU - Haipeng CHEN
PY - 2016
DO - 10.1587/transcom.2015EBP3475
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2016
AB - Fast identification is an urgent demand for modern RFID systems. In this paper, we propose a novel algorithm, access probability adjustment based fine-grained Q-algorithm (APAFQ), to enhance the efficiency of RFID identification with low computation overhead. Specifically, instead of estimation accuracy, the target of most proposed anti-collision algorithms, the APAFQ scheme is driven by updating Q value with two different weights, slot by slot. To achieve higher identification efficiency, the reader adopts fine-grained access probability during the identification process. Moreover, based on the responses from tags, APAFQ adjusts the access probability adaptively. Simulations show the superiority of APAFQ over existing Aloha-based algorithms.
ER -
English
