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.

Yijun Piao

dblp:259/9625 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-0991-4509ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

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 · 46% Cellular and mobile networks · 30% Network optimization and economics · 23%

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

TopicWeightPapersLastEvidence papers
Wireless networking › random access
access class barring
0.412020
Recycling Random Access Opportunities with Secondary Access Class Barring · IEEE Trans. Mob. Comput. 2020
Cellular and mobile networks
radio access networks
0.412020
Recycling Random Access Opportunities with Secondary Access Class Barring · IEEE Trans. Mob. Comput. 2020
Wireless networking
random access
0.412020
Recycling Random Access Opportunities with Secondary Access Class Barring · IEEE Trans. Mob. Comput. 2020
Network optimization and economics
resource allocation
0.412020
Recycling Random Access Opportunities with Secondary Access Class Barring · IEEE Trans. Mob. Comput. 2020
Cellular and mobile networks
green communications
0.112020
Recycling Random Access Opportunities with Secondary Access Class Barring · IEEE Trans. Mob. Comput. 2020

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

resource allocation optimization · 0.4markov chain analysis · 0.4
YearPublicationVenuePosition
2020 Recycling Random Access Opportunities with Secondary Access Class Barring
abstract
The random access procedure in cellular networks suffers from a congestion problem caused by massive access requests from a large number of devices. Since this congestion problem causes inefficient energy consumption and increases the random access delay, an efficient random access procedure is required for various types of devices. In this paper, we propose a new access control scheme to reduce the access delay and the energy consumption by mining hidden random access resources. The proposed scheme consists of the random access procedure and the resource allocation algorithm. The proposed random access procedure utilizes the multiple access class barring (ACB) procedure to mine and utilize the hidden random access opportunities (RAOs) in order to increase the number of successfully admitted devices. The proposed algorithm optimizes the resource allocation parameters according to the estimated number of devices. We provide an analytical model for the proposed scheme by using an embedded Markov chain. The proposed scheme is shown to reduce the random access delay and the energy consumption for green communications by achieving 53 percent maximum efficiency compared to 37 percent in the conventional schemes with the ACB and random access procedure.
Yunmin Kim, Yijun Piao, Tae-Jin Lee 0001
IEEE Trans. Mob. Comput.3