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

Madhavi W. Subbarao

dblp:13/10713 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2000
—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%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › packet radio network
frequency-hop network
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Wireless networking
packet radio network
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Wireless networking › wireless network optimization
transmission range optimization
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes › code construction › optimal code construction
code rate optimization
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes
reed-solomon codes
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Wireless networking
medium access control
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000
Wireless networking › random access › ALOHA
slotted ALOHA
0.012000
Optimal transmission ranges and code rates for frequency-hop packet radio networks · IEEE Trans. Commun. 2000

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

performance modeling · 0.1information efficiency · 0.1
YearPublicationVenuePosition
2000 Optimal transmission ranges and code rates for frequency-hop packet radio networks
abstract
We consider a frequency-hopping multihop packet radio network using M-ary frequency-shift keying modulation in a Rayleigh fading environment. Each node transmits packets using an extended (n, k) Reed-Solomon code and the slotted ALOHA channel access protocol. For this network, we determine the optimum transmission range, optimum code rate, and optimum slotted ALOHA transmission probability to be used by each node in the network. Tradeoffs in choosing the transmission range and code rate, and the spectral efficiency of the network are captured in a new performance measure, information efficiency, which is analogous to expected forward progress. Maximizing the information efficiency yields the optimum desired network parameters.
Madhavi W. Subbarao, Brian L. Hughes
IEEE Trans. Commun.1