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

Hao-Zhong Hou

dblp:409/5662 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0007-6749-5510ORCID · reported

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

Computer networks · 1 · 1 first-author · 1 since 2021

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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
radio access networks
0.912025
Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association · IEEE Trans. Commun. 2025
Cellular and mobile networks › uplink transmission
uplink performance analysis
0.912025
Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association · IEEE Trans. Commun. 2025
Cellular and mobile networks
user association
0.912025
Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association · IEEE Trans. Commun. 2025
Performance modeling and evaluation › stochastic modeling
stochastic geometry
0.312025
Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association · IEEE Trans. Commun. 2025

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

stochastic geometry · 1.7poisson cluster process · 1.7area spectral efficiency optimization · 1.7
YearPublicationVenuePosition
2025 Uplink Performance Analysis and Optimization for Dense Clustered Wireless Networks With Nearest-BS Association
abstract
While Poisson Cluster Process (PCP) has been used extensively in the literature for analyzing large-scale clustered wireless networks, related work differs in terms of how the BS (Base Station) distribution and UE (User Equipment) association strategy are modeled in this context. Different from related work that places BSs via Poisson Point Process (PPP) independent of the UE distribution, we consider a more practical scenario where the BSs are located at the parent points of PCP. Furthermore, while a lot of analysis often assumes each UE to be associated with the BS at the parent point of the cluster it belongs to, such a model may result in bias for dense networks where clusters of UEs may overlap with each other. To address such a pitfall, in this work we consider “nearest-BS” association such that a UE may be associated with a nearby BS that is the parent point of another cluster. While there does exist analysis on downlink transmissions for such a network scenario, we find that analysis for uplink performance is more challenging and has yet to be developed in the literature. To proceed, we start from the analytical framework established by related work but derive new expressions for the aggregate uplink interference from different UE clusters in the network. We derive accurate analytical upper and lower bounds for the transmission success probability and we are able to arrive at a closed-form expression for the special case with a path loss exponent of 4. Furthermore, we derive the asymptotic performance bound for ultra-dense networks and investigate the problem of optimizing the area spectral efficiency (ASE) with respect to the design of the signal-to-interference-plus-noise ratio (SINR) threshold. By leveraging the closed-form expression that we have derived, the problem can be solved effectively to obtain the optimal ASE in ultra-dense networks. Evaluation results show that our analysis is correct and the derived bounds are accurate, thus motivating further investigation based on the derived results.
Hao-Zhong Hou, Hong-Chen Huang, Cheng-Yeh Chen, Hung-Yun Hsieh
IEEE Trans. Commun.1