Cited 14 time in
Cited 14 time in
Temporal Data Dissemination in Vehicular Cyber-Physical Systems
- Temporal Data Dissemination in Vehicular Cyber-Physical Systems
- Liu, K[Liu, Kai]; Lee, VCS[Lee, Victor Chung Sing]; Ng, JKY[Ng, Joseph Kee-Yin]; Chen, J[Chen, Jun]; Son, SH[Son, Sang Hyuk]
- DGIST Authors
- Son, SH[Son, Sang Hyuk]
- Issue Date
- IEEE Transactions on Intelligent Transportation Systems, 15(6), 2419-2431
- Article Type
- Application Requirements; Cyber-Physical Systems (CPSs); Data Dissemination; Efficient Data Disseminations; Embedded Systems; Heuristic Scheduling Algorithms; Polynomial-Time Reduction; Polynomial Approximation; Real-Time Scheduling; Real - Time Scheduling; Scheduling; Scheduling Algorithms; Temporal Consistency; Vehicle-to-Roadside Communications; Vehicle-to-Vehicle Communications; Vehicular Cyber-Physical System (VCPS)
- Efficient data dissemination is one of the fundamental requirements to enable emerging applications in vehicular cyber-physical systems. In this paper, we present the first study on real-time data services via roadside-to-vehicle communication by considering both the time constraint of data dissemination and the freshness of data items. Passing vehicles can submit their requests to the server, and the server disseminates data items accordingly to serve the vehicles within its coverage. Data items maintained in the database are periodically updated to keep the information up-to-date. We present the system model and analyze challenges on data dissemination by considering both application requirements and communication characteristics. On this basis, we formulate the temporal data dissemination (TDD) problem by introducing the snapshot consistency requirement on serving real-time requests for temporal data items. We prove that TDD is NP-hard by constructing a polynomial-time reduction from the Clique problem. Based on the analysis of the time bound on serving requests, we propose a heuristic scheduling algorithm, which considers the request characteristics of productivity, status, and urgency in scheduling. An extensive performance evaluation demonstrates that the proposed algorithm is able to effectively exploit the broadcast effect, improve the bandwidth efficiency, and enhance the request service chance. © 2000-2011 IEEE.
- Institute of Electrical and Electronics Engineers Inc.
- Related Researcher
Son, Sang Hyuk
RTCPS(Real-Time Cyber-Physical Systems Research) Lab
There are no files associated with this item.
- Information and Communication EngineeringRTCPS(Real-Time Cyber-Physical Systems) Lab1. Journal Articles
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.