On adaptive conflict resolution algorithms in a multiple access channel (Q809980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On adaptive conflict resolution algorithms in a multiple access channel |
scientific article; zbMATH DE number 4211957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On adaptive conflict resolution algorithms in a multiple access channel |
scientific article; zbMATH DE number 4211957 |
Statements
On adaptive conflict resolution algorithms in a multiple access channel (English)
0 references
1990
0 references
Conflict resolution time for a family of adaptive channel access protocols in a synchronous random access channel is considered. A few theorems for analysis purposes are presented and proved. It is shown finally that for four overlapping packets adaptive channel access protocols are better than any non-adaptive ones.
0 references
Conflict resolution
0 references
synchronous random access channel
0 references
adaptive channel access protocols
0 references
0.9470514
0 references
0.9378429
0 references
0.9232584
0 references
0.9118137
0 references
0.89857495
0 references
0.8816025
0 references
