Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags

Koh, Hyunho; Yun, Sungmin; Kim, H.

doi:10.1109/icc.2008.492

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This prevents the reader from recognizing any tag. Various tag anti-collision protocols are proposed in [2], [3]. An Aloha-based tag anti-collision scheme has also been standardized by EPCglobal in [4] where the reader begins each interrogation round by informing all the tags about the frame size.…”

Section: Introductionmentioning

confidence: 99%

Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems

Mohsenian-Rad

Shah-Mansouri

Wong

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where several readers are placed together to improve the read rate and correctness, readers and tags can frequently experience packet collision. A common approach to avoid collision is to use a distinct frequency channel for interrogation for each reader. Various multi-channel anti-collision protocols have been proposed for RFID readers. However, due to their heuristic nature, most algorithms may not fully utilize the achievable system performance. In this paper, we develop an optimization-based distributed randomized multi-channel interrogation algorithm, called FDFA, for large-scale RFID systems. For this purpose, we develop elaborate models for reader-to-tag and reader-toreader collision problems. FDFA algorithm is guaranteed to find a local optimum of a max-min fair resource allocation problem to balance the processing load among readers. Simulation results show that FDFA has a significantly better performance than the existing heuristic algorithms in terms of the number of successful interrogations. It also better utilizes the frequency spectrum.

show abstract

Section: Introductionmentioning

confidence: 99%

Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems

Mohsenian-Rad

Shah-Mansouri

Wong

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…• Tag distribution: If it is possible to make assumptions about the distribution of the tags IDs, Koh et al (2008) show a feasible approach that is applied to detect tags IDs which form a balanced tree. The distribution of the IDs is also interesting for MS since this has a direct influence on the length of the identifying masks and, therefore, on the required tag memory.…”

Section: Related Workmentioning

confidence: 99%

Approaches to fast sequential inventory and path following in RFID-enriched environments

Bosien

Turau

Zambonelli

2012

IJRFITA

View full text Add to dashboard Cite

Although RFID is mostly used for ticketing, e-passports and supply chain management applications, the technology is also suitable for transponder based navigation systems. There it can be applied to leave a virtual trace on writeable RFID tags. These applications use RFID in a different way, because the tags are stationary and related to each other, since each tag of the path points to the following one. This offers the possibility to develop more efficient algorithms for their detection. In this paper, we suggest to store the identifying masks of subsequent tag IDs on the tags. The approach can easily be used with query-tree anti-collision methods. We examine the requirements for such an approach and describe a concrete algorithm, which is simulated and compared with different anti-collision algorithms.Keywords: RFID; inventory; anti-collision; pheromones; ants; path following; navigation; algorithms; query-tree; ISO-15693; mask storing; virtual trace.Reference to this paper should be made as follows: Bosien, A., Turau, V. and Zambonelli, F. Approaches to fast sequential inventory and path following 29 the scope of distributed systems with a focus on wireless sensor networks, energy aware computing and fault tolerance. He has published five books and more than 50 scientific papers in international journals and conferences. He regularly serves as a member of programme committees of international conferences.

show abstract

“…Este protocolo basado enárbol aprovecha la estructura secuencial del ID de las marcas, con el fin de alcanzar una eficiencia máxima. Hace una búsqueda primero en profundidad hasta identificar exitosamente una marca, para posteriormente recorrer de manera horizontal los nodos que se encuentran al mismo nivel [13].…”

Section: Sidewalkunclassified

Estimación de marcas en redes RFID

Martínez

View full text Add to dashboard Cite

Actualmente RFID es una tecnología utilizada dentro de diversasáreas. El gran atractivo de RFID es la capacidad de identificar objetos de manera inalámbrica sin necesidad de contacto o línea de visión entre los dispositivos participantes. Debido al gran impacto de la tecnología RFID, es necesario queésta cuente con mecanismos que mejoren su funcionamiento y optimicen su rendimiento.La tecnología RFID afronta grandes retos, tales como la resolución de colisiones, el ahorro de energía, la seguridad, etc. Una mejora dentro de cualquiera de estos campos implica invariablemente una mejora en el desempeño y funcionamiento de esta tecnología, que a su vez se puede traducir en la apertura de nuevas aplicaciones que utilicen tecnología RFID.En esta tesis de maestría nos enfocamos a resolver uno de los problemas principales que atañen a las redes RFID: las colisiones entre marcas. Este problema es uno de los más importantes que se presentan dentro de las redes RFID, ya que no solamente se pierde la información transmitida por las marcas, sino que además se desperdicia el ancho de banda, la energía, y se incrementa el retardo de identificación, siendo esteúltimo una de las medidas de desempeño más significativas en este tipo de redes.A lo largo de este documento presentamos una breve descripción de los fundamentos de las redes RFID, componentes principales, descripción de los dispositivos participantes, etc., detallamos el problema de colisiones entre marcas, así como el contexto bajo el cual se presenta. De igual forma, presentamos una revisión de los protocolos anticolisión más representativos presentados hasta el momento para redes RFID, y discutimos las ventajas y desventajas que ofrecen.En base al estudio realizado, en este trabajo proponemos un protocolo anticolisión basado en CSMA p-persistente, el cual muestra mejores resultados con respecto a los estándares utilizados dentro de los entornos RFID activos, y algunas propuestas presentadas previamente en la literatura. Evaluamos nuestra propuesta en base al retardo de identificación, buscando obtener resultados confiables y válidos.Finalmente, concluimos discutiendo los resultados obtenidos, las implicaciones de estos y el trabajo a futuro que realizaremos en diferentes extensiones de este trabajo.

show abstract

Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags

Cited by 5 publications

References 8 publications

Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems

Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems

Approaches to fast sequential inventory and path following in RFID-enriched environments

Estimación de marcas en redes RFID

Contact Info

Product

Resources

About