To achieve an efficient federated edge learning (FEEL) system, the scheme of device scheduling and resource allocation should jointly perceive the device availability, wireless channel quality, and local gradient quality. The existing literature on FEEL rarely considers these three aspects simultaneously, so the schemes they proposed still have room for improving the efficiency of FEEL, which motivates our work. In this paper, by mathematically modeling the device availability, wireless channel quality, and gradient quality, and deriving the convergence bound for model training in the FEEL system, we formulate a joint device scheduling and resource allocation problem, aiming to improve the FEEL efficiency. The formulated problem is a challenging non-convex problem. By exploring its structural properties and utilizing the KKT conditions, we obtain an optimal solution in closed-form. The analytical results enable us to gain some important insights into how the device availability, wireless channel quality, and gradient quality affect device scheduling and resource allocation in the FEEL system.
In this work, we focus on a drone-fleet-enabled package delivery scenario, in which multiple drones fly from a start point and cooperatively deliver packages to the ground users in the presence of a number of no-fly zones (NFZs). We first mathematically model the package delivery scenario in a rigorous manner. Then, a package value maximization problem is established to optimize the flight trajectory and package delivery under the constraints of drone load and collision as well as NFZs. The formulated problem is a highly challenging mixed-integer non-convex problem. To facilitate solving it, we transform the formulated problem into an equivalent problem with special structure by using some appropriate transformations, based on which a low-complexity algorithm with favorable performance is developed using the penalty convex–concave procedure method. Finally, numerical results demonstrate the superiority of the proposed solution.