Optimizing Vehicle-to-Cloud Data Transfers using Soft Real-Time Scheduling Concepts

The main promise of intelligent transportation systems (ITS) is that leveraging the information sensed by millions of vehicles will increase the quality of the user's experience. However, the unpredictable nature of road events, combined with a projected network overload, calls for a careful optimization of the vehicles' data transfers, taking into account spatio-temporal, safety and value constraints. In this article, we provide a methodical solution to optimize vehicle-to-cloud (V2C) data transfers, based on a series of steps. First, we show that this optimization problem can be modeled as a soft real-time scheduling problem. Second, we provide an extension of a classical algorithm for the generation of workloads, by increasing its coverage with regards to our use-case representation. Third, we estimate the bounds of an optimal clairvoyant algorithm in order to have a baseline for a fair comparison of existing scheduling algorithms. The results show that, within all these algorithms, one clearly outperforms the others regardless of the load rate. Interestingly, its performance gain increases when overload grows, and it can be implemented very efficiently, which makes it highly suitable for embedded systems.

[1]  Mihai Dimian,et al.  A survey on the usage of DSRC and VLC in communication-based vehicle safety applications , 2014, 2014 IEEE 21st Symposium on Communications and Vehicular Technology in the Benelux (SCVT).

[2]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[3]  H. Arkes,et al.  The Psychology of Sunk Cost , 1985 .

[4]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[5]  Richard M. Karp,et al.  On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.

[6]  Giorgio C. Buttazzo,et al.  HARD REAL-TIME COMPUTING SYSTEMS Predictable Scheduling Algorithms and Applications , 2007 .

[7]  Pramod K. Varshney,et al.  QoS Support in Wireless Sensor Networks: A Survey , 2004, International Conference on Wireless Networks.

[8]  Sanjoy K. Baruah,et al.  The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[9]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[10]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[11]  C. D. Locke,et al.  Best-effort decision-making for real-time scheduling , 1986 .

[12]  Marco Spuri,et al.  Value vs. deadline scheduling in overload conditions , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[13]  Panagiotis Papadimitratos,et al.  Vehicular communication systems: Enabling technologies, applications, and future outlook on intelligent transportation , 2009, IEEE Communications Magazine.

[14]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[15]  Prabhakar Raghavan,et al.  Memory versus randomization in on-line algorithms , 1994, IBM J. Res. Dev..

[16]  Hagit Attiya,et al.  Transactional Contention Management as a Non-Clairvoyant Scheduling Problem , 2010, Algorithmica.

[17]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[18]  Torsten Suel,et al.  Improved techniques for result caching in web search engines , 2009, WWW '09.

[19]  Alan Burns,et al.  Dynamic value-density for scheduling real-time systems , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[20]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  Chen-Khong Tham,et al.  Fairness and social welfare in incentivizing participatory sensing , 2012, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[22]  Giorgio C. Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications (Real-Time Systems Series) , 2010 .

[23]  Tak Wah Lam,et al.  Performance guarantee for EDF under overload , 2004, J. Algorithms.

[24]  Khaled Elleithy,et al.  Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis , 2015, Sensors.

[25]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[26]  Mohamed F. Younis,et al.  On handling QoS traffic in wireless sensor networks , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[27]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[28]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[29]  Alan Burns,et al.  The meaning and role of value in scheduling flexible real-time systems , 2000, J. Syst. Archit..

[30]  Kyung Sup Kwak,et al.  QoS Issues with Focus on Wireless Body Area Networks , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.