Yu Chen

Yu Chen

Auto-generated profile, based on publicly available information

Yu Chen

National Engineering Research Center of Mobile Network Technologies, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 February 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
ZCZhi Chai
Zhi Chai
KWKai Kit Wong
Kai Kit Wong
KTKin-Fai Tong
Kin-Fai Tong
YCYu Chen
Yu Chen
YZYangyang Zhang
Yangyang Zhang
Fluid antenna system promises to obtain enormous diversity in the small space of a mobile device by switching the position of the radiating element to the most desirable position from a large number of prescribed locations of the given space. Previous researches have revealed the promising performance of fluid antenna systems if the position with the maximum received signal-to-noise ratio (SNR) is chosen. However, selecting the best position, referred to as port selection , requires a huge number of SNR observations from the ports and may prove to be infeasible. This letter tackles this problem by devising a number of fast port selection algorithms utilizing a combination of machine learning methods and analytical approximation when the system observes only a few ports. Simulation results illustrate that with only 10% of the ports observed, more than an order of magnitude reduction in the outage probability can be achieved. Even in the extreme cases where only one port is observed, considerable performance improvements are possible using the proposed algorithms.

4 April 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YYYang Yang
Yang Yang
SZShuang Zhao
Shuang Zhao
WZWuxiong Zhang
Wuxiong Zhang
YCYu Chen
Yu Chen
XLXiliang Luo
Xiliang Luo
JWJun Wang
Jun Wang
Vehicular ad hoc networks, wireless sensor networks, Internet of Things, and mobile device-to-device communications can be modeled as different homogeneous fog networks, wherein similar terminals/things/devices/nodes are sharing their computation, communication, and storage resources in the neighborhood for achieving better system performance through effective collaborations. It is very desirable, but quite challenging, to simultaneously reduce service delay and energy consumption in such networks for delay-sensitive and energyconstraint applications, e.g., virtual reality and online 3-D gaming on mobile devices. In this paper, a cross-layer analytical framework is developed to formulate and study the balance between service delay and energy consumption. An effective control parameter V is derived to characterize their tradeoff relationship during dynamic task scheduling processes in fog networks. Combining this analysis with Lyapunov optimization techniques, a novel delay energy balanced tasking scheduling (DEBTS) algorithm is proposed to minimize the overall energy consumption while reducing average service delay and delay jitter. It is proved that DEBTS can achieve the theoretical [O(1/V), O(V)] tradeoff between these two performance metrics. Further, extensive simulation results show that DEBTS can offer much better delay-energy performance in task scheduling challenges. Specifically, for a typical V value of 4 × 10 4 , DEBTS can save 26% and 29% more energy, and at the same time, reduce average service delay by 29% and 32%, than traditional random scheduling and least busy scheduling algorithms, respectively.

16 November 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
KWKai Kit Wong
Kai Kit Wong
KTKin-Fai Tong
Kin-Fai Tong
YCYu Chen
Yu Chen
YZYangyang Zhang
Yangyang Zhang
Massive connectivity over wireless channels relies on aggressive spectrum sharing techniques. Conventionally, this may be achieved by sophisticated signal processing and optimization of applying multiple antennas and/or complex multiuser decoding at each user terminal (UT). Different from previous methods, this letter proposes a radical approach for massive connectivity, which employs fluid antenna at each UT to exploit the interference null, created naturally by multipath propagation and the randomness of UT’s data, on a symbol-by-symbol basis for multiple access. The proposed fast fluid antenna multiple access (f-FAMA) system adopts a large, distributed antenna array at the base station (BS) to transmit each UT’s signal from each of the BS antennas and lets each UT overcome the interference on its own using its fluid antenna. Our main contribution is a technique that estimates the best port of fluid antenna for reception at every symbol instance. The proposed approach needs only cross-correlation calculations and single-user decoding at each UT and requires no precoding at the BS. Simulation results demonstrate that for a BS with 16 antennas supporting 16 co-channel users, a multiplexing gain of 14.87 is achieved even when the channel has a strong line-of-sight (LoS) and multipath is few. The multiplexing gain can also rise to 24.36 if a 30-antenna BS is serving 30 co-channel users.

21 March 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KWKai Kit Wong
Kai Kit Wong
KTKin-Fai Tong
Kin-Fai Tong
YCYu Chen
Yu Chen
YZYangyang Zhang
Yangyang Zhang
CCChan-Byoung Chae
Chan-Byoung Chae
Multiple access can be realized by utilizing the spatial moments of deep fades, using fluid antennas. The interference immunity for fluid antenna multiple access (FAMA), nevertheless, comes with the requirement of a large number of ports at each user. To alleviate this, we study the synergy between opportunistic scheduling and FAMA. A large pool of users permits selection of favourable users for FAMA and decreases the outage probability at each selected user. Our objective is to characterize the benefits of opportunistic scheduling in FAMA. In particular, we derive the multiplexing gain of the opportunistic FAMA network in closed form and upper bound the required number of users in the pool to achieve a given multiplexing gain. Also, we find a lower bound on the required outage probability at each user for achieving a given network multiplexing gain, from which the advantage of opportunistic scheduling is illustrated. In addition, we investigate the rate of increase of the multiplexing gain with respect to the number of users in the pool, and derive a tight approximation to the multiplexing gain, expressed in closed form. As a key result of our analysis, we obtain an operating condition on the product of the number of users in the pool and the number of ports at each fluid antenna that ensures a high multiplexing gain. Numerical results demonstrate clear benefits of opportunistic scheduling in FAMA networks, and corroborate our analytical results.

22 September 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
HHHanjiang Hong
Hanjiang Hong
KWKai Kit Wong
Kai Kit Wong
CCChan-Byoung Chae
Chan-Byoung Chae
HXHao Xu
Hao Xu
XGXinghao Guo
Xinghao Guo
YZYangyang Zhang
Yangyang Zhang
The explosive growth of teletraffic, fueled by the convergence of cyber-physical systems and data-intensive applications, demands a multidisciplinary suite of innovative solutions across the physical and network layers. As part of that suite, this paper advocates hardware-agnostic fluid antenna systems (FAS), which treat the radiating aperture as a reconfigurable physical-layer resource rather than a fixed component. By rapidly adjusting position, shape, or pattern, independent of the specific conductive medium or antenna embodiment, FAS exposes additional spatial degrees of freedom (DoF) that enable channel-aware diversity, opportunistic beamforming, and interference suppression, even with a single radio-frequency (RF) chain and compact form factors. This flexibility allows adaptation to fading, blockage, and traffic dynamics, improving outage, spectral efficiency, and energy efficiency, and positioning FAS as a promising candidate for next-generation communication networks. This paper provides a comprehensive survey of the state of the art in FAS research. We begin by examining key application scenarios in which FAS offers significant advantages. We then present the fundamental principles of FAS, covering channel measurement and modeling, single-user configurations, and the multi-user fluid antenna multiple access (FAMA) framework. Following this, we delve into key network-layer techniques such as quality-of-service (QoS) provisioning, power allocation, and content placement strategies. We conclude by identifying prevailing challenges and outlining future research directions to support the continued development of FAS in next-generation wireless networks.

18 November 2024 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
BXBowen Xu
Bowen Xu
YCYu Chen
Yu Chen
qimei cuiqimei cui
qimei cui
XTXiaofeng Tao
Xiaofeng Tao
KWKai Kit Wong
Kai Kit Wong
Fluid antenna system (FAS) has emerged to give comparable performance to conventional multiple-input multiple-output (MIMO) systems with fewer radio-frequency (RF) chains. The performance of FAS depends on the accuracy of the channel state information (CSI) estimation. In this letter, we develop a sparse Bayesian learning (SBL) algorithm and an improved SBL algorithm to estimate FAS’s CSI. Simulation results demonstrate that both our proposed algorithms achieve higher accuracy in channel estimation compared to existing algorithms.