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

Se-Hyun Oh

dblp:122/6579 · 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
Cellular and mobile networks · 62% Wireless networking · 38%

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

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.011992
Prioritized channel assignment in a cellular radio network · IEEE Trans. Commun. 1992
Cellular and mobile networks
radio resource management
0.011992
Prioritized channel assignment in a cellular radio network · IEEE Trans. Commun. 1992
Cellular and mobile networks › mobility management › handoff control
handoff prioritization
0.011992
Prioritized channel assignment in a cellular radio network · IEEE Trans. Commun. 1992
Cellular and mobile networks › mobility management
handover
0.011992
Prioritized channel assignment in a cellular radio network · IEEE Trans. Commun. 1992

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

nonlinear discrete capacity allocation · 0.0incremental algorithms · 0.0
YearPublicationVenuePosition
1992 Prioritized channel assignment in a cellular radio network
abstract
Dimensioning procedures for prioritized channel assignment in a cellular radio network are considered. Under the cutoff priority discipline, the prioritized channel assignment procedures for a single cell and multicell system are formulated as nonlinear discrete capacity allocation problems. Exact incremental algorithms which efficiently solve the proposed problems are devised. They are based on the properties of the blocking probabilities of new calls and handoff calls. Given the number of available frequency channels together with the arrival rates and the grade of service (GOS) for both types of calls in each cell, algorithm SP1 generates an optimal channel assignment which ensures priority for handoff calls. Given the arrival rates and distinct GOSs for new and handoff calls, algorithm SP2 finds the minimum number of channels required in each cell. Algorithm MP extends algorithm SP1 to a multicell system and provides the prioritized channel assignment for all calls in the system. The algorithms are very fast and are appropriate for the fair allocation of frequency channels among cells.>
Se-Hyun Oh, Dong-Wan Tcha
IEEE Trans. Commun.1