Sunghwa Son, Byeong-Hoon Jang, Kyung-Joon Park

KIPS Transactions on Computer and Communication Systems, Vol. 7, No. 9, pp. 227-334, Sep. 2018
10.3745/KTCCS.2018.7.9.227,   PDF Download:
Keywords: Deadline-Aware Routing, Quality of Service, Cyber-Physical Systems
Abstract

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

Statistics
Cite this article