12 February 2020 in IEEE Transactions on Wireless Communications
Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to improve the global model. However, when the participating clients implement an uncoordinated computation strategy, the difficulty is to handle the communication efficiency (i.e., the number of communications per iteration) while exchanging the model parameters during aggregation. Therefore, a key challenge in FL is how users participate to build a high-quality global model with communication efficiency. We tackle this issue by formulating a utility maximization problem, and propose a novel crowdsourcing framework to leverage FL that considers the communication efficiency during parameters exchange. First, we show an incentive-based interaction between the crowdsourcing platform and the participating client’s independent strategies for training a global learning model, where each side maximizes its own benefit. We formulate a two-stage Stackelberg game to analyze such scenario and find the game’s equilibria. Second, we formalize an admission control scheme for participating clients to ensure a level of local accuracy. Simulated results demonstrate the efficacy of our proposed solution with up to 22% gain in the offered reward.
8 March 2021 in IEEE Transactions on Wireless Communications
Federated Learning (FL) is a distributed learning framework that can deal with the distributed issue in machine learning and still guarantee high learning performance. However, it is impractical that all users will sacrifice their resources to join the FL algorithm. This motivates us to study the incentive mechanism design for FL. In this paper, we consider a FL system that involves one base station (BS) and multiple mobile users. The mobile users use their own data to train the local machine learning model, and then send the trained models to the BS, which generates the initial model, collects local models and constructs the global model. Then, we formulate the incentive mechanism between the BS and mobile users as an auction game where the BS is an auctioneer and the mobile users are the sellers. In the proposed game, each mobile user submits its bids according to the minimal energy cost that the mobile users experiences in participating in FL. To decide winners in the auction and maximize social welfare, we propose the primal-dual greedy auction mechanism. The proposed mechanism can guarantee three economic properties, namely, truthfulness, individual rationality and efficiency. Finally, numerical results are shown to demonstrate the performance effectiveness of our proposed mechanism.
23 September 2020 in IEEE Communications Letters
Unmanned aerial vehicles (UAVs) have been deployed to enhance the network capacity and provide services to mobile users with or without infrastructure coverage. At the same time, we have observed the exponential growth in Internet of Things (IoTs) devices and applications. However, as IoT devices have limited computation capacity and battery lifetime, it is challenging to process data locally on the devices. To this end, in this letter, a UAV-aided mobile edge computing system is proposed. The problem to jointly minimize the energy consumption at the IoT devices and the UAVs during task execution is studied by optimizing the task offloading decision, resource allocation mechanism and UAV's trajectory while considering the communication and computation latency requirements. A non-convex structure of the formulated problem is revealed and shown to be challenging to solve. To address this challenge, a block successive upper-bound minimization (BSUM) algorithm is introduced. Finally, simulation results are provided to show the efficiency of our proposed algorithm.
23 February 2022 in IEEE Transactions on Intelligent Transportation Systems
Unmanned aerial vehicle (UAV)-assisted multi-access edge computing (MEC) has become one promising solution for energy-constrained devices to run the applications with high computation demand and stringent delay requirement in beyond 5G era. In this work, we study a multi-UAV-assisted two-stage MEC system in which UAVs provide the computing and relaying services to the mobile devices. Due to the limited computing resources, each UAV executes only a portion of the offloaded tasks from its associated MDs in the first stage. Hence, in the second stage, each UAV relays the portions of the tasks to the terrestrial base station (TBS) which has rich computing resources enough to handle all the tasks relayed to it. In this regard, we formulate a joint task offloading, communication and computation resource allocation problem to minimize the energy consumption of MDs and UAVs by considering the limited resources of UAVs and the tolerable latency of the tasks. The formulated problem is a mixed-integer non-convex problem which is NP hard. To solve the formulated optimization problem, we apply the Block Successive Upper-bound Minimization (BSUM) method which guarantees to obtain the stationary points of the non-convex objective function. Finally, the extensive evaluation results are conducted to show the superior performance of our proposed framework.
1 August 2023 in IEEE Transactions on Mobile Computing
The proliferation of intelligent transportation systems (ITS) has led to increasing demand for diverse network applications. However, conventional terrestrial access networks (TANs) are inadequate in accommodating various applications for remote ITS nodes, i.e., airplanes and ships. In contrast, satellite access networks (SANs) offer supplementary support for TANs, in terms of coverage flexibility and availability. In this study, we propose a novel approach to ITS data offloading and computation services based on SANs. We use low-Earth orbit (LEO) and cube satellites (CubeSats) as independent mobile edge computing (MEC) servers that schedule the processing of data generated by ITS nodes. To optimize offloading task selection, computing, and bandwidth resource allocation for different satellite servers, we formulate a joint delay and rental price minimization problem that is mixed-integer non-linear programming (MINLP) and NP-hard. We propose a cooperative multi-agent proximal policy optimization (Co-MAPPO) deep reinforcement learning (DRL) approach with an attention mechanism to deal with intelligent offloading decisions. We also decompose the remaining subproblem into three independent subproblems for resource allocation and use convex optimization techniques to obtain their optimal closed-form analytical solutions. We conduct extensive simulations and compare our proposed approach to baselines, resulting in performance improvements of 9.9%, 5.2%, and 4.2%, respectively.
2 January 2023 in IEEE Internet of Things Journal
Nowadays, unmanned aerial vehicles (UAVs)-assisted mobile-edge computing (MEC) systems have been exploited as a promising solution for providing computation services to mobile users outside of terrestrial networks. However, it remains challenging for standalone UAVs to meet the computation requirement of numerous users due to their limited computation capacity and battery lives. Therefore, we propose a collaborative scheme among UAVs to share the workload between them. Furthermore, this work is the first to consider the task topology of offloading in MEC-enabled UAVs networks while restricting their power consumption. We study the task topology, in which a task consists of a set of subtasks, and each subtask has dependencies upon other subtasks. In the real world, subtasks with dependencies must wait for their preceding subtasks to complete before being executed, and this affects the offloading strategy. Next, we formulate an optimization problem to minimize the average latency of users by jointly controlling the offloading decision for dependent tasks and allocating the communication resources of UAVs. The formulated problem is NP-hard and cannot be solved in polynomial time. Therefore, we divide the problem into two subproblems: 1) offloading decision problem and 2) communication resource allocation problem. Then, a metaheuristic method is proposed to find the suboptimal solution to the former problem, while the latter problem is solved by using convex optimization. Finally, we conduct simulation experiments to prove that our proposed offloading technique outperforms several benchmark schemes in minimizing the average latency of users for dependency tasks and achieving higher uplink transmission rates.