This paper proposes a deadline aware routing algorithm that considers a probabilistic delay constraint with a pre-specified deadline for cyber-physical systems (CPSs). Most routing algorithms typically minimize a performance metric, such as mean delay. However, minimum mean delay is an insufficient routing metric, because deadline sensitive systems require timely delivery. The proposed routing algorithm maximizes the probability of achieving a given deadline by considering the delay distribution rather than the mean delay. Therefore, the algorithm can enhance the quality of control of networked control in CPSs. We assess the proposed routing algorithm where the single hop delay follows an exponential distribution, then construct a network topology and perform simulations to evaluate the algorithm’s performance. The simulation results show that the proposed routing algorithm can effectively increase the probability of meeting the deadline and improve networked control performance in CPS. ⓒ 2017 DGIST
Table Of Contents
1. INTRODUCTION 9 -- 2. BACKGROUND 11 -- 2.1 Network Delay 11 -- 2.2 Routing Protocols 13 -- 2.3 Networked Control System 15 -- 3. RELATED WORK 17 -- 3.1 Quality of service routing 17 -- 3.2 Road networks 17 -- 4. DEADLINE-AWARE ROUTING ALGORITHM 19 -- 4.1 Key Idea and Motivation 19 -- 4.2 Deadline-aware Route Selection 20 -- 5. SIMULATION AND PERFORMANCE EVALUATION 23 -- 5.1 Simulation environment 23 -- 5.2 Simulation and Performance Evaluation 26 -- 6. CONCLUSION 31
