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

Yanfei He

dblp:166/1846 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-1829-9747ORCID · corroborated

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

Computer networks · 3 · 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 · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobile networks › mobile network architecture › cellular network architecture
dual connectivity
0.312018
Optimal Resource Allocations for Mobile Data Offloading via Dual-Connectivity · IEEE Trans. Mob. Comput. 2018
Cellular and mobile networks
mobile data offloading
0.312018
Optimal Resource Allocations for Mobile Data Offloading via Dual-Connectivity · IEEE Trans. Mob. Comput. 2018
Algorithmic game theory and mechanism design
resource allocation
0.112018
Optimal Resource Allocations for Mobile Data Offloading via Dual-Connectivity · IEEE Trans. Mob. Comput. 2018

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

decomposition · 0.7convex optimization · 0.7
YearPublicationVenuePosition
2018 Optimal Resource Allocations for Mobile Data Offloading via Dual-Connectivity
abstract
The rapid growth of mobile traffic has heavily overloaded the cellular networks, making it increasingly desirable to offload mobile users' (MUs') traffic to small-cell networks. In this paper, we study the MUs' optimal uplink traffic offloading scheme based on the new paradigm of small-cell dual-connectivity (DC). Through DC, an MU can flexibly schedule its traffic between a macro-cell base station (BS) and a small-cell access point (AP) via two different radio interfaces. To optimize the overall network radio resource usage, we jointly optimize the BS' bandwidth allocation as well as the MUs' traffic scheduling and power allocation. Specifically, for reducing the bandwidth usage, the BS prefers to allocate the MUs small amount of bandwidth to encourage the MUs to utilize the small-cell networks. However, excessive traffic offloading can lead to severe interferences among MUs, which increase the MUs' power consumption. Hence, our joint optimization strikes a proper balance between these two aspects. Despite the non-convexity of the proposed joint optimization problem, we propose an efficient algorithm to compute the optimal offloading solution. The key idea is to exploit the layered-structure of the joint optimization problem, and decompose it into the BS' bandwidth allocation problem (on the top-level) and the MUs' traffic scheduling and power allocation problem (as a subproblem). Such a decomposition enables us to exploit the hidden convexity of the MUs' problem and the monotonic structure of the BS' problem for an effective algorithm design. Numerical results show that our proposed algorithm can achieve the global optimum solution with significantly reduced computational time. Moreover, the proposed traffic offloading scheme can significantly reduce the overall system cost, in comparison with using the fixed bandwidth allocation or traffic scheduling schemes.
Yuan Wu 0001, Yanfei He, Li Ping Qian 0001, Jianwei Huang 0001, Xuemin Shen
IEEE Trans. Mob. Comput.2
2016 Traffic scheduling and power allocations for mobile data offloading via dual-connectivity
abstract
In this paper, we investigate how the mobile users (MUs) can effectively offload traffic by taking advantage of the capability of dual-connectivity, which enables an MU to simultaneously communicate with a macro base station (BS) and a small-cell access point (AP) via two radio-interfaces. We formulate an optimization problem that jointly determines each MU's traffic schedule (between the BS and AP) and power allocations (between two radio-interfaces), with the objective to minimize all MUs' total cost. We first propose an effective scheme to characterize the feasibility of the joint optimization problem. Then, by exploiting the layered structure, we propose an efficient layered scheme to solve it. Numerical results are provided to validate the proposed schemes and show the performance gain via properly offloading MUs' traffic via dual-connectivity.
Yuan Wu 0001, Yanfei He, Li Ping Qian 0001, Xuemin Shen
ICC2
2015 Optimal Power Allocations for Two-Users Spectrum Sharing Cognitive Radio with Interference Limit
Yanfei He, Yuan Wu 0001, Jiachao Chen, Qinglin Zhao, Weidang Lu
WASA1