Ye Hu

Ye Hu

Auto-generated profile, based on publicly available information

Ye Hu

Department of Industrial and Systems Engineering, University of Miami, Coral Gables, FL, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
16 June 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YHYe Hu
Ye Hu
MCMingzhe Chen
Mingzhe Chen
Walid SaadWalid Saad
Walid Saad
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
SCShuguang Cui
Shuguang Cui
In this paper, the problem of the trajectory design for a group of energy-constrained drones operating in dynamic wireless network environments is studied. In the considered model, a team of drone base stations (DBSs) is dispatched to cooperatively serve clusters of ground users that have dynamic and unpredictable uplink access demands. In this scenario, the DBSs must cooperatively navigate in the considered area to maximize coverage of the dynamic requests of the ground users. This trajectory design problem is posed as an optimization framework whose goal is to find optimal trajectories that maximize the fraction of users served by all DBSs. To find an optimal solution for this non-convex optimization problem under unpredictable environments, a value decomposition based reinforcement learning (VD-RL) solution coupled with a meta-training mechanism is proposed. This algorithm allows the DBSs to dynamically learn their trajectories while generalizing their learning to unseen environments. Analytical results show that, the proposed VD-RL algorithm is guaranteed to converge to a locally optimal solution of the non-convex optimization problem. Simulation results show that, even without meta-training, the proposed VD-RL algorithm can achieve a 53.2% improvement of the service coverage and a 30.6% improvement in terms of the convergence speed, compared to baseline multi-agent algorithms. Meanwhile, the use of the meta-training mechanism improves the convergence speed of the VD-RL algorithm by up to 53.8% when the DBSs must deal with a previously unseen task.

19 March 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YHYe Hu
Ye Hu
MCMingzhe Chen
Mingzhe Chen
Walid SaadWalid Saad
Walid Saad
In this paper, the problem of user association and resource allocation is studied for an integrated satellite-drone network (ISDN). In the considered model, drone base stations (DBSs) provide downlink connectivity, supplementally, to ground users whose demand cannot be satisfied by terrestrial small cell base stations (SBSs). Meanwhile, a satellite system and a set of terrestrial macrocell base stations (MBSs) are used to provide resources for backhaul connectivity for both DBSs and SBSs. For this scenario, one must jointly consider resource management over satellite-DBS/SBS backhaul links, MBS-DBS/SBS terrestrial backhaul links, and DBS/SBS-user radio access links as well as user association with DBSs and SBSs. This joint user association and resource allocation problem is modeled using a competitive market setting in which the transmission data is considered as a good that is being exchanged between users, DBSs, and SBSs that act as “buyers”, and DBSs, SBSs, MBSs, and the satellite that act as “sellers”. In this market, the quality-of-service (QoS) is used to capture the quality of the data transmission (defined as good), while the energy consumption the buyers use for data transmission is the cost of exchanging a good. According to the quality of goods, sellers in the market propose quotations to the buyers to sell their goods, while the buyers purchase the goods based on the quotation. The buyers profit from the difference between the earned QoS and the charged price, while the sellers profit from the difference between earned price and the energy spent for data transmission. The buyers and sellers in the market seek to reach a Walrasian equilibrium, at which all the goods are sold, and each of the devices’ profit is maximized. A heavy ball based iterative algorithm is proposed to compute the Walrasian equilibrium of the formulated market. Analytical results show that, with well-defined update step sizes, the proposed algorithm is guaranteed to reach one Walrasian equilibrium. Simulation results show that, at the achieved Walrasian equilibrium solution, the proposed algorithm can yield a two-fold gain in terms of the number of radio access links with a data rate of over 40 Mbps, and a three-fold gain in terms of the number of backhaul links with a data rate greater than 1.6 Gbps.

