Konglin Zhu

Dr. Konglin Zhu

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
25 March 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
KZKonglin Zhu
Konglin Zhu
ZCZhicheng Chen
Zhicheng Chen
YPYuyang Peng
Yuyang Peng
LZlin zhang
lin zhang
The development of Internet of Vehicles (IoVs) introduces more intrusions to the vulnerabilities of in-vehicle network. It is important to detect in-vehicle network anomaly for the purpose of driving safety. The previous studies either focus on one-dimension anomaly behavior of in-vehicle network or need to look into the semantics of in-vehicle network, which is neither effective nor efficient for vehicle pilot. In this paper, we propose a literal multi-dimensional anomaly detection approach using the distributed Long-Short-Term-Memory (LSTM) framework for in-vehicle network, especially the Control Area Network (CAN). The proposed approach only needs the literal binary CAN message instead of revealing the semantics of CAN message. To enhance the accuracy and efficiency of detection, it detects anomaly from both time and data dimension simultaneously by exploiting multi-task LSTM neural network on mobile edge. The extensive evaluation results show that the proposed anomaly detection achieves a satisfying accuracy of 90%. The detection speed is as fast as 0.61 milliseconds on mobile edge.

19 October 2016 in IEEE Access
Verified
Journal Article
Open access
KZKonglin Zhu
Konglin Zhu
WZWenting Zhi
Wenting Zhi
LZLin Zhang
Lin Zhang
XCXu Chen
Xu Chen
XFXiaoming Fu
Xiaoming Fu
The device-to-device (D2D) channels allow content sharing when two devices are in close proximity, which can help improve resource utilization and network capacity. The data caching is introduced in D2D networks to enable the quick data access in mobile networks. Due to the selfish nature of users, they wish to get as much replication as possible in the opportunistic connections, seeking to maximize their own profits. However, caching data for other nodes may result in additional cost to the node serving as cache, where the cost is invoked by the cache placement of cache nodes and accessing cost of other nodes. In this paper, we propose a social-aware caching game to incentivize nodes to cache data for others. In the game, we consider the social ties and physical distance as the factors to formulate the caching cost. We obtain the Nash equilibrium of the game and propose a social-aware algorithm to minimize the total cost of getting object data in the network. The extensive simulation results show that our algorithm gains significant cache benefit.

6 May 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
GMGuifu Ma
Guifu Ma
MHManjiang Hu
Manjiang Hu
XWXiaowei Wang
Xiaowei Wang
HLHaoran Li
Haoran Li
YBYougang Bian
Yougang Bian
DWDi Wu
Di Wu
In the foreseeable Intelligent Transportation System, Intelligent Connected Vehicles (ICVs) will play an important role in improving travel efficiency and safety. However, it is challenging for ICVs to support the resource-hungry autonomous driving applications due to the limitation of hardware computing power. Fortunately, the emergence of Multi-access Edge Computing helps overcome this limitation effectively. This paper addresses the vehicle-to-edge server computation offloading conundrum by optimizing the trade-offs in partial offloading and resource allocation. Proposing a distributed approach, this study confronts the multi-variable non-convex challenge directly by decoupling variables and deriving constraint-based bounds that guide the decisions for offloading and allocation. A novel low-complexity distributed algorithm is introduced that not only tends toward optimal but also demonstrates superior real-time applicability and efficiency, illustrated through enhanced performances both in simulated trials and genuine vehicular edge computing settings. The algorithm’s practical effectiveness addresses a notable gap between the theoretical models for computation offloading and actual real-life execution, reinforcing the soundness and relevance of the proposed method. Furthermore, its advanced integration with federated learning frameworks marks a leading-edge application, substantiating significant enhancements in computational efficiency and robustness.

18 August 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YYYulan Yuan
Yulan Yuan
LJLei Jiao
Lei Jiao
KZKonglin Zhu
Konglin Zhu
LZlin zhang
lin zhang
Due to the enormous energy consumption and the wide geographic distribution, Electrical Vehicle (EV) charging stations are believed to have great potential in Emergency Demand Response (EDR) participation. However, EDR limits the electricity drawn from the power grid by the charging station, and can pose threats to satisfying EVs’ charging demand. In this paper, in order to complement the charging station’s energy supply to meet the dynamic EV charging demand, we formulate an online EV charging scheduling problem under EDR as a non-linear mixed-integer program, and propose a novel polynomial-time online algorithm and auction mechanism to jointly incentivize EVs with energy to sell their energy and utilize the charging station’s local generator to produce energy. Our approach conducts an auction in each single round based on a primal-dual method and ties these auctions over time to optimize the system’s long-term social cost, while accommodating the local generator’ on/off-state control, each EV bidder’s cumulative energy budget constraint, and the power grid’s EDR energy cap. Our approach achieves the economic properties of truthfulness, individual rationality, and computational efficiency simultaneously for each auction, and a parameterized-constant competitive ratio for the long-term social cost. By rigorous theoretical analysis and trace-driven experimental studies, the results exhibit that our approach outperforms multiple alternative algorithms regarding the social cost, attains the economic properties, and also executes efficiently in practice.

1 December 2015 in Computer Networks
Verified
Journal Article
Closed access
KZKonglin Zhu
Konglin Zhu
WLWenzhong Li
Wenzhong Li
XFXiaoming Fu
Xiaoming Fu
LZlin zhang
lin zhang

31 October 2016 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
ZLZhenyu Liu
Zhenyu Liu
MWMengfei Wu
Mengfei Wu
KZKonglin Zhu
Konglin Zhu
LZlin zhang
lin zhang
Traffic accident involving vehicles is one of the most serious problems in the transportation system nowadays. How to detect dangerous steering and then alarm drivers in real time is a problem. What is more, walking while using smartphones makes pedestrian more susceptible to various risks. Although dedicated short range communication (DSRC) provides the way for safety communications, most of vehicles have not been deployed with DSRC components. Even worse, DSRC is not supported by the smartphones for vehicle-to-pedestrian (V2P) communication. In this paper, a smartphone-based framework named SenSafe is developed to improve the traffic safety. SenSafe is a framework which only utilizes the smartphone to sense the surrounding events and provides alerts to drivers. Smartphone-based driving behaviors detection mechanism is developed inside the framework to discover various steering behaviors. Besides, the Wi-Fi association and authentication overhead is reduced to broadcast the compressed sensing data using the Wi-Fi beacon to inform the drivers of the surroundings. Furthermore, a collision estimation algorithm is designed to issue appropriate warnings. Finally, an Android-based implementation of SenSafe framework has been achieved to demonstrate the application reliability in real environments.