Communities & Collections
Researchers & Labs
Titles
DGIST
LIBRARY
DGIST R&D
Detail View
Department of Electrical Engineering and Computer Science
RTCPS(Real-Time Cyber-Physical Systems) Lab
1. Journal Articles
Temporal Data Dissemination in Vehicular Cyber-Physical Systems
Liu, Kai
;
Lee, Victor Chung Sing
;
Ng, Joseph Kee-Yin
;
Chen, Jun
;
Son, Sang Hyuk
Department of Electrical Engineering and Computer Science
RTCPS(Real-Time Cyber-Physical Systems) Lab
1. Journal Articles
Citations
WEB OF SCIENCE
Citations
SCOPUS
Metadata Downloads
XML
Excel
Title
Temporal Data Dissemination in Vehicular Cyber-Physical Systems
Issued Date
2014-12
Citation
Liu, Kai. (2014-12). Temporal Data Dissemination in Vehicular Cyber-Physical Systems. IEEE Transactions on Intelligent Transportation Systems, 15(6), 2419–2431. doi: 10.1109/TITS.2014.2316006
Type
Article
Author Keywords
Data dissemination
;
real-time scheduling
;
temporal consistency
;
vehicular cyber-physical system (VCPS)
Keywords
TIME
;
BROADCAST
;
ALGORITHMS
;
MESSAGES
ISSN
1524-9050
Abstract
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.
URI
http://hdl.handle.net/20.500.11750/2366
DOI
10.1109/TITS.2014.2316006
Publisher
Institute of Electrical and Electronics Engineers Inc.
Show Full Item Record
File Downloads
There are no files associated with this item.
공유
공유하기
Related Researcher
Son, Sang Hyuk
손상혁
Department of Information and Communication Engineering
read more
Total Views & Downloads