Search

In mobile edge computing, local edge servers can host cloud-based services, which reduces network overhead and latency but requires service migrations as users move to new locations. It is challenging to make migration decisions optimally because of the uncertainty in such a dynamic cloud environment. In this paper, we formulate the service migration problem as a Markov decision process (MDP). Our formulation captures general cost models and provides a mathematical framework to design optimal service migration policies. In order to overcome the complexity associated with computing the optimal policy, we approximate the underlying state space by the distance between the user and service locations. We show that the resulting MDP is exact for the uniform 1-D user mobility, while it provides a close approximation for uniform 2-D mobility with a constant additive error. We also propose a new algorithm and a numerical technique for computing the optimal solution, which is significantly faster than traditional methods based on the standard value or policy iteration. We illustrate the application of our solution in practical scenarios where many theoretical assumptions are relaxed. Our evaluations based on real-world mobility traces of San Francisco taxis show the superior performance of the proposed solution compared to baseline solutions. [ABSTRACT FROM AUTHOR]

The future e-mobility ecosystem will be a complex structure with different stakeholders seeking to optimize their operation and benefits. In this paper, a day-ahead grid-to-vehicle (G2V) and vehicle-to-grid (V2G) scheduling framework is proposed including electric vehicles (EVs), charging stations (CSs), and retailers. To facilitate V2G services and to avoid congestion at CSs, two types of trips, i.e., mandatory and optional trips, are defined and formulated. Also, EV drivers’ preferences are added to the model as cost/revenue threshold and extra driving distance to enhance the practical aspects of the scheduling framework. An iterative process is proposed to solve the non-cooperative Stackelberg game by determining the optimal routes and CS for each EV, optimal operation of each CS and retailers, and optimal V2G and G2V prices. Extensive simulation studies are carried out for two different e-mobility ecosystems of multiple retailers and CSs as well as numerous EVs based on real data from San Francisco, the USA. The simulation results show that the optional trips not only reduces the cost of EVs and PV curtailment by 8.8-24.2% and 26.4-28.5% on average, respectively, in different scenarios, but also mitigates congestion during specific hours while respecting EV drivers’ preferences. Moreover, the simulation results revealed the significant impact of EV drivers' preferences on the optimal solutions and cost/revenue of the stakeholders. [ABSTRACT FROM AUTHOR]

Mobile crowdsensing harnesses the sensing power of modern smartphones to collect and analyze data beyond the scale of what was previously possible with traditional sensor networks. Given the participatory nature of mobile crowdsensing, it is imperative to incentivize mobile users to provide sensing services in a timely and reliable manner. Most importantly, given sensed information is often valid for a limited period of time, the capability of smartphone users to execute sensing tasks largely depends on their mobility pattern, which is often uncertain. For this reason, in this paper, we propose IncentMe, a framework that solves this core issue by leveraging game-theoretical reverse auction mechanism design. After demonstrating that the proposed problem is NP-hard, we derive two mechanisms that are parallelizable and achieve higher approximation ratio than existing work. IncentMe has been extensively evaluated on a road traffic monitoring application implemented using mobility traces of taxi cabs in San Francisco, Rome, and Beijing. Results demonstrate that the mechanisms in IncentMe outperform the state of the art work by improving the efficiency in recruiting participants by 30 percent. [ABSTRACT FROM AUTHOR]