James W. Sennott

dblp:40/536 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—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.

Computer networks
1 paper
Physical-layer communications · 67% Network performance modeling · 33%
Theoretical computer science
1 paper
Information theory · 50% Coding theory · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
adaptive modulation and coding
0.011981
A queueing model for analysis of a bursty multiple-access communication channel · IEEE Trans. Inf. Theory 1981
Physical-layer communications › multiple access
multiple access channel
0.011981
A queueing model for analysis of a bursty multiple-access communication channel · IEEE Trans. Inf. Theory 1981
Network performance modeling
queueing analysis
0.011981
A queueing model for analysis of a bursty multiple-access communication channel · IEEE Trans. Inf. Theory 1981
Coding theory › error-correcting codes
burst error channel
0.011981
A queueing model for analysis of a bursty multiple-access communication channel · IEEE Trans. Inf. Theory 1981
Information theory
channel capacity
0.011981
A queueing model for analysis of a bursty multiple-access communication channel · IEEE Trans. Inf. Theory 1981

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

stochastic modeling · 0.0queueing theory · 0.0
YearPublicationVenuePosition
1981 A queueing model for analysis of a bursty multiple-access communication channel
abstract
A bursty multiple-access communication channel with constrained total system bandwidth, total average power, and message error rates is considered. A stochastic model for the number of active transmitters is developed. Four schemes for the dynamic assignment of power and coding rate to active transmitters are considered and compared under the expected burst system time criterion. Necessary and sufficient conditions for system operation are given, and all schemes are shown to have the same saturation behavior. Adaptive coding rates are shown to enjoy substantial advantages over fixed coding; adaptive power assignment does not offer advantages over fixed power assignment.
James W. Sennott, Linn I. Sennott
IEEE Trans. Inf. Theory1