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

Tarek Makansi

dblp:165/3776 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—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 · 78% Cellular and mobile networks · 22%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › radio resource management
code assignment
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987
Wireless networking › medium access control
handshake protocol
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987
Wireless networking
medium access control
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987
Wireless networking
packet radio network
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987
Wireless networking › medium access control › hidden terminal problem
hidden terminal interference
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987
Wireless networking › wireless mesh network
multihop wireless network
0.011987
Transmitter-Oriented Code Assignment for Multihop Packet Radio · IEEE Trans. Commun. 1987

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

simulation · 0.0quasi-orthogonal code assignment · 0.0
YearPublicationVenuePosition
1987 Transmitter-Oriented Code Assignment for Multihop Packet Radio
abstract
Quasi-orthogonal codes are assigned to transmitters in a packet radio network such that interference caused by hidden terminals is eliminated. In addition, a handshaking protocol permits random access between nodes. Simple mathematical models and simulation indicate a potential throughput advantage over slotted ALOHA and CSMA.
Tarek Makansi
IEEE Trans. Commun.1