By Topic

M -Ary RFID Tags Splitting With Small Idle Slots

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
$33 $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)
Hongbo Guo ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Victor C. M. Leung ; Miodrag Bolic

In radio frequency identifications (RFIDs), an idle slot can be interrupted by the reader and takes less time than the other slots. In this case, the widely used binary splitting (BS) protocol is not optimal. M-ary splitting (M >; 2) with a carefully selected M outperforms BS, because it can take into account smaller duration of the idle slots. In this paper, we provide optimal value of M (Mopt) for varying slot sizes that yields minimum identification time. The proposed scheme is called optimal splitting (OS). We also revise OS to deal with mobile tags and propose the optimal splitting with arrival tags blocking (OS-ATB) protocol. Extensive simulations show that OS and OS-ATB consistently yield better performance than the other splitting and tree-based schemes.

Published in:

IEEE Transactions on Automation Science and Engineering  (Volume:9 ,  Issue: 1 )