Data networks
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Interrelation of characteristics of blocked RMA stack algorithms
Problems of Information Transmission
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Iterative power control for imperfect successive interference cancellation
IEEE Transactions on Wireless Communications
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
IEEE Transactions on Information Theory
High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
IEEE Transactions on Information Theory
Random multiple access in a vector disjunctive channel
Problems of Information Transmission
| Hi-index | 0.00 |
Consideration was given to an approach uniting the tree algorithm to resolve conflicts at the channel level of a multisite communication system with the procedure for successive cancelation of interference at the physical level. Proposed was a unit-memory algorithm which is stable to incomplete interference cancelation within the framework of the classical model of multiple access with the infinite number of subscribers. A simple procedure of speed calculation which is applicable to the class of the tree algorithms featuring successive interference cancelation was demonstrated by the example of its analysis. The proposed algorithm may be used as an alternative to the scheme of resolution of conflicts for the channel resource defined in the IEEE 802.16 standard.