Research Article
Hasten Dynamic Frame Slotted ALOHA Algorithm for Fast Identification in RFID System
@INPROCEEDINGS{10.1007/978-3-642-10485-5_12, author={Siti Wasikon and Mustafa Deris}, title={Hasten Dynamic Frame Slotted ALOHA Algorithm for Fast Identification in RFID System}, proceedings={Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers}, proceedings_a={INFOSCALE}, year={2012}, month={5}, keywords={RFID Tag Anti-Collision Unread Tag}, doi={10.1007/978-3-642-10485-5_12} }- Siti Wasikon
Mustafa Deris
Year: 2012
Hasten Dynamic Frame Slotted ALOHA Algorithm for Fast Identification in RFID System
INFOSCALE
Springer
DOI: 10.1007/978-3-642-10485-5_12
Abstract
The problems of identifying a set of tagged objects simultaneously in an RFID network have hampered the adoption of RFID universally. When multiple tags transmit their IDs in a single period of time to a single reader over a shared wireless channel, the tag signals may collide. This collision will disturb the reader’s identification process. Hence, we proposed a modified version of Accelerated Frame Slotted ALOHA protocol called Hasten Dynamic Frame Slotted ALOHA (HDFSA) to condense a number of retransmission for one tag, thereby reducing the processing time. In HDFSA, the unread tag will be provided with a new slot in the subsequent reading cycle. The simulation conducted revealed that HDFSA outperformed the present Accelerated Frame Slotted ALOHA up to 78 percent in terms of processing time with less complexity, while preserving the accuracy of tag identification.
