ACM Home Page
Please provide us with feedback. Feedback
Dynamic tag estimation for optimizing tree slotted aloha in RFID networks
Full text PdfPdf (332 KB)
Source
International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems table of contents
Vancouver, British Columbia, Canada
SESSION: Scheduling and medium access control table of contents
Pages 315-322  
Year of Publication: 2008
ISBN:978-1-60558-235-1
Authors
Gaia Maselli  Rome University "La Sapienza", Rome, Italy
Chiara Petrioli  Rome University "La Sapienza", Rome, Italy
Claudio Vicari  Rome University "La Sapienza", Rome, Italy
Sponsors
ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 144,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454503.1454557
What is a DOI?

ABSTRACT

The emergent commercial use of techniques for Radio Frequency-based IDentification of different items (RFID) requires the investigation and testing of collision resolution mechanisms for the efficient and correct communication between the system reader and the tags labeling the items that need to be identified. Several MAC protocols have been proposed to resolve collisions in RFID networks. A recent solution, named Tree Slotted Aloha (TSA), has been shown to outperform previous ones with respect to the time it takes for identifying all tags, and the total number of bits transmitted to complete the identification process. However, almost half of the time needed by TSA for identifying tags is spent in collisions. This depends on TSA operation and in particular on the way TSA estimates the number of colliding tags. We have observed that in the case of realistically large networks, TSA highly underestimates this number, with non-negligible impact on the protocol performance. In this paper, we propose a Dynamic Tree Slotted Aloha (Dy TSA) protocol that exploits the knowledge acquired during ongoing readings to refine the estimation of the number of colliding tags. In so doing, Dy TSA adapts the length of the following reading cycles to the actual number of tags still requiring identification. Through ns2-based simulations we show that the proposed method is effective for tag identification and results in significantly improved performance over TSA. Specifically, the length of the identification process is up to 20% lower than that of TSA. Furthermore, the amount of transmitted bits needed for identifying all tags decreases up to 30%.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns/.
 
2
EPCTM Radio-Frequency Identification Protocols Class-1 Generation-2 UHF RFID Protocol for Communications at 860MHz-960MHz, EPCglobal. http://www.epcglobalinc.org/standards/uhfc1g2, Dec. 2004.
 
3
 
4
J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory, 25(5):505 -- 515, 1979.
5
 
6
 
7
J. Massey. Collision resolution algorithms and random-access communication. Multi-Users Communication Networks, CISM Courses and Lectures, (256):73--137, 1981.
 
8
9
 
10

Collaborative Colleagues:
Gaia Maselli: colleagues
Chiara Petrioli: colleagues
Claudio Vicari: colleagues