Jianyu Cao

Dr. Jianyu Cao

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
15 September 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JCJianyu Cao
Jianyu Cao
Wei FengWei Feng
Wei Feng
NGNing Ge
Ning Ge
JLJianhua Lu
Jianhua Lu
Time-sensitive services (TSSs) have been widely envisioned for future sixth generation (6G) wireless communication networks. Due to its inherent low-latency advantage, mobile edge computing (MEC) will be an indispensable enabler for TSSs. The random characteristics of the delay experienced by users are key metrics reflecting the quality of service (QoS) of TSSs. Most existing studies on MEC have focused on the average delay. Only a few research efforts have been devoted to other random delay characteristics, such as the delay bound violation probability and the probability distribution of the delay, by decoupling the transmission and computation processes of MEC. However, if these two processes could not be decoupled, the coupling will bring new challenges to analyzing the random delay characteristics. In this paper, an MEC system with a limited computation buffer at the edge server is considered. In this system, the transmission process and computation process form a feedback loop and could not be decoupled. We formulate a discrete-time two-stage tandem queueing system. Then, by using the matrix-geometric method, we obtain the estimation methods for the random delay characteristics, including the probability distribution of the delay, the delay bound violation probability, the average delay and the delay standard deviation. The estimation methods are verified by simulations. The random delay characteristics are analyzed by numerical experiments, which unveil the coupling relationship between the transmission process and computation process for MEC. These results will largely facilitate elaborate allocation of communication and computation resources to improve the QoS of TSSs.

7 September 2012 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
YLYining Liu
Yining Liu
CCChi Cheng
Chi Cheng
JCJianyu Cao
Jianyu Cao
TJTao Jiang
Tao Jiang
To achieve secure group communication, one-time session keys need to be shared among group members in a secure and authenticated manner. In this paper, we propose an improved authenticated key transfer protocol based on Shamir's secret sharing. The proposed protocol achieves key confidentiality due to security of Shamir's secret sharing and provides key authentication by broadcasting a single authentication message to all members. Furthermore, the proposed scheme resists against both insider and outsider attacks.

22 February 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
HCHongyuan Cheng
Hongyuan Cheng
JYJingkang Yang
Jingkang Yang
Mohammad ShojafarMohammad Shojafar
Mohammad Shojafar
JCJianyu Cao
Jianyu Cao
NJNan Jiang
Nan Jiang
YLYining Liu
Yining Liu
Fog-based road condition monitoring systems (RCMS) have been widely deployed to reduce traffic congestion and improve road safety. Considering the semi-credibility of fog nodes (FNs), it is vital to perform mutual authentication between vehicles and FNs (V2F). However, existing schemes require the remote trusted authority (TA) participating in V2F authentication online, which results in huge network delays. Besides, these schemes pre-store numerous pseudonyms and private keys into vehicles for identity privacy protection, resulting in an excessive memory burden. Moreover, most schemes fail to consider the reliability and confidentiality of road information provided by vehicles. Inspired by this, we design an reliable and privacy-preserving V2F authentication scheme (VFAS) without real-time participation of TA. Notably, pseudonyms and full private keys are produced by the vehicle itself rather than being pre-stored in the vehicle, which greatly reduces the vehicle's memory burden. Moreover, to ensure the reliability and confidentiality, FN receives road information encrypted with session keys from more than threshold ( $\omega$ ) different vehicles. Simulation result from real-world datasets is used to fix the threshold ( $\omega$ ). Formal security proofs and analysis show the VFAS's security properties. According to experimental results, the VFAS performs better than related works in regard to computation, communication and memory burden.


21 March 2022 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
JYJingkang Yang
Jingkang Yang
JCJianyu Cao
Jianyu Cao
YLYining Liu
Yining Liu
Destination prediction is an important task in vehicular ad hoc networks (VANETs), which benefits to resolve traffic congestion. The traditional destination prediction methods are mainly based on statistical learning, which is difficult to fit the movement pattern of vehicles and predict destination of a new query trajectory. In recent years, deep learning attracted more and more attentions since it has a better ability to adaptively extract features from data and fit complex models. The exiting deep learning-based destination prediction methods mainly extract features from past trajectory and fail to exploit future trajectory because the future locations are unknown, which results in a large prediction error. In this paper, we propose a novel deep learning-based destination prediction model that can predict the future trajectory and make full use of the information about it. Firstly, we exploit a trajectory prediction method to predict future locations, which makes the process of destination prediction continuous. Secondly, we design a branch network to determine which future location is the destination of the trajectory. We also evaluate our model with a real-world dataset. Experimental results show that our model can predict the coordinates of destination with a low prediction error.

1 January 2019 in Journal of Industrial and Management Optimization
Verified
Journal Article
Open access
PDF file
JCJianyu Cao
Jianyu Cao
WXWei-xin Xie
Wei-xin Xie
A stockless production system is considered, in which the products are not produced until the orders are accepted. Due to this character, the duration of the preventive maintenance has an influence on the lead time. In addition, in this stockless production system, the cost of the preventive maintenance depends on its duration; if the lead time exceeds to the quoted lead time, some penalty cost should be considered; and the non-conforming products can still be sold by a discount. A condition-based duration-varying preventive maintenance policy is designed for the stockless production system, by making a tradeoff among the duration of the preventive maintenance, the time for the machine continuously producing, and the lead time of the order. According to the characters of the stockless production system with the designed preventive maintenance policy, it can be modeled by a BMAP/G/1 infinite-buffer queueing model with gated service and queue-length dependent vacation. Based on this queueing model, the stationary probability distributions of four performance measures for the stockless production system are analyzed, including, the number of the products produced in a production cycle, the number of the unfulfilled orders at arbitrary time, the time required to fulfill the tasks present at arbitrary time, and the lead time of the order accepted at arbitrary time. Moreover, based on some information of these performance measures, a profit function, which represents the average profit of the manufacture in a production cycle, is constructed to optimize the designed preventive maintenance policy according to specific conditions. Finally, given an example with the purchasers having different sensitivities to the lead time, some numerical experiments are carried out; and from the numerical experiments, some general results can be inferred for the stockless production system with the designed preventive maintenance policy.