On adaptive conflict resolution algorithms in a multiple access channel

zbMATH Open0732.94002MaRDI QIDQ809980

A. Ya. Belokopytov

Publication date: 1990

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Conflict resolutionadaptive channel access protocolssynchronous random access channel

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items (2)

A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Conflict resolution in a multiple access channel 👍 👎
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels 👍 👎
• Dynamic prioritized conflict resolution on multiple access broadcast networks 👍 👎
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels 👍 👎
• Optimal prioritized conflict resolution on a multiple access channel 👍 👎
• Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel 👍 👎
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks 👍 👎

This page was built for publication: On adaptive conflict resolution algorithms in a multiple access channel

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