An RFID grouping proof protocol exploiting anti-collision algorithm for subgroup dividing
by Xuefei Leng, Yuan-Hung Lien, Keith Mayes, Konstantinos Markantonakis
International Journal of Security and Networks (IJSN), Vol. 5, No. 2/3, 2010

Abstract: Verifying that several RFID tags are all present in a group poses specific challenges that have generated great interest in the academic community. As the number of tags becomes large, the unreliability of radio wave communication could potentially cause possible high failure rates to the existing grouping proof. In this paper, we propose a way of grouping proof, which uses the dynamic binary tree anti-collision algorithm to subgroup the tags. This paper combines the 'Yoking Proof' idea and the 'Select-Response' mode from previous publications. The 'Yoking Proof' is generated between subgroups and within each subgroup, and as a result, the failure rates are greatly reduced. The 'Select-Response' mode is used for subgroup verification.

Online publication date: Wed, 17-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com