TY - GEN
T1 - WSG-InV
T2 - 2021 IEEE Wireless Communications and Networking Conference, WCNC 2021
AU - Linghu, Yuan
AU - Li, Xiangxue
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - The paper presents WSG-InV, a novel weighted state graph (WSG) model for lightweight IDS on in-vehicle network. By capitalizing on historical in-vehicle data of timestamps, message identifiers, and data field, WSG-InV constructs offline a weighted state graph G=(V, E) where distinct message identifiers constitute the set V of vertices and the edges in E define the time-varying state transitions of the C A N frames. The iconic constituents of given in-vehicle data are condensed into a collection of ordered triples (the vectorized weight) that are further assigned to the edges in E. In the mean time, several kinds of intrusion data are evoked and the random forest model is deployed to conduct intrusion classification. WSG-InV then segments the online data stream into a slice of sliding windows and extracts a weighted state subgraph S for each of them. By consulting G as a benchmarking as well as optimizing a particular 3-variable programming,WSG-InV assesses the subgraph S and thereby recognizes the corresponding traffic as normal or anomaly. Besides, WSG-InV can distinguish which type of attack the anomaly gears toward. Experimental results demonstrate almost optimal performance.
AB - The paper presents WSG-InV, a novel weighted state graph (WSG) model for lightweight IDS on in-vehicle network. By capitalizing on historical in-vehicle data of timestamps, message identifiers, and data field, WSG-InV constructs offline a weighted state graph G=(V, E) where distinct message identifiers constitute the set V of vertices and the edges in E define the time-varying state transitions of the C A N frames. The iconic constituents of given in-vehicle data are condensed into a collection of ordered triples (the vectorized weight) that are further assigned to the edges in E. In the mean time, several kinds of intrusion data are evoked and the random forest model is deployed to conduct intrusion classification. WSG-InV then segments the online data stream into a slice of sliding windows and extracts a weighted state subgraph S for each of them. By consulting G as a benchmarking as well as optimizing a particular 3-variable programming,WSG-InV assesses the subgraph S and thereby recognizes the corresponding traffic as normal or anomaly. Besides, WSG-InV can distinguish which type of attack the anomaly gears toward. Experimental results demonstrate almost optimal performance.
KW - CAN data
KW - IDS
KW - Weighted State Graph
UR - https://www.scopus.com/pages/publications/85119364409
U2 - 10.1109/WCNC49053.2021.9417552
DO - 10.1109/WCNC49053.2021.9417552
M3 - 会议稿件
AN - SCOPUS:85119364409
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2021 IEEE Wireless Communications and Networking Conference, WCNC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 29 March 2021 through 1 April 2021
ER -