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

Rashid Al-Naami

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

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

Computer networks · 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.

Computer networks
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › multiple access protocols
contention-based protocols
0.011992
Status sense multiple-access (S2MA) communication · IEEE Trans. Commun. 1992
Wireless networking
multiple access protocols
0.011992
Status sense multiple-access (S2MA) communication · IEEE Trans. Commun. 1992
Wireless networking › medium access control
TDMA
0.011992
Status sense multiple-access (S2MA) communication · IEEE Trans. Commun. 1992

Methods — techniques the papers use, named apart from their topics

performance analysis · 0.0
YearPublicationVenuePosition
1992 Status sense multiple-access (S2MA) communication
abstract
A new contention-based multi-access protocol, named status sense multiple access (S/sup 2/MA), is introduced. S/sup 2/MA is synchronous TDMA in its framing but it possesses many features of random access. The approach of S/sup 2/MA is geared towards integrating heterogeneous classes of customers over a common broadcast channel. The performance of this protocol with two classes of customers, such as voice and data, is analyzed. Unlike fixed and some moveable-boundary approaches of integrating voice and data, here no slot is wasted, except for possible collision, as long as there is a demand for the slot from either of the two classes. Therefore, the channel utilization efficiency can be very high.>
Rashid Al-Naami, Debabrata Saha
IEEE Trans. Commun.1