Next Article in Journal
Biogeography-Based Optimization of the Portfolio Optimization Problem with Second Order Stochastic Dominance Constraints
Previous Article in Journal
A Simplified Matrix Formulation for Sensitivity Analysis of Hidden Markov Models
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(3), 98; https://doi.org/10.3390/a10030098

Adaptive Virtual RSU Scheduling for Scalable Coverage under Bidirectional Vehicle Traffic Flow

1
School of Digital Media, Jiangnan University, Wuxi 214122, China
2
Applied Technology College, Soochow University, Soochow 215325, China
*
Author to whom correspondence should be addressed.
Received: 12 May 2017 / Revised: 17 August 2017 / Accepted: 18 August 2017 / Published: 24 August 2017
View Full-Text   |   Download PDF [1767 KB, uploaded 24 August 2017]   |  

Abstract

Over the past decades, vehicular ad hoc networks (VANETs) have been a core networking technology to provide drivers and passengers with safety and convenience. As a new emerging technology, the vehicular cloud computing (VCC) can provide cloud services for various data-intensive applications in VANETs, such as multimedia streaming. However, the vehicle mobility and intermittent connectivity present challenges to the large-scale data dissemination with underlying computing and networking architecture. In this paper, we will explore the service scheduling of virtual RSUs for diverse request demands in the dynamic traffic flow in vehicular cloud environment. Specifically, we formulate the RSU allocation problem as maximum service capacity with multiple-source and multiple-destination, and propose a bidirectional RSU allocation strategy. In addition, we formulate the content replication in distributed RSUs as the minimum replication set coverage problem in a two-layer mapping model, and analyze the solutions in different scenarios. Numerical results further prove the superiority of our proposed solution, as well as the scalability to various traffic condition variations. View Full-Text
Keywords: VANETs; online algorithm; distributed solutions VANETs; online algorithm; distributed solutions
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chen, F.; Bi, X.; Lyu, R.; Hua, Z.; Liu, Y.; Zhang, X. Adaptive Virtual RSU Scheduling for Scalable Coverage under Bidirectional Vehicle Traffic Flow. Algorithms 2017, 10, 98.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top