Adaptive collision resolution for efficient RFID tag identification

EURASIP Journal on Wireless Communications and Networking

Table 2 Comparison among k-TAS and other relevant studies

	Assumption & collision detection technique	Collision resolution mechanism	Performance comparison
			Identification delay*	Communication overhead
k-TAS	Transmission, synchronization & bit-by-bit collision detection	k-splitting	Low (log_k(n))	Low
ETIP [38]		k-splitting	Low (log_k(n))	High
BS [16, 34]		2-splitting	Medium (log₂(n))**	High
RN16QT [17]	Additional tag Memory for randomly generated prefixes & bit-by-bit collision detection	2-splitting	High (log₂(n))	High
Query tree (QT) [13, 17, 21, 27, 32]	Bit-by-bit collision detection	2-splitting	High (log₂(n))	High

*n is the number of tags.
**BS gains a better performance than QT-based methods by eliminating all idle cycles.