Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nader Mahravari

dblp:85/5037 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 67% Distributed computing theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory
conflict resolution
0.011990
Random-access communication with multiple reception · IEEE Trans. Inf. Theory 1990
Information theory › network information theory
multiple-access channel
0.011990
Random-access communication with multiple reception · IEEE Trans. Inf. Theory 1990
Information theory › network information theory › multiple-access channel
random access channel
0.011990
Random-access communication with multiple reception · IEEE Trans. Inf. Theory 1990
YearPublicationVenuePosition
1990 Random-access communication with multiple reception
abstract
Communication over a random multiple-access (RMA) broadcast channel with multiple reception capability is considered. Multiple reception refers to the assumption that a collision is defined as the simultaneous transmission of more than d packets, where d>or=2. In most previous studies of RMA channels, it was assumed that d=1, that is, whenever more than one source tries to use the same slot, a collision occurs, and all the messages involved must be retransmitted. In practice, however, it might be possible to construct RMA systems where simultaneous transmission of d or fewer packets, where d>or=2, is successful. In this work, the author presents conflict resolution algorithms and determine lower bounds to the capacity of such RMA channels for many different feedback models. It is shown that the packet transmission rates (throughput) reported previously can be achieved under much less restricted feedback models.>
Nader Mahravari
IEEE Trans. Inf. Theory1