Abstract
Prior work on anti-collision for Radio Frequency IDentification (RFID) systems usually schedule adjacent readers to exclusively interrogate tags for avoiding reader collisions. Although such a pattern can effectively deal with collisions, the lack of readers' collaboration wastes numerous time on the scheduling process and dramatically degrades the throughput of identification. Even worse, the tags within the overlapped interrogation regions of adjacent readers (termed as contentious tags), even if the number of such tags is very small, introduce a significant delay to the identification process. In this paper, we propose a new strategy for collision resolution. First, we shelve the collisions and identify the tags that do not involve reader collisions. Second, we perform a joint identification, in which adjacent readers collaboratively identify the contentious tags. In particular, we find that neighboring readers can cause a new type of collisions, cross-tag-collision, which may impede the joint identification. We propose a protocol stack, named Season, to undertake the tasks in two phases and solve the cross-tag-collision. We conduct extensive simulations and preliminary implementation to demonstrate the efficiency of our scheme. The results show that our scheme can achieve above 6 times improvement on the identification throughput in a large-scale dense reader environment.
Original language | English |
---|---|
Title of host publication | 2011 Proceedings IEEE INFOCOM |
Pages | 3092-3100 |
Number of pages | 9 |
DOIs | |
Publication status | Published - 2 Aug 2011 |
Externally published | Yes |
Event | IEEE INFOCOM 2011 - Shanghai, China Duration: 10 Apr 2011 → 15 Apr 2011 |
Conference
Conference | IEEE INFOCOM 2011 |
---|---|
Country/Territory | China |
City | Shanghai |
Period | 10/04/11 → 15/04/11 |
Keywords
- Reader Collision
- RFID
- Season
- Tag Collision
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering