By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xinqing Yan ; State Key Lab. of Digital Manuf. Equip., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Zhouping Yin ; Youlun Xiong

One of key issues that affect the universal adoption of the RFID system is the tag collision. The protocols in the frame slot ALOHA and the binary tree families work clumsily in the collision resolution of dense RFID tags. A hybrid protocol, query tree dynamic frame slot ALOHA (QTDFSA) is proposed to work in dense tag environment. Based on data gathered and requirement of application system, QTDFSA divides the tags to multiple subgroups using binary suffix strings, and dynamic frame slot ALOHA protocol is employed to resolve tags and collect information in each subgroup. This division and resolution procedure is performed recursively until the required accuracy is satisfied. Numerical simulation shows that this protocol outperforms other frame slot ALOHA protocols and high throughput can be achieved in the identification.

Published in:

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on  (Volume:1 )

Date of Conference:

13-15 Dec. 2008