6 March 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ZZZhouxiang Zhao
Zhouxiang Zhao
ZYZhaohui Yang
Zhaohui Yang
YHYe Hu
Ye Hu
CZChen Zhu
Chen Zhu
MSMohammad Shikh-Bahaei
Mohammad Shikh-Bahaei
KHKaibin Huang
Kaibin Huang
Semantic communication is envisioned as a key technology for future wireless networks due to its high communication efficiency. However, research combining semantic communication and advanced multiple access techniques, such as rate splitting multiple access (RSMA), is still lacking. In this paper, the problem of joint communication and computation resource allocation for probabilistic semantic communication (PSCom) with RSMA is investigated. In the considered model, the base station (BS) needs to transmit a large amount of data to multiple users with 1-layer RSMA. Due to limited communication resources, the BS is required to utilize semantic communication techniques to compress the original data. In this paper, we utilize knowledge graphs to represent semantic information and employ probabilistic graphs, which are shared between the BS and users, to further compress the knowledge graphs. The BS can use the probabilistic graph to compress the data to be transmitted, while the user can recover the compressed semantic information using the same shared probabilistic graph. The additional computation power required for semantic information compression inevitably results in a reduction in transmission power due to the limited total power budget. Considering the effect of semantic compression ratio, the semantic rate expression for RSMA is first obtained. Then, based on the obtained rate expression, an optimization problem is formulated with the aim of maximizing the sum of semantic rates of all users under total power, semantic compression ratio, and rate allocation constraints. To tackle this problem, an iterative algorithm is proposed, where the semantic compression ratio subproblem is addressed using a greedy algorithm, and the rate allocation and transmit beamforming design subproblem is solved using a successive convex approximation method. Numerical results validate the effectiveness of the proposed scheme.

28 March 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YZYujiao Zhu
Yujiao Zhu
MCMingzhe Chen
Mingzhe Chen
SWSihua Wang
Sihua Wang
YHYe Hu
Ye Hu
YLYuchen Liu
Yuchen Liu
Changchuan YinChangchuan Yin
Changchuan Yin
In this paper, the problem of using one active unmanned aerial vehicle (UAV) and four passive UAVs to localize a 3D target UAV in real time is investigated. In the considered model, each passive UAV receives reflection signals from the target UAV, which are initially transmitted by the active UAV. The received reflection signals allow each passive UAV to estimate the signal transmission distance which will be transmitted to a base station (BS) for the estimation of the position of the target UAV. Due to the movement of the target UAV, each active/passive UAV must optimize its trajectory to continuously localize the target UAV. Meanwhile, since the accuracy of the distance estimation depends on the signal-to-noise ratio of the transmission signals, the active UAV must optimize its transmit power. This problem is formulated as an optimization problem whose goal is to jointly optimize the transmit power of the active UAV and trajectories of both active and passive UAVs so as to maximize the target UAV positioning accuracy. To solve this problem, a Z function decomposition based reinforcement learning (ZD-RL) method is proposed. Compared to value function decomposition based RL (VD-RL), the proposed method can find the probability distribution of the sum of future rewards to accurately estimate the expected value of the sum of future rewards thus finding better transmit power of the active UAV and trajectories for both active and passive UAVs and improving target UAV positioning accuracy. Simulation results show that the proposed ZD-RL method can reduce the positioning errors by up to 39.4% and 64.6%, compared to VD-RL and independent deep RL methods, respectively.

1 January 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YHYe Hu
Ye Hu
ASAnibal Sanjab
Anibal Sanjab
Walid SaadWalid Saad
Walid Saad
In this paper, a novel anti-jamming mechanism is proposed to analyze and enhance the security of adversarial Internet of Battlefield Things (IoBT) systems. In particular, the problem is formulated as a dynamic psychological game between a soldier and an attacker. In this game, the soldier seeks to accomplish a time-critical mission by traversing a battlefield within a certain amount of time, while maintaining its connectivity with an IoBT network. The attacker, on the other hand, seeks to find the optimal opportunity to compromise the IoBT network and maximize the delay of the soldier’s IoBT transmission link. The soldier and the attacker’s psychological behavior are captured using tools from psychological game theory, with which the soldier’s and attacker’s intentions to harm one another are considered in their utilities. To solve this game, a novel learning algorithm based on Bayesian updating is proposed to find a -like psychological self-confirming equilibrium of the game.

27 February 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
Haonan TongHaonan Tong
Haonan Tong
MCMingzhe Chen
Mingzhe Chen
Jun ZhaoJun Zhao
Jun Zhao
YHYe Hu
Ye Hu
ZYZhaohui Yang
Zhaohui Yang
Changchuan YinChangchuan Yin
Changchuan Yin
This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods.