Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ningning Yu

dblp:246/3462 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Wireless sensing and localization · 35% Physical-layer communications · 35% Edge and fog computing · 30%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
open-set recognition
0.812024
Open Set Learning for RF-Based Drone Recognition via Signal Semantics · IEEE Trans. Inf. Forensics Secur. 2024
Wireless sensing and localization
RF sensing
0.812024
Open Set Learning for RF-Based Drone Recognition via Signal Semantics · IEEE Trans. Inf. Forensics Secur. 2024
Edge and fog computing
mobile edge computing
0.712023
Energy-Efficient Multi-Access Mobile Edge Computing With Secrecy Provisioning · IEEE Trans. Mob. Comput. 2023

Methods — techniques the papers use, named apart from their topics

swapping heuristic · 1.3convex optimization · 1.3texture extraction · 0.8short-time fourier transform · 0.8outlier analysis · 0.8clustering · 0.8
YearPublicationVenuePosition
2024 Open Set Learning for RF-Based Drone Recognition via Signal Semantics
abstract
The abuse of drones has raised critical concerns about public security and personal privacy, bringing an urgent requirement for drone recognition. Existing radio frequency (RF)-based recognition methods follow the assumption of the closed set, resulting in the unknown signals being misclassified as known classes. To address this problem, we propose a Signal Semantic-based open Set Recognition (S3R) method in this paper. First, the short-time Fourier transform is introduced to construct the signal spectra, decoupling the drone signals with other interference signals. Then, we design a texture extractor and a position extractor to extract the texture features and position features from the spectra, respectively. The extracted features are further fused and structurally optimized to construct distinguishable signal semantics. Based on the structural characteristics of signal semantics, an outlier analysis-based semantic classifier is proposed, which searches the outliers of each known class in the closed set as the bounding thresholds to detect unknown instances. Finally, the detected unknown instances are further classified into their exact classes by implementing clustering in a new semantic space, where semantics are augmented by introducing basic features from the intermediate layers of the texture extractor. Besides, a real-world spectrogram dataset of commonly-used drones is released, which includes 24 classes and covers 7 brands. Extensive experiments demonstrate that the proposed S3R method outperforms the state-of-the-art methods in terms of accuracy and generalizability for both the closed set and the open set.
Ningning Yu, Jiajun Wu 0020, Chengwei Zhou, Zhiguo Shi 0001, Jiming Chen 0001
IEEE Trans. Inf. Forensics Secur.1
2023 Energy-Efficient Multi-Access Mobile Edge Computing With Secrecy Provisioning
abstract
Thanks to the wide deployment of heterogeneous radio access networks (RANs) in the past decades, the emerging paradigm of multi-access mobile edge computing, which allows mobile terminals to simultaneously offload the computation-workloads to several different edge-computing servers via multi-RANs, has provided a promising scheme for enabling the computation-intensive mobile Internet services in future wireless systems. The broadcasting nature of radio transmission, however, may lead to a potential secrecy-outage during the offloading transmission. In this paper, we thus investigate the energy-efficient multi-access mobile edge computing with secrecy provisioning. Specifically, we first investigate the scenario of one wireless device's (WD's) multi-access offloading subject to a malicious node's eavesdropping. By characterizing the WD's secrecy based throughput in its offloading transmission, we formulate a joint optimization of the WD's multi-access computation offloading, secrecy provisioning, and offloading-transmission duration, with the objective of minimizing the WD's total energy consumption, while providing a guaranteed secrecy-outage during offloading and a guaranteed overall-latency in completing the WD's workload. Despite the non-convexity of this joint optimization problem, we exploit its layered structure and propose an efficient algorithm for solving it. Based on the study on the single-WD scenario, we further investigate the scenario of multiple WDs, in which a group of WDs sequentially execute the multi-access computation offloading, while subject to a malicious node's eavesdropping. Taking the coupling effect among different WDs into account, we propose a swapping-heuristic based algorithm (that uses our proposed single-WD algorithm as a subroutine) for finding the ordering of the WDs to execute the multi-access computation offloading, with the objective of minimizing all WDs’ total energy consumption. Extensive numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms. The results demonstrate that our algorithms can outperform some conventional fixed offloading scheduling scheme and randomized offloading ordering scheme.
Li Ping Qian 0001, Yuan Wu 0001, Ningning Yu, Daohang Wang, Fuli Jiang, Weijia Jia 0001
IEEE Trans. Mob. Comput.3
2021 NOMA Assisted Multi-Task Multi-Access Mobile Edge Computing via Deep Reinforcement Learning for Industrial Internet of Things
abstract
Multiaccess mobile edge computing (MA-MEC) has been envisioned as one of the key approaches for enabling computation-intensive yet delay-sensitive services in future industrial Internet of Things (IoT). In this article, we exploit nonorthogonal multiple access (NOMA) for computation offloading in MA-MEC and propose a joint optimization of the multiaccess multitask computation offloading, NOMA transmission, and computation-resource allocation, with the objective of minimizing the total energy consumption of IoT device to complete its tasks subject to the required latency limit. We first focus on a static channel scenario and propose a distributed algorithm to solve the joint optimization problem by identifying the layered structure of the formulated nonconvex problem. Furthermore, we consider a dynamic channel scenario in which the channel power gains from the IoT device to the edge-computing servers are time varying. To tackle with the difficulty due to the huge number of different channel realizations in the dynamic scenario, we propose an online algorithm, which is based on deep reinforcement learning (DRL), to efficiently learn the near-optimal offloading solutions for the time-varying channel realizations. Numerical results are provided to validate our distributed algorithm for the static channel scenario and the DRL-based online algorithm for the dynamic channel scenario. We also demonstrate the advantage of the NOMA assisted multitask MA-MEC against conventional orthogonal multiple access scheme under both static and dynamic channels.
Li Ping Qian 0001, Yuan Wu 0001, Fuli Jiang, Ningning Yu, Weidang Lu, Bin Lin 0001
IEEE Trans. Ind. Informatics4
2020 Electric Vehicles Charging Scheduling Optimization for Total Elapsed Time Minimization
abstract
With the rapid advancement of electric vehicle (EV) technology, EV has been emerging as a promising transportation due to the low carbon emission. However, the frequent and long time charging is indispensable to continue travelling. During peak hours, EVs further spend long time on the path routing because of the traffic congestion and queuing in the charging stations. Therefore, we study the EV charging scheduling problem that minimizes the total elapsed time which includes charging time for EVs through jointly optimizing the charging path routing and charging station selection in this paper. Considering the NP-hardness of this optimization problem, we propose an efficient EV charging scheduling method to obtain the optimal solution based on crowd sensing through considering the remaining energy in the battery, traffic condition, and the queue length of charging stations. Simulation results demonstrate that the proposed backtracking method based on crowd sensing can effectively reduce the total elapsed time, in comparison with the greedy algorithm.
Li Ping Qian 0001, Xinyue Zhou, Ningning Yu, Yuan Wu 0001
VTC Spring3
2020 Optimal Power Allocation for Secure Non-orthogonal Multiple Access Transmission
abstract
Non-orthogonal multiple access (NOMA) has been considered as a promising scheme for enabling ultra-high throughput transmission and massive-connectivity in next generation wireless systems. In this paper, we investigate the secrecy-based NOMA transmission for encountering the eavesdropping attack. Exploiting the NOMA-users simultaneous transmission as an artificial jamming, we investigate the joint optimization of NOMA-users' power allocations and the secrecy-provisioning, with the objective of the effective secure throughput of NOMA-users while ensuring the fairness among them. Despite the non-convexity of the formulated joint optimization problem, we explore its hidden feature and design a search algorithm to compute the optimal solution. Numerical results are provided to validate the performance of our proposed algorithm.1
Weidang Lu, Weicong Wu, Li Ping Qian 0001, Yuan Wu 0001, Ningning Yu, Liang Huang 0006
VTC Fall5
2020 Vehicular Networking-Enabled Vehicle State Prediction via Two-Level Quantized Adaptive Kalman Filtering
abstract
The accurate prediction of vehicle state based on the data acquired by the vehicular networking system plays an important role in improving traffic safety in the transportation section. However, it is difficult to accurately predict the vehicle state due to the highly dynamic road environment and various drivers' behaviors. To this end, in this article, we propose a two-level quantized adaptive Kalman filter (KF) algorithm based on the autoregressive moving average (MA) model to predict the vehicle state (including the moving direction, driving lane, vehicle speed, and acceleration). First, we propose a vehicular networking system to acquire the vehicle data by exchanging traffic data between the onboard unit and the roadside unit (RSU). Then, we predict the vehicle state at the edge cloud server (ECS) equipped at the RSU. Specifically, we utilize the autoregressive MA model to predict vehicle acceleration at the next moment. Then, the predicted vehicle acceleration is used as an input variable of the adaptive KF model to predict the vehicle location and speed at the next moment, in which we quantify the predicted vehicle location to the moving direction and the driving lane. Finally, the ECS broadcasts the predicted state to other RSUs. Through the communication with the road unit, all vehicles moving at the intersection can share vehicles states each other. In this doing, we can efficiently improve traffic safety in the intersection. We provide numerical simulations to validate the effectiveness of the autoregressive MA model used for predicting acceleration. Then, we evaluate the efficiency of the proposed two-level quantized adaptive KF algorithm. Compared with five conventional prediction algorithms, our proposed algorithm can improve the speed prediction accuracy by 90.62%, 89.81%, 88.91%, 82.76%, and 70.77%, respectively, which implies that our algorithm is a promising scheme for predicting the vehicle state in vehicular networks.
Li Ping Qian 0001, Anqi Feng, Ningning Yu, Wenchao Xu 0001, Yuan Wu 0001
IEEE Internet Things J.3
2019 Joint Minimization of Transmission Energy and Computation Energy for MEC-Aware NOMA NB-IoT Networks
abstract
In recent years, the 3rd generation partnership project (3GPP) has approved the narrowband Internet of Things (NB-IoT) system to support the low-data-rate machine- type communications. With the rapid development of NB- IoT technology, the NB-IoT traffic volumes have been experiencing the unprecedented growth. To this end, non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) have been proposed as promising technologies for the NB-IoT system. In this paper, our goal is to minimize the total energy consumption subject to the computation capacity and execution latency limits by jointly optimizing the transmit power, computation resource allocation, and successive interference cancellation (SIC) ordering. Considering the NP-hardness of the joint optimization problem, we obtain the optimal solution in the coupled steps: the resource allocation optimization and the combinatorial SIC ordering optimization. By exploiting the convex nature of the resource allocation optimization problem, we obtain the optimal transmit power and computation resource allocation based on the KKT conditions and the idea of gradient descent method when fixing the SIC ordering. Considering the combinatorial optimization of SIC ordering, we further propose a tabu search based SIC ordering algorithm on the basis of the proposed resource allocation optimization algorithm. Finally, simulation results demonstrate that the proposed joint optimization of transmit power, computation resource allocation, and SIC ordering in the context of NOMA can effectively reduce the total energy consumption of MEC- aware NB-IoT system, in comparison with the frequency- division multiple access technique.
Li Ping Qian 0001, Zhengying Zhu, Ningning Yu, Yuan Wu 0001
GLOBECOM3