Yongfeng Qian

Yongfeng Qian

Auto-generated profile, based on publicly available information

Yongfeng Qian

School of Computer Science, China University of Geosciences, Wuhan, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 September 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
Min ChenMin Chen
Min Chen
WLWei Li
Wei Li
YHYixue Hao
Yixue Hao
YQYongfeng Qian
Yongfeng Qian
IHIztok Humar
Iztok Humar

1 November 2018 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
YQYongfeng Qian
Yongfeng Qian
YJYingying Jiang
Yingying Jiang
Jing ChenJing Chen
Jing Chen
YZYu Zhang
Yu Zhang
JSJeungeun Song
Jeungeun Song
MPMatevž Pustišek
Matevž Pustišek

5 February 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YQYongfeng Qian
Yongfeng Qian
Min ChenMin Chen
Min Chen
Jing ChenJing Chen
Jing Chen
MHMohammad Anwar Hossain
Mohammad Anwar Hossain
AAAtif Alamri
Atif Alamri
As for deployment of security strategy, corresponding forwarding rules for switches can be given in allusion to different traffic conditions. However, due to lack of global cognitive control for security strategy deployment in traditional Internet of Vehicles (IoV), it is quite difficult to realize global and optimized security strategy deployment scheme so as to meet security requirements in different traffic conditions. On basis of traditional IoV, cognitive engine is added in cognitive IoV (CIoV) to enhance the intelligence of traditional IoV. In allusion to CIoV, and in consideration of restrictions on transmission delay, the security strategy deployment for switches on core network is formulated in this paper, thus not only the safe transmission rules are met, but the transmission delay can also be the lowest. To be specific, the path selection of switches is modeled as 0-1 programming problem in this paper, and that optimization problem is proved to be a nonconvex optimization problem. Then we convert that problem into a convex optimization problem by log-det heuristic algorithm, thus to give path selection scheme to meet security requirements with the lowest delay on the whole. Experiment proves that cognitive engine-based security strategy deployment put forth in this paper is much better than other schemes.

8 July 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YQYongfeng Qian
Yongfeng Qian
Yujun MaYujun Ma
Yujun Ma
Jing ChenJing Chen
Jing Chen
DWDi Wu
Di Wu
Daxin TianDaxin Tian
Daxin Tian
Kai HwangKai Hwang
Kai Hwang
With increasing popularity of related applications of mobile crowdsensing, especially in the field of Internet of Vehicles (IoV), task allocation has attracted wide attention. How to select appropriate participants is a key problem in vehicle-based crowdsensing networks. Some traditional methods choose participants based on minimizing distance, which requires participants to submit their current locations. In this case, participants' location privacy is violated, which influences disclosure of participants' sensitive information. Many privacy preserving task allocation mechanisms have been proposed to encourage users to participate in mobile crowdsensing. However, most of them assume that different participants' task completion quality is the same, which is not reasonable in reality. In this paper, we propose an optimal location privacy preserving and service quality guaranteed task allocation in vehicle-based crowdsensing networks. Specifically, we utilize differential privacy to preserve participants' location privacy, where every participant can submit the obfuscated location to the platform instead of the real one. Based on the obfuscated locations, we design an optimal problem to minimize the moving distance and maximize the task completion quality simultaneously. In order to solve this problem, we decompose it into two linear optimization problems. We conduct extensive experiments to demonstrate the effectiveness of our proposed mechanism.

1 September 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
LHLong Hu
Long Hu
JYJun Yang
Jun Yang
Min ChenMin Chen
Min Chen
YQYongfeng Qian
Yongfeng Qian
Joel RodriguesJoel Rodrigues
Joel Rodrigues

1 December 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
YQYongfeng Qian
Yongfeng Qian
JLJiayi Lu
Jiayi Lu
YMYiming Miao
Yiming Miao
WJWen Ji
Wen Ji
RJRenchao Jin
Renchao Jin
ESEnmin Song
Enmin Song