Yingmeng Hu

Yingmeng Hu

Auto-generated profile, based on publicly available information

Yingmeng Hu

China Satellite Network Innovation Company Ltd., Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GXGao Xiangqiang
Gao Xiangqiang
YHYingmeng Hu
Yingmeng Hu
YSYingzhao Shao
Yingzhao Shao
HZHangyu Zhang
Hangyu Zhang
YLYang Liu
Yang Liu
JZJianhua Zhang
Jianhua Zhang
With the rapid development of large low Earth orbit (LEO) satellite constellations, satellite edge computing is an emerging topic to provide computing services for Internet of Things (IoT) users, which are not in the coverage of terrestrial networks. For computation offloading in satellite edge computing, it is still challenging to allocate the network resources on-demand for IoT users to improve service experience while reducing energy consumption, since user tasks may be offloaded between different satellites by inter-satellite links (ISLs). In this article, we study the joint optimization problem of computation offloading and resource allocation in cooperative satellite edge computing. Then, a hierarchical dynamic resource allocation (HDRA) algorithm for computation offloading is proposed by introducing breadth first search (BFS) and greedy to tackle the problem, the aim is to minimize service delay and energy consumption jointly. We conduct the experiments to evaluate the performance of the proposed HDRA algorithm, compared with two baselines of BFS-PSO and Gurobi. Experimental results show that the proposed HDRA algorithm can address the formulated problem effectively in satellite edge computing and obtain the results of computation offloading and resource allocation in a low running time.

14 April 2023 in IEEE Sensors Journal
Verified
Journal Article
Closed access
YHYingmeng Hu
Yingmeng Hu
YLYan Liu
Yan Liu
AKAryan Kaushik
Aryan Kaushik
CMChristos Masouros
Christos Masouros
JTJohn Thompson
John Thompson
In some real-time Internet of Things (IoT) applications, the timeliness of sensor data is very important for the performance of a system. How to collect the data of sensor nodes is a problem to be solved for an unmanned aerial vehicle (UAV) in a specified area, where different nodes have different timeliness priorities. To efficiently collect the data, a guided search deep reinforcement learning (GSDRL) algorithm is presented to help the UAV with different initial positions to independently complete the task of data collection and forwarding. First, the data collection process is modeled as a sequential decision problem for minimizing the average age of information or maximizing the number of collected nodes according to specific environment. Then, the data collection strategy is optimized by the GSDRL algorithm. After training the network using the GSDRL algorithm, the UAV has the ability to perform autonomous navigation and decision-making to complete the complexity task more efficiently and rapidly. Simulation experiments show that the GSDRL algorithm has strong adaptability to adverse environments, and obtains a good strategy for the UAV data collection and forwarding.

5 September 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
YHYingmeng Hu
Yingmeng Hu
LPLin Peng
Lin Peng
YLYan Liu
Yan Liu
To solve the problem of wireless access congestion caused by massive users to access the network, this paper proposes a NOMA random access scheme with dynamic access class barring (ACB) factors (DNRA). We first analyze the access probability of each user, then estimate the remaining number of users. To maximize the system throughput, the ACB factor is optimized by the remaining number of the users to improve the access probabilities of the users. Simulation results show that when compared with the orthogonal multiple random access algorithm with a fixed ACB factor (FORA) and a dynamic ACB factor (DORA) for the number of users m 0 = 60, the throughput of the DNRA algorithm can be increased by about 58.85% and 35.27%, respectively.

27 February 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YHYing Meng Hu
Ying Meng Hu
RLRongke Liu
Rongke Liu
HBHongxiu Bian
Hongxiu Bian
DLDaiyi Lyu
Daiyi Lyu
In order to facilitate reliable and efficient data transmission in time varying environments, a block dynamic decoding (BDD) algorithm for spinal codes is proposed in this paper. First, the code tree is divided into several decoding units to scatter the decoding complexity. According to the results of the last decoding, the decoder will modify the scope of nodes accessed with dynamic parameters, which improves the execution efficiency of the algorithm. Furthermore, the complexity and related parameters of the algorithm are analyzed and verified by some simulations. The results show that the proposed algorithm has the ability to enhance the bandwidth efficiency (or Rate) performance, and to reduce both complexity and frame error rate.

17 March 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YHYingmeng Hu
Yingmeng Hu
RLRongke Liu
Rongke Liu
AKAryan Kaushik
Aryan Kaushik
JTJohn Thompson
John Thompson
To achieve an efficient and reliable data transmission in time-varying conditions, a novel non-orthogonal multiple access (NOMA) transmission scheme based on rateless codes (NOMA-RC) is proposed in the multicast system in this paper. Using rateless codes at the packet level, the system can generate enough encoded data packets according to users' requirements to cope with adverse environments. The performance of the NOMA-RC multicast system with delay constraints is analyzed over Rayleigh fading channels. The closed-form expressions for the frame error ratio and the average transmission time are derived for two cases which are a broadcast communication scenario (Scenario 1) and a relay communication scenario (Scenario 2). Under the condition that the quality of service for the edge user is satisfied, an optimization model of power allocation is established to maximize the sum rate. Simulation results show that Scenario 2 can provide better block error ratio performance and exhibit less transmission time than Scenario 1. When compared with orthogonal multiple access (OMA) with rateless codes system, the proposed system can save on the transmission time and improve the system throughput.

19 October 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YHYingmeng Hu
Yingmeng Hu
RLRongke Liu
Rongke Liu
HBHongxiu Bian
Hongxiu Bian
GXGao Xiangqiang
Gao Xiangqiang
This paper investigates the sub-channels and power allocation issue in the multi-carrier NOMA communication system. To maximize the sum rate of the system, we design a fast dynamic resource allocation (FDRA) algorithm. The algorithm can quickly identify the interference nodes with poor channel conditions, and reduces the search complexity of the algorithm. By jointly optimizing sub-carrier and power resource allocation, the proposed scheme can take full advantage of the channel capacity, and maximize the system performance while ensuring the quality of service (QoS) of each user. Simulation results show that when compared with the joint resource allocation (JRA) algorithm and the genetic algorithm (GA), the FDRA algorithm can achieve the best performance on the complexity and the sum rate of the system. Thus, the proposed algorithm can provide a fast and efficient resource allocation scheme for the downlink multi-carrier NOMA systems.