A class of algorithms for collision resolution with multiplicity estimation

DOI10.1007/S00453-007-9082-XzbMATH Open1153.68557OpenAlexW2064087529MaRDI QIDQ2471709FDOQ2471709

Authors: Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad 

Publication date: 18 February 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9082-x

Recommendations

• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Improved anti-collision algorithm in RFID system
• Bayesian estimation in dynamic framed slotted ALOHA algorithm for RFID system
• Algorithms and Computation
• On a tree collision resolution algorithm in presence of capture

zbMATH Keywords

RFIDBatch conflict resolutionCollision resolutionStatistical multiplicity estimationTree algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tree algorithms for packet broadcast channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm

Cited In (3)

• Improved Generic Algorithms for 3-Collisions
• On a tree collision resolution algorithm in presence of capture
• A novel prediction‐based collision resolution algorithm

This page was built for publication: A class of algorithms for collision resolution with multiplicity estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471709)