<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The reader-to-tag collision problem occurs when multiple readers try to access the same tag simultaneously. The traditional collision avoidance techniques such as RTS (request to send) and CTS (clear to send) are not applicable because a reader may communicate with multiple tags simultaneously. In this paper, we introduce a collaborative communication protocol to avoid reader-to-tag collisions using TDMA and clustering approaches. The protocol targets the RFID-WSN static systems arranged in a square grid topology, which we can find in different RFID applications such as warehouse stocktaking, parking cars, agricultural fields, and libraries. In such simple topologies, the other proposed reader collision solutions for general use of RFID systems are not efficient since they cannot avoid all possible collisions, and worse of that, some of them are not even detectable, which is intolerable for stocktaking applications. Moreover, they are complicated and heavy in resources, while read throughput is limited. Our protocol presents a simple solution for simple RFID systems with better performances. To validate the proposed protocol, we presented a model using the Process Meta Language (Promela), which is executed under the simple Promela interpreter (SPIN) model checker to verify the protocol properties as deadlocks and livelocks. Also as a proof of concept, we have done a first-step performance analysis using the java runtime.</p></abstract>

The reader-to-tag collision problem occurs when multiple readers try to access the same tag simultaneously. The traditional collision avoidance techniques such as RTS (request to send) and CTS (clear to send) are not applicable because a reader may communicate with multiple tags simultaneously. In this paper, we introduce a collaborative communication protocol to avoid reader-to-tag collisions using TDMA and clustering approaches. The protocol targets the RFID-WSN static systems arranged in a square grid topology, which we can find in different RFID applications such as warehouse stocktaking, parking cars, agricultural fields, and libraries. In such simple topologies, the other proposed reader collision solutions for general use of RFID systems are not efficient since they cannot avoid all possible collisions, and worse of that, some of them are not even detectable, which is intolerable for stocktaking applications. Moreover, they are complicated and heavy in resources, while read throughput is limited. Our protocol presents a simple solution for simple RFID systems with better performances. To validate the proposed protocol, we presented a model using the Process Meta Language (Promela), which is executed under the simple Promela interpreter (SPIN) model checker to verify the protocol properties as deadlocks and livelocks. Also as a proof of concept, we have done a first-step performance analysis using the java runtime.

TDMA-clustering-based approach to avoid the reader-to-tag collision problem during the stocktaking process

International Journal on Smart Sensing and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

running-head

TDMA-clustering-based approach to avoid the reader-to-tag collision problem during the stocktaking process:

The reader-to-tag collision problem occurs when multiple readers try to access the same tag simultaneously. The traditional collision avoidance techniques such...

Message	Semantic	Response
scnState	Inform the neighbors of start of scan	Ok
snsState	Inform the neighbors of end of scan	Ok
remScan	Ask the neighbor for his list of remaining scans	scanRep
continue_scan	Ask the neighbor to continue its regular scan	Ok
continue_scan_newSeq	Send the neighbor it’s updated scan sequence and ask him to continue the next scan	Ok
start_double_scan	Ask the neighbor to start synchronized double scan	Ok
continue_double_scan	Ask the neighbor to continue next synchronized double scan	Ok
start_triple_scan_newSeq_sesMem	Send the neighbor it’s updated scan sequence and the other neighbor’s address, and ask him to start the synchronized triple scan	Ok
start_triple_scan_sesMem	Send the neighbor the other neighbor’s address and ask him to start the synchronized triple scan	Ok
continue_triple_scan	Ask the neighbor to continue next synchronized triple scan	Ok
EOCS	Inform the neighbors of end of current scan	Ok

TDMA-clustering-based approach to avoid the reader-to-tag collision problem during the stocktaking process

Publié en ligne: 28 mai 2021

Pages: 1 - 14

Reçu: 05 nov. 2020

DOI: https://doi.org/10.21307/ijssis-2021-009

Mots clés
RFID, Reader Collision, Communication Protocol, WSN, Clustering, TDMA

© 2021 Sara El Ouadaa et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Figure 1:

Figure 2:

Figure 3:

Figure 4:

Figure 5:

Figure 6:

Figure 7:

Figure 8:

Figure 9:

Set of the Protocol’s messages.

TDMA-clustering-based approach to avoid the reader-to-tag collision problem during the stocktaking process

Publié en ligne: 28 mai 2021

Pages: 1 - 14

Reçu: 05 nov. 2020

DOI: https://doi.org/10.21307/ijssis-2021-009

Mots clésRFID, Reader Collision, Communication Protocol, WSN, Clustering, TDMA

© 2021 Sara El Ouadaa et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Figure 1:

Figure 2:

Figure 3:

Figure 4:

Figure 5:

Figure 6:

Figure 7:

Figure 8:

Figure 9:

Set of the Protocol’s messages.

Mots clés
RFID, Reader Collision, Communication Protocol, WSN, Clustering, TDMA