YLYiming Liu

Yiming Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yiming Liu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • RIS-Assisted Joint Sensing and Communications via Fractionally Constrained Fractional Programming

    by Yiming Liu, Kareem M. Attiah, Wei Yu

    This paper studies an uplink dual-functional sensing and communication system aided by a reconfigurable intelligent surface (RIS), whose reflection pattern is optimally configured to trade-off sensing and communication functionalities. Specifically, the Bayesian Cramér-Rao lower bound (BCRLB) for estimating the azimuth angle of a sensing user is minimized while ensuring the signal-to-interference-plus-noise ratio constraints for communication users. We show that this problem can be formulated as a novel fractionally constrained fractional programming (FCFP) problem. To deal with this highly nontrivial problem, we extend a quadratic transform technique, originally proposed to handle optimization problems containing fractional structures only in objectives, to the scenario where the constraints also include ratios. First, we consider the case where the fading coefficient is known. Using the quadratic transform, the FCFP problem can be turned into a sequence of subproblems that are convex except for the constant-modulus constraints which can be tackled using a penalty-based approach. To further reduce the computational complexity, we leverage the constant-modulus conditions and propose a novel linear transform. This new transform enables the FCFP problem to be turned into a sequence of linear programming (LP) subproblems, which can be solved with linear complexity in the dimension of reflecting elements. Then, we consider the case where the fading coefficient is unknown. A modified BCRLB is used to make the problem more tractable, and the proposed quadratic transform-based algorithm is used to solve the problem. Numerical results unveil nontrivial and effective reflection patterns that can be synthesized by the RIS to facilitate both communication and sensing functionalities.


  • Multimodal Visual Image Based User Association and Beamforming Using Graph Neural Networks

    by Yinghan Li, Yiming Liu, Wei Yu

    This paper proposes an approach that leverages multimodal data by integrating visual images with radio frequency (RF) pilots to optimize user association and beamforming in a downlink wireless cellular network under a max-min fairness criterion. Traditional methods typically optimize wireless system parameters based on channel state information (CSI). However, obtaining accurate CSI requires extensive pilot transmissions, which lead to increased overhead and latency. Moreover, the optimization of user association and beamforming is a discrete and non-convex optimization problem, which is challenging to solve analytically. In this paper, we propose to incorporate visual camera data in addition to the RF pilots to perform the joint optimization of user association and beamforming. The visual image data help enhance channel awareness, thereby reducing the dependency on extensive pilot transmissions for system optimization. We employ a learning-based approach based on using first a detection neural network that estimates user locations from images, and subsequently two graph neural networks (GNNs) that extract features for system optimization based on the location information and the received pilots, respectively. Then, a multimodal GNN is constructed to integrate the features for the joint optimization user association and beamforming. Simulation results demonstrate that the proposed method achieves superior performance, while having low computational complexity and being interpretable and generalizable, making it an effective solution as compared to traditional methods based only on RF pilots.


  • Passive Beamforming for Practical RIS-Assisted Communication Systems With Non-Ideal Hardware

    by Yiming Liu, Rui Wang, Zhu Han

    Reconfigurable intelligent surface (RIS) technology is a promising solution to improve the performance of existing wireless communication systems. To achieve its cost-effectiveness advantage, there inevitably exist certain hardware impairments in the system, leading to severe performance degradation. Some existing works have considered such problems under hardware impairments of transceivers but neglected the practical model of RIS. Moreover, their performance still leaves room to improve. To this end, the passive beamforming is redesigned in this paper, taking into account both transceiver hardware impairments and the practical RIS model. We tackle the fractional structure of the problem by employing the quadratic transform. The remaining sub-problems are addressed utilizing the penalty-based method and the difference-of-convex programming. Since we can provide closed-form solutions for all sub-problems, our method is highly efficient. The numerical results also demonstrate the superiority of our method. Most importantly, our solution is able to reduce unnecessary resource consumption in practical scenarios. This is beneficial in the trend of adopting mmWave and MIMO, which involve expensive hardware and consume immoderate energy


  • Hierarchical Reinforcement Learning for Relay Selection and Power Optimization in Two-Hop Cooperative Relay Network

    by Yuanzhe Geng, Erwu Liu, Rui Wang, Yiming Liu

    In this paper, we study the outage probability minimizing problem in a two-hop cooperative relay network. To reduce outage probability, existing studies propose many schemes for relay selection and power allocation, which are usually based on the assumption of exact channel state information (CSI). However, it is difficult to obtain perfect instantaneous CSI in practical situations where channel states change rapidly, and thus traditional methods would not perform well. Considering these factors, we turn to the emerging reinforcement learning (RL) methods for solutions. RL methods do not need any prior knowledge of CSI, but use neural network for approximation and decision after interacting with communication environment. Nevertheless, conventional RL methods, including most deep reinforcement learning (DRL) methods, cannot perform well when the search space is too large. In addition, non-stationarity is a common problem when using hierarchical reinforcement learning (HRL), which is caused by the changing behavior in different hierarchies. Therefore, we first propose a DRL framework with an outage-based reward function, which is then used as a baseline. Then, we further design an HRL framework and training algorithm. By decomposing relay selection and power allocation into two hierarchical optimization objectives, and combining on- policy and off-policy methods in the HRL framework, our method successfully address the sparse reward and non-stationary problem. Simulation results reveal that compared with traditional DRL method, the proposed HRL training algorithm can converge faster and reduce the outage probability by 8% in two-hop relay network with the same outage threshold.


  • Asymptotic Achievability of the Cramér-Rao Lower Bound of Channel Estimation for Reconfigurable Intelligent Surface Aided Communication Systems

    by Yiming Liu, Erwu Liu, Rui Wang, Zhu Han, Binyu Lu

    To achieve the joint active and passive beamforming gains in the reconfigurable intelligent surface assisted millimeter wave system, the reflected cascade channel needs to be accurately estimated. Many strategies have been proposed in the literature to solve this issue. However, whether the Cramér-Rao lower bound (CRLB) of such estimation is achievable still remains uncertain. To fill this gap, we first convert the channel estimation problem into a sparse signal recovery problem by utilizing the properties of discrete Fourier transform matrix and Kronecker product. Then, a joint typicality-based estimator is utilized to carry out the signal recovery task. We show that, through both mathematical proofs and numerical simulations, the solution proposed in this letter can asymptotically achieve the CRLB.


  • Deep Deterministic Policy Gradient for Relay Selection and Power Allocation in Cooperative Communication Network

    by Yuanzhe Geng, Erwu Liu, Rui Wang, Yiming Liu, Jie Wang, Gang Shen, Zhao Dong

    Perfect channel state information (CSI) is usually required when considering relay selection and power allocation in cooperative communication. However, it is difficult to get an accurate CSI in practical situations. In this letter, we study the outage probability minimizing problem based on optimizing relay selection and transmission power. We propose a prioritized experience replay aided deep deterministic policy gradient learning framework, which can find an optimal solution by dealing with continuous action space, without any prior knowledge of CSI. Simulation results reveal that our approach outperforms reinforcement learning based methods in existing literatures, and improves the communication success rate by about 5%.


  • Open Access

    Efficient and Accurate Target Localization in Underwater Environment

    by Inam Ullah, Yiming Liu, Xin Su, Pankoo Kim

    Localization is the basic feature of wireless sensor networks (WSN) and estimating the time difference of arrival (TDoA), and angle of arrival (AoA) is the most used schemes for localization. Underwater wireless sensor network (UWSN) is extensively used for data collection in an underwater environment for both military and civilian applications. Nevertheless, efficient and accurate localization algorithms are essential for the UWSN because of the dynamical property of the underwater surrounding. Also, data management, collection, and processing for WSNs have become a more active topic nowadays in computer science, such as database system and data mining. The objective of deploying the WSNs applications is to collect the real-time data, which has very challenging due to the capacity of communication and high data generated by WSNs. For this purpose, the time and location are the basic aspects when a sensor collects data, especially for the case of location-aware data. Many researchers have studied the underwater sensor nodes localization and they have considered the sensor location where the data is collected and most of them focused on the fixed sensor nodes. In this research work, energy efficient and accurate localization schemes are presented named as distance-based and angle-based schemes for the underwater environment with relatively less energy consumption and mean estimation errors (MEEs). The proposed schemes mainly focus on the localization of underwater nodes and especially on the MEEs in localization. The extensive simulation is performed to compare the proposed schemes with other counterpart schemes. The results show that the proposed schemes outperform other counterpart schemes in terms of MEEs of localization and energy consumption.