Referenced Items are not available for this document.
In this paper, an efficient anti-collision protocol, named collision tree protocol (CT), is proposed, and a collision tree is put forward to capture the complete communications between the reader and tags in an execution of CT. The main novelty of CT is that both the generating of prefixes and the splitting of tag group are according to the collided bit directly. Both the properties of collision tree and the results of experiments show that the proposed protocol improves the efficiency of tags identification up to 50% and achieves the best performance of the tree-based tags identification protocols.
Published in:
Communications Letters, IEEE
(Volume:14
,
Issue:
11
)
Date of Publication: November 2010
- Page(s):
- 1014 - 1016
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 11630148
- Digital Object Identifier :
- 10.1109/LCOMM.2010.091710.100793
- Product Type:
- Journals & Magazines
- Date of Publication :
- 27 September 2010
- Date of Current Version :
- 09 November 2010
- Issue Date :
- November 2010
- 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.
