23 January 2019 in IEEE Transactions on Vehicular Technology
Vehicular fog computing (VFC) has emerged as a promising solution to relieve the overload on the base station and reduce the processing delay during the peak time. The computation tasks can be offloaded from the base station to vehicular fog nodes by leveraging the under-utilized computation resources of nearby vehicles. However, the wide-area deployment of VFC still confronts several critical challenges, such as the lack of efficient incentive and task assignment mechanisms. In this paper, we address the above challenges and provide a solution to minimize the network delay from a contract-matching integration perspective. First, we propose an efficient incentive mechanism based on contract theoretical modeling. The contract is tailored for the unique characteristic of each vehicle type to maximize the expected utility of the base station. Next, we transform the task assignment problem into a two-sided matching problem between vehicles and user equipment. The formulated problem is solved by a pricing-based stable matching algorithm, which iteratively carries out the “propose” and “price-rising” procedures to derive a stable matching based on the dynamically updated preference lists. Finally, numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
19 July 2018 in IEEE Transactions on Communications
With increasing popularity of unmanned aerial vehicles (UAVs), it is foreseen that they will play an important role in broadening the horizon of mobile crowd sensing (MCS). Specifically, UAV-aided MCS allows autonomous data collection anytime anywhere due to the capability of fast deployment and controllable mobility. However, the on-board battery capacity of UAVs imposes a limitation on their endurance capability and performance. In this paper, we consider the fixed-wing UAV-aided MCS system, and investigate the corresponding joint route planning and task assignment problem from an energy efficiency perspective. The formulated joint optimization problem is transformed into a two-sided two-stage matching problem, in which the route planning problem is solved in the first stage based on either dynamic programming (DP) or genetic algorithms (GA), and the task assignment problem is addressed in the second stage by exploring the Gale-Shapley (GS) algorithm. We provide a comprehensive theoretical analysis, and elaborate the procedures of practical implementation. Numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme.
15 March 2019 in IEEE Transactions on Vehicular Technology
In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via vehicle-to-infrastructure links. However, how to determine the optimal portion of workload to be offloaded based on the dynamic states of energy consumption and latency in local computing, data transmission, workload execution and handover, is still an open issue. In this paper, we study the energy-efficient workload offloading problem and propose a low-complexity distributed solution based on consensus alternating direction method of multipliers. By incorporating a set of local variables for each UE, the original problem, in which the optimization variables of UEs are coupled together, is transformed into an equivalent general consensus problem with separable objectives and constraints. The consensus problem can be further decomposed into a bunch of subproblems, which are distributed across UEs and solved in parallel simultaneously. Finally, the proposed solution is validated based on a realistic road topology of Beijing, China. Simulation results have demonstrated that significant energy saving gain can be achieved by the proposed algorithm.
18 August 2017 in IEEE Internet of Things Journal
With the ubiquity of wireless network and the intelligentization of machines, Internet of Things (IoT) has come to people's horizon. Device-to-device (D2D), as one advanced technique to achieve the vision of IoT, supports a high speed peer-to-peer transmission without fixed infrastructure forwarding which can enable fast content distribution in local area. In this paper, we address the content distribution problem by multihop D2D communication with decentralized content providers locating in the networks. We consider a cross-layer multidimension optimization involving frequency, space, and time, to minimize the network average delay. Considering the multicast feature, we first formulate the problem as a coalitional game based on the payoffs of content requesters, and then, propose a time-varying coalition formation-based algorithm to spread the popular content within the shortest possible time. Simulation results show that the proposed approach can achieve a fast content distribution across the whole area, and the performance on network average delay is much better than other heuristic approaches.