Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20856279

An Efficient Framed-Slotted ALOHA Algorithm with Pilot Frame and Binary Selection for Anti-Collision of RFID Tags

Author
EOM, Jun-Bong1 ; LEE, Tae-Jin1 ; RIETMAN, Ronald2 ; YENER, Aylin3
[1] School of Information and Communication Engr., Sungkyunkwan University, Suwon 440-746, Korea, Republic of
[2] Philips Research Labs, High Tech Campus 37, 5656 AE Eindhoven, Netherlands
[3] Department of Electrical Engineering, Pennsylvania State University, University Park, PA 16802, United States
Source

IEEE communications letters. 2008, Vol 12, Num 11, pp 861-863, 3 p ; ref : 8 ref

CODEN
ICLEF6
ISSN
1089-7798
Scientific domain
Telecommunications
Publisher
Institute of Electrical and Electronics Engineers, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Anti-collision RFID collision threshold pilot frame tag estimation tag identification
Keyword (fr)
Algorithme Arbre binaire Evaluation performance Identification par radiofréquence Protocole accès Simulation Transpondeur
Keyword (en)
Algorithm Binary tree Performance evaluation Radio frequency identification Access protocol Simulation Transponder
Keyword (es)
Algoritmo Arbol binario Evaluación prestación Identificación por radiofrecuencia Protocolo acceso Simulación Radiobaliza
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B03 Teleprocessing networks. Isdn / 001D04B03A Access methods and protocols, osi model

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B05 Radiolocalization and radionavigation

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
20856279

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web