Vai ai contenuti. | Spostati sulla navigazione | Spostati sulla ricerca | Vai al menu | Contatti | Accessibilità

| Crea un account

Zanella, Andrea (2011) Estimating Collision Set Size in Wireless and RFID Systems. [Rapporto tecnico] (Inedito)

Full text disponibile come:

[img]
Anteprima
Documento PDF (Technical Report) - Versione preliminare (Draft)
349Kb

Abstract (inglese)

In wireless systems, a collision set is a group of backlogged nodes in mutual interference range, so that the simultaneous transmission of multiple nodes will result into packets collision. The estimation of the number of nodes in the collision set is an interesting problem that has received considerable attention in the literature, in particular in the context of RFID systems. A popular approach consists in applying a framed Aloha transmission scheme and, then, inferring the collision set size from the number of slots in the frame interested by zero, one or multiple transmissions. The solutions proposed in the literature offer different tradeoffs between estimate complexity and accuracy, where higher accuracy is provided by more complex algorithms. In this paper we propose a novel estimation method for framed Aloha systems that, making use of a minimum mean square error (MMSE) argument, yields very accurate estimates with limited computational complexity. The performance of the scheme is analytically determined and compared with the best-known methods proposed in the literature. The comparison shows that the MMSE-based estimator achieves the same performance of the maximum likelihood estimator, but with much lower computational complexity, and outperforms all the other methods with similar complexity.


Statistiche Download - Aggiungi a RefWorks
Tipo di EPrint:Rapporto tecnico
Anno di Pubblicazione:01 Settembre 2011
Settori scientifico-disciplinari MIUR:Area 09 - Ingegneria industriale e dell'informazione > ING-INF/03 Telecomunicazioni
Struttura di riferimento:Dipartimenti > Dipartimento di Ingegneria dell'Informazione
Codice ID:4294
Depositato il:29 Set 2011 15:19
Simple Metadata
Full Metadata
EndNote Format

Bibliografia

I riferimenti della bibliografia possono essere cercati con Cerca la citazione di AIRE, copiando il titolo dell'articolo (o del libro) e la rivista (se presente) nei campi appositi di "Cerca la Citazione di AIRE".
Le url contenute in alcuni riferimenti sono raggiungibili cliccando sul link alla fine della citazione (Vai!) e tramite Google (Ricerca con Google). Il risultato dipende dalla formattazione della citazione.

[1] J. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 505–515, Sep 1979. Cerca con Google

[2] R. Gallager, “Conflict resolution in random access broadcast networks,” in AFOSR Workshop Commun. Theory Appl., Provincetown, MA, September 1978, pp. 74–76. Cerca con Google

[3] M. Molle and G. Polyzos, “Conflict resolution algorithms and their performance analysis,” Department of Computer Cerca con Google

Science and Engineering, UCSD, East Lansing, Michigan, Tech. Rep. CS93-300, July 1993. Cerca con Google

[4] G. Khandelwal, A. Yener, K. Lee, and S. Serbetli, “ASAP: AMAC protocol for dense and time constrained RFID systems,” Cerca con Google

in IEEE International Conference on Communications 2006 (ICC ’06), vol. 9, 2006, pp. 4028–4033. Cerca con Google

[5] T. La Porta, G. Maselli, and C. Petrioli, “Anti-collision protocols for single-reader RFID systems: Temporal analysis and optimization,” IEEE Transactions on Mobile Computing,, vol. PP, no. 99, pp. 1–1, 2010. Cerca con Google

[6] C. Floerkemeier, “Transmission control scheme for fast RFID object identification,” in Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, 2006 (PerCom 2006), 2006, pp. 462–467. Cerca con Google

[7] F. C. Schoute, “Dynamic frame length ALOHA,” IEEE Trans. on Communications, vol. COM-31, no. 4, pp. 565–568, Cerca con Google

April 1983. Cerca con Google

[8] Q. Tong, X. Zou, and H. Tong, “Dynamic framed slotted aloha algorithm based on Bayesian estimation in RFID system,” in World Congress on Computer Science and Information Engineering, vol. 1, march 2009, pp. 384 –388. Cerca con Google

[9] H. Vogt, “Efficient object identification with passive RFID tags,” in Proc. International Conference on Pervasive Computing, Pervasive2002, Springer-Verlag, Apr. 2002, pp. 98–113. Cerca con Google

[10] M. Kodialam and T. Nandagopal, “Fast and reliable estimation schemes in RFID systems,” in MobiCom’06: Proceedings of the 12th annual international conference on Mobile computing and networking, 2006, pp. 322–333. Cerca con Google

[11] W.-T. Chen, “An accurate tag estimate method for improving the performance of an RFID anticollision algorithm based on dynamic frame length ALOHA,” IEEE Transactions on Automation Science and Engineering, vol. 6, no. 1, pp. 9 –15, Cerca con Google

2009. Cerca con Google

[12] H. Wu and Y. Zeng, “Bayesian tag estimate and optimal frame length for anti-collision Aloha RFID system,” IEEE Cerca con Google

Transactions on Automation Science and Engineering, vol. 7, no. 4, pp. 963 –969, 2010. Cerca con Google

[13] D. Klair, K.-W. Chin, and R. Raad, “On the accuracy of RFID tag estimation functions,” in International Symposium on Communications and Information Technologies, 2007. ISCIT ’07., 2007, pp. 1401 –1406. Cerca con Google

[14] C. Floerkemeier and M. Wille, “Comparison of transmission schemes for framed aloha based RFID protocols,” in International Symposium on Applications and the Internet Workshops, 2006. SAINT Workshops 2006., 2006, pp. 97–100. Cerca con Google

[15] H. Vogt, “Multiple object identification with passive RFID tags,” in IEEE International Conference on Systems, Man and Cerca con Google

Cybernetics (SMC ’02), Oct. 2002. Cerca con Google

Download statistics

Solo per lo Staff dell Archivio: Modifica questo record