A Query Tree Dynamic Frame Slot ALOHA Collision Resolution Protocol for RFID Tags

Author(s):  
Xinqing Yan ◽  
Zhouping Yin ◽  
Youlun Xiong
2013 ◽  
Vol 17 (3) ◽  
pp. 604-607 ◽  
Author(s):  
Jongmin Shin ◽  
Byeongchan Jeon ◽  
Dongmin Yang
Keyword(s):  

2013 ◽  
Vol 9 (1) ◽  
pp. 35 ◽  
Author(s):  
Hugo Landaluce ◽  
Asier Perallos ◽  
Ignacio Angulo

Radio Frequency Identification (RFID) technology is increasingly becoming popular, for its widespread use and more sophisticated applications. The coexistence of tags sharing the communication channel requires solutions to message collisions, which degrade bandwidth, and increase the number of transmitted bits. A new methodology called ‘window’ is presented to manage the number of bits transmitted by a tag. The aim is show how the query tree (QT) protocol is influenced by this feature, and how the performance of the novel protocol, query window tree (QwT), improves when the tag ID distribution is correlated. Therefore, we have performed a fair comparison of the Query Tree and the new proposed QwT protocol for various tag ID distributions. Simulations show that the QwT positively decreases the total number of bits that are transmitted by tags.


Author(s):  
Xinqing Yan ◽  
Zhouping Yin

Proposed protocols work clumsily in resolving the collisions occurred in dense RFID tag environment. QTDFS-ALOHA, a hybrid protocol which combines the query tree protocol and the dynamic frame slot ALOHA protocol, is proposed. In each frame of this protocol, only tags in the active set are allowed to answer in randomly selected slots. Afterwards, the population of tags in the active set is estimated. According to the identification accuracy required, the protocol may choose to continue the identification of the active set with delicately calculated frame length, or to divide the active set into multiple subsets using some binary prefix strings and identify each subset subsequently in the following frames. This process is performed recursively for all tag sets until the required accuracy is achieved. Proposed tag population estimation methods are summarized and evaluated. Numeric simulation verifies that this hybrid protocol outperforms other frame slot ALOHA based protocols.


2010 ◽  
Vol 1 (1) ◽  
pp. 67-82
Author(s):  
Xinqing Yan ◽  
Zhouping Yin

Proposed protocols work clumsily in resolving the collisions occurred in dense RFID tag environment. QTDFS-ALOHA, a hybrid protocol which combines the query tree protocol and the dynamic frame slot ALOHA protocol, is proposed. In each frame of this protocol, only tags in the active set are allowed to answer in randomly selected slots. Afterwards, the population of tags in the active set is estimated. According to the identification accuracy required, the protocol may choose to continue the identification of the active set with delicately calculated frame length, or to divide the active set into multiple subsets using some binary prefix strings and identify each subset subsequently in the following frames. This process is performed recursively for all tag sets until the required accuracy is achieved. Proposed tag population estimation methods are summarized and evaluated. Numeric simulation verifies that this hybrid protocol outperforms other frame slot ALOHA based protocols.


Sign in / Sign up

Export Citation Format

Share Document