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

Kebing Yang

dblp:51/6429 · 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

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
Physical-layer communications · 70% Network performance modeling · 23% Wireless networking · 7%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › spread spectrum
frequency hopping
0.011990
Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications › spread spectrum › frequency hopping
frequency-hopping multiple access
0.011990
Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications
spread spectrum
0.011990
Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network · IEEE J. Sel. Areas Commun. 1990
Network performance modeling
throughput analysis
0.011990
Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network · IEEE J. Sel. Areas Commun. 1990
Wireless networking
packet radio network
0.011990
Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network · IEEE J. Sel. Areas Commun. 1990

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

hard-decision decoding · 0.0forward error correction · 0.0M-ary FSK · 0.0
YearPublicationVenuePosition
1990 Throughput Analysis of a Slotted Frequency-Hop Multiple-Access Network
abstract
A link throughput analysis is presented for a slotted frequency-hop multiple-access (FHMA) packet radio network (PRN) operating in the presence of background noise, partial-band noise jamming, and partial-band tone jamming. The PRN consists of an arbitrary number of transceivers arranged in a paired-off topology. Forward error-correction coding is used for packet protection. M-ary FSK modulation is used with hard-decision decoding. Expressions are derived for the link throughput in terms of the channel cutoff rate and capacity. The dependency of the optimal processing gain, code rate, and jamming fraction on the population size, traffic intensity, bit energy to background noise ratio, and bit energy to jammer noise ratio is examined in detail. It is shown that a properly designed (optimized) PRN using random-access FHMA offers a significantly larger heavy-load throughput than a random-access frequency-division multiple-access PRN.>
Kebing Yang, Gordon L. Stüber
IEEE J. Sel. Areas Commun.1