A logarithmic lower bound for time-spread multiple-access (TSMA) protocols

DOI10.1023/A:1019129328897MaRDI QIDQ1853910zbMATH OpenOpenAlexFDO

Authors Stefano Basagni, Danilo Bruschi

Publication date 23 January 2003

Published in Wireless Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019129328897

zbMATH Keywords

time-spread multiple-access

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• scientific article; zbMATH DE number 2088528
• Conflict resolution in a multiple access channel
• The Abstract MAC Layer

This page was built for publication: A logarithmic lower bound for time-spread multiple-access (TSMA) protocols

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