Di Yuan
Uppsala University
269 Papers
2.2K Citations
Di Yuan is an academic researcher from Uppsala University. The author has contributed to research in topics: Wireless network & Scheduling (computing). The author has an hindex of 37, co-authored 268 publications. Previous affiliations of Di Yuan include University of Maryland, College Park & Linköping University.
Chat about Author
Papers
Optimizing the Tradeoff between Signaling and Reconfiguration: A Novel Bi-Criteria Solution Approach for Revising Tracking Area Design
Sara Modarres Razavi,Di Yuan,Fredrik Gunnarsson,Johan Moe +3 more
- 26 Apr 2009
TL;DR: Improving the tracking areas (TA) configuration over time to reduce signaling overhead is vital for location management of Long Term Evolution networks.
8
Robot Trajectory Planning With QoS Constrained IRS-assisted Millimeter-Wave Communications
Cristian Tatino,Nikolaos Pappas,Di Yuan +2 more
- 01 Jun 2021
TL;DR: In this paper, the joint optimization of trajectory and beamforming of a wirelessly connected robot using intelligent reflective surface (IRS)-assisted millimeter-wave (mm-wave) communications is considered.
8
Coverage planning for optimizing HSDPA performance and controlling R99 soft handover
TL;DR: This paper develops mathematical modeling and optimization approaches to bring the benefit of power saving enabled by optimizing non-uniform CPICH to enhance HSDPA performance, while preserving a desired degree of soft handover for R99.
Mathematical modeling for optimal design of in-building distributed antenna systems
TL;DR: This work considers optimal deployment of the passive IB-DAS, focusing on mathematical optimization models based on integer programming, for the topology design and optimal equipment selection of IB- DAS.
7
Optimizing compatible sets in wireless networks through integer programming
Yuan Li,Michal Pioro,Michal Pioro,Di Yuan,Jinshu Su +4 more
- 01 Jun 2014
TL;DR: A comparison of the two basic approaches to expressing the signal-to-interference-plus-noise-ratio within integer programming is presented, and matching inequalities that improve the upper bounds achievable with the twobasic approaches are introduced.