A class of algorithms for collision resolution with multiplicity estimation

DOI10.1007/S00453-007-9082-XMaRDI QIDQ2471709zbMATHOpenAlexFDO

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

zbMATH Keywords

RFIDBatch conflict resolutionCollision resolutionStatistical multiplicity estimationTree algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

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

Cites work

• scientific article; zbMATH DE number 3659453 (Why is no real title available?)
• scientific article; zbMATH DE number 42729 (Why is no real title available?)
• scientific article; zbMATH DE number 46747 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Tree algorithms for packet broadcast channels

Cited in

(3)

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

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)