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.

Shiping Shao

dblp:270/1564 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-0373-1883ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
1 paper
Network optimization and economics · 100%
Network and information security
1 paper
Cyber-physical and IoT security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › game theory
game-theoretic networking
0.712023
Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks · IEEE Trans. Inf. Forensics Secur. 2023
Network optimization and economics › game theory › equilibrium analysis
nash equilibrium
0.712023
Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks · IEEE Trans. Inf. Forensics Secur. 2023
Cyber-physical and IoT security › in-vehicle network security › controller area network security
bus-off attack
0.712023
Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks · IEEE Trans. Inf. Forensics Secur. 2023
Cyber-physical and IoT security › in-vehicle network security
controller area network security
0.712023
Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks · IEEE Trans. Inf. Forensics Secur. 2023
Embedded and real-time systems
automotive systems
0.212023
Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks · IEEE Trans. Inf. Forensics Secur. 2023

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

stochastic control · 2.0linear-quadratic-gaussian game · 2.0
YearPublicationVenuePosition
2023 Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks
abstract
A bus-off attack is a denial-of-service (DoS) attack which exploits error handling in the controller area network (CAN) to induce an honest node to disconnect itself from the CAN bus. This paper develops a stochastic transmission policy as a countermeasure for the controller-transmitter pair against the bus-off attack. We model this as a non-zero-sum linear-quadratic-Gaussian game between the controller-transmitter pair and the attacker. We derive Nash equilibria of the game for two different information structures of the attacker. We show that the attacker has a dominant attack strategy under both information structures. Under the dominant attack strategy, we show that the optimal control policy is linear in the system state. We further identify a necessary and a sufficient conditions on the transmission policy to have bounded average cost. The theoretical results are complemented by a detailed case study of a bus-off attack on a vehicular adaptive cruise control model.
Jiacheng Tang, Shiping Shao, Jiguo Song, Abhishek Gupta 0002
IEEE Trans. Inf. Forensics Secur.2
2023 Scheduling EV Charging Having Demand With Different Reliability Constraints
abstract
We develop a new algorithm, based on approximate dynamic programming, to efficiently schedule the charging processes of a large number of electric vehicles (EVs) with flexibility, which allows the EV charging service provider to charge the EVs between their minimum and target state of charge (SoC) within a time window. We assume that the charging demands have known distributions and the charging process of EVs can be scheduled preemptively. We model the scheduling problem as a dynamic program with state-dependent constraints and solve it utilizing the fitted value iteration. We propose a multi-stage decoupled algorithm to reduce the dimensions in the fitted value iteration to reduce the computation complexity, and provide sufficient conditions for achieving optimality.
Shiping Shao, Hossein Sartipizadeh, Abhishek Gupta 0002
IEEE Trans. Intell. Transp. Syst.1