ALOHA Anti-collision Algorithm for Frame Idle
Slot Removal and Collision Reduction
Hong-wei Deng 1,2(B) , Wei Zeng 1 , Ming Yao 1 , and Jia-li Kong 1
1 College of Computer Science and Technology,
Hengyang Normal University, Hengyang 421002, China
dhwwhd@163.com
2 Hunan Provincial Key Laboratory of Intelligent Information Processing and Application,
Hengyang 421002, China
Abstract. In this study, we propose an ALOHA anti-collision algorithm for frame
idle slot removal and collision reduction—called the Cancel Idle and Reduce
Collision Framed Slotted Aloha (CIRC-FSA) algorithm—to address the collision problems of tags in mobile scenarios. The proposed algorithm is based on
the radio frequency identification grouped adaptive allocating slots (GAAS) anticollision algorithm with self-adaptive packet allocation. A combined chaotic mapping pseudo-random generator is used, the tags are initially grouped, and the
frame length L is set to be much larger than the number of grouped tags X (L
>> X). Furthermore, incorporating the GAAS protocol enhances the algorithm
to skip idle and collision slots and improve the efficiency of tag identification. The
results of simulation analysis indicate that, compared with the free framed slotted
ALOHA (FSA), grouped dynamic framed slotted ALOHA (GDFSA), and cancel
idle framed slotted ALOHA (CIFSA) algorithms, the proposed CIRC-FSA algorithm results in a lower tag loss rate, higher throughput, and higher recognition
efficiency.
Keywords: Removal of idle slots · Reduction of collision slots · Tag grouping
and serialization · Tag loss rate (TLR)
1 Introduction
An anti-collision algorithm for radio frequency identification (RFID) systems is a noncontact automatic identification technology. Some of its advantages are fast object identification, low cost, and convenience. Relevant information is stored in the tag and the
objects are received and managed through radio frequency signals. With the rapid development of the Internet of Things industry, RFID technology has been implemented in
many fields, such as public transportation and management of production processes. At
present, research on anti-collision algorithms for static RFID systems is very mature.
However, in dynamic RFID systems, owing to the loss of tags, limited stay time, and
random post-identification [1], the exploration of tag anti-collision algorithms still has
room for improvement.
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021
S. N. Atluri and I. Vušanovi´ c (Eds.): ICCES 2020, MMS 97, pp. 160–170, 2021.
https://doi.org/10.1007/978-3-030-64690-5_15
Slot Removal and Collision Reduction
Hong-wei Deng 1,2(B) , Wei Zeng 1 , Ming Yao 1 , and Jia-li Kong 1
1 College of Computer Science and Technology,
Hengyang Normal University, Hengyang 421002, China
dhwwhd@163.com
2 Hunan Provincial Key Laboratory of Intelligent Information Processing and Application,
Hengyang 421002, China
Abstract. In this study, we propose an ALOHA anti-collision algorithm for frame
idle slot removal and collision reduction—called the Cancel Idle and Reduce
Collision Framed Slotted Aloha (CIRC-FSA) algorithm—to address the collision problems of tags in mobile scenarios. The proposed algorithm is based on
the radio frequency identification grouped adaptive allocating slots (GAAS) anticollision algorithm with self-adaptive packet allocation. A combined chaotic mapping pseudo-random generator is used, the tags are initially grouped, and the
frame length L is set to be much larger than the number of grouped tags X (L
>> X). Furthermore, incorporating the GAAS protocol enhances the algorithm
to skip idle and collision slots and improve the efficiency of tag identification. The
results of simulation analysis indicate that, compared with the free framed slotted
ALOHA (FSA), grouped dynamic framed slotted ALOHA (GDFSA), and cancel
idle framed slotted ALOHA (CIFSA) algorithms, the proposed CIRC-FSA algorithm results in a lower tag loss rate, higher throughput, and higher recognition
efficiency.
Keywords: Removal of idle slots · Reduction of collision slots · Tag grouping
and serialization · Tag loss rate (TLR)
1 Introduction
An anti-collision algorithm for radio frequency identification (RFID) systems is a noncontact automatic identification technology. Some of its advantages are fast object identification, low cost, and convenience. Relevant information is stored in the tag and the
objects are received and managed through radio frequency signals. With the rapid development of the Internet of Things industry, RFID technology has been implemented in
many fields, such as public transportation and management of production processes. At
present, research on anti-collision algorithms for static RFID systems is very mature.
However, in dynamic RFID systems, owing to the loss of tags, limited stay time, and
random post-identification [1], the exploration of tag anti-collision algorithms still has
room for improvement.
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021
S. N. Atluri and I. Vušanovi´ c (Eds.): ICCES 2020, MMS 97, pp. 160–170, 2021.
https://doi.org/10.1007/978-3-030-64690-5_15