Vehicular fog computing (VFC) pushes the cloud computing capability to the distributed fog nodes at the edge of the Internet, enabling compute-intensive and latency-sensitive computing services for vehicles through task offloading. However, a heterogeneous mobility environment introduces uncertainties in terms of resource supply and demand, which are inevitable bottlenecks for the optimal offloading decision. Also, these uncertainties bring extra challenges to task offloading under the oblivious adversary attack and data privacy risks. In this article, we develop a new adversarial online learning algorithm with bandit feedback based on the adversarial multi-armed bandit theory, to enable scalable and low-complexity offloading decision making. Specifically, we focus on optimizing fog node selection with the aim of minimizing the offloading service costs in terms of delay and energy. The key is to implicitly tune the exploration bonus in the selection process and the assessment rules of the designed algorithm, taking into account volatile resource supply and demand. We theoretically prove that the input-size dependent selection rule allows to choose a suitable fog node without exploring the sub-optimal actions, and also an appropriate score patching rule allows to quickly adapt to evolving circumstances, which reduce variance and bias simultaneously, thereby achieving a better exploitation-exploration balance. Simulation results verify the effectiveness and robustness of the proposed algorithm.
The strict latency constraints of emerging vehicular applications make it unfeasible to forward sensing data from vehicles to the cloud for processing. To shorten network latency, vehicular fog computing (VFC) moves computation to the edge of the Internet, with the extension to support the mobility of distributed computing entities [a.k.a fog nodes (FNs)]. In other words, VFC proposes to complement stationary FNs co-located with cellular base stations with mobile ones carried by moving vehicles (e.g., buses). Previous works on VFC mainly focus on optimizing the assignments of computing tasks among available FNs. However, capacity planning, which decides where and how much computing resources to deploy, remains an open and challenging issue. The complexity of this problem results from the spatiotemporal dynamics of vehicular traffic, varying computing resource demand generated by vehicular applications, and the mobility of FNs. To solve the above challenges, we propose a data-driven capacity planning framework that optimizes the deployment of stationary and mobile FNs to minimize the installation and operational costs under the quality-of-service constraints, taking into account the spatiotemporal variation in both demand and supply. Using real-world traffic data and application profiles, we analyze the cost efficiency potential of VFC in the long term. We also evaluate the impacts of traffic patterns on the capacity plans and the potential cost savings. We find that high traffic density and significant hourly variation would lead to dense deployment of mobile FNs and create more savings in operational costs in the long term.
27 June 2023 in IEEE Transactions on Vehicular Technology
Emerging compute-intensive and latency-sensitive vehicular applications are expected to be deployed at the edge instead of the cloud to shorten the network latency. Mobile fog nodes carried by moving vehicles, namely vehicular fog nodes (VFNs), have been proposed to complement the stationary fog nodes co-located with base stations to handle the spatiotemporal variations of demand in a cost-efficient way. Existing works on capacity planning for such vehicular fog computing (VFC) scenarios are built on the assumption of certain spatiotemporal patterns of vehicular traffic. They consider long-term capacity planning (e.g., updated every season) but leave the adaptation to temporary changes or unexpected variations out of scope. These solutions typically result in high computational costs and thus are not suitable for short-term capacity planning, which requires low-latency responses. To reduce time complexity, we propose an integer linear programming (ILP)-based framework called on-demand capacity planning (ODCP) to implement two-phase planning through optimizing the routing strategies of VFNs, with the aim of maximizing the profit and quality of service (QoS). More specifically, ODCP first predicts the traffic flow and resource demand using seasonal autoregressive integrated moving average (SARIMA) and estimates the revenue using an economic model defined by service level agreement (SLA). With the estimated workload and revenue, the first phase (i.e., global planning) decides the ratio of tasks that can be served at the city scale and assigns VFNs to each region. The second phase (i.e., regional planning) assigns the VFNs to users within the same region and schedules the routes of VFNs based on the mobility of users. Experimental results show that the proposed solution achieves a higher performance in terms of profit and QoS than the existing single-phase capacity planning solutions. We also find that a large number of VFNs, a small region size, high penalty costs, and low travel and rental costs lead to high service rates, whereas a large region size and low travel, rental, and penalty costs lead to high profits.
26 May 2023 in IEEE Transactions on Knowledge and Data Engineering
The rapid proliferation of learning systems in an arbitrarily changing environment mandates the need to manage tensions between exploration and exploitation. This work proposes a quantum-inspired bandit learning approach for the learning-and-adapting-based offloading problem where a client observes and learns the costs of each task offloaded to the candidate resource providers, e.g., fog nodes. In this approach, a new action update strategy and novel probabilistic action selection are adopted, provoked by the amplitude amplification and collapse postulate in quantum computation theory. We devise a locally linear mapping between a quantum-mechanical phase in a quantum domain, e.g., Grover-type search algorithm, and a distilled probability-magnitude in a value-based decision-making domain, e.g., adversarial multi-armed bandit algorithm. The proposed algorithm is generalized, via the devised mapping, for better learning weight adjustments on favorable/unfavorable actions, and its effectiveness is verified via simulation.
24 November 2016 in IEEE Journal on Selected Areas in Communications
The business potential of device-to-device (D2D) communication including public safety and vehicular communications will be realized only if direct communication between devices subscribed to different mobile operators (OPs) is supported. One possible way to implement inter-operator D2D communication may use the licensed spectrum of the OPs, i.e., OPs agree to share spectrum in a co-primary manner, and inter-operator D2D communication is allocated over spectral resources contributed from both parties. In this paper, we consider a spectrum sharing scenario, where a number of OPs construct a spectrum pool dedicated to support inter-operator D2D communication. OPs negotiate in the form of a non-cooperative game about how much spectrum each OP contributes to the spectrum pool. OPs submit proposals to each other in parallel until a consensus is reached. When every OP has a concave utility function on the box-constrained region, we identify the conditions guaranteeing the existence of a unique equilibrium point. We show that the iterative algorithm based on the OP's best response might not converge to the equilibrium point due to myopically overreacting to the response of the other OPs, while the Jacobi-play strategy update algorithm can converge with an appropriate selection of update parameter. Using the Jacobi-play update algorithm, we illustrate that asymmetric OPs contribute an unequal amount of resources to the spectrum pool; however, all participating OPs may experience significant performance gains compared with the scheme without spectrum sharing.