TY - CONF
T1 - Anti-collision algorithms and performance analysis for UHF passive RFID network
AU - Nazir, Dr Hammad
AU - Xu, Youzhi
N1 - Link goes to a Masters thesis record on a shared European repository, not a Conference record. NR 29/07/24
PY - 2011/6/1
Y1 - 2011/6/1
N2 - Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2^ Q and cannot be adjusted exactly to the number of tags to be identified. In this thesis, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represent the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Our proposed ODFSA algorithm is purely built on EPC Global class-1 Gen. 2 standards. The proposed algorithm uses probabilistic approach instead of grouping. At the beginning of each frame, the reader sends a Query or Query adjust packet as in EPC Global Class-1 Gen. 2 does, but the packet contains also a field called frame access probability, P. When a tag receives the packet, the tag generates a random value p. If p<= P, the tag participates into the current frame, otherwise it waits for the next frame. Estimation of numbers of unread tags is updated after end of each frame, parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.
AB - Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2^ Q and cannot be adjusted exactly to the number of tags to be identified. In this thesis, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represent the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Our proposed ODFSA algorithm is purely built on EPC Global class-1 Gen. 2 standards. The proposed algorithm uses probabilistic approach instead of grouping. At the beginning of each frame, the reader sends a Query or Query adjust packet as in EPC Global Class-1 Gen. 2 does, but the packet contains also a field called frame access probability, P. When a tag receives the packet, the tag generates a random value p. If p<= P, the tag participates into the current frame, otherwise it waits for the next frame. Estimation of numbers of unread tags is updated after end of each frame, parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.
UR - https://www.diva-portal.org/smash/record.jsf?pid=diva2%3A425028&dswid=-8366
M3 - Paper
ER -