Referenced Items are not available for this document.
Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.
Published in:
Communications Letters, IEEE
(Volume:12
,
Issue:
11
)
Date of Publication: November 2008
- Page(s):
- 861 - 863
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 10346277
- Digital Object Identifier :
- 10.1109/LCOMM.2008.081157
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 25 November 2008
- Issue Date :
- November 2008
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
