Recent years have disclosed a remarkable proliferation of compute-intensive applications in smart cities. Such applications continuously generate enormous amounts of data which demand strict latency-aware computational processing capabilities. Although edge computing is an appealing technology to compensate for stringent latency related issues, its deployment engenders new challenges. In this survey, we highlight the role of edge computing in realizing the vision of smart cities. First, we analyze the evolution of edge computing paradigms. Subsequently, we critically review the state-of-the-art literature focusing on edge computing applications in smart cities. Later, we categorize and classify the literature by devising a comprehensive and meticulous taxonomy. Furthermore, we identify and discuss key requirements, and enumerate recently reported synergies of edge computing enabled smart cities. Finally, several indispensable open challenges along with their causes and guidelines are discussed, serving as future research directions.

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.

Remarkable prevalence of cloud computing has enabled smart cars to provide infotainment services. However, retrieving infotainment contents from long-distance data centers poses a significant delay. Consequently, hindering to offer stringent latency-aware infotainment services. Alternatively, Multi-access Edge Computing is a promising option to meet strict latency requirements. However, it imposes severe resource constraints with respect to caching and computation. Similarly, communication resources utilized to fetch the infotainment contents are scarce. In this paper, we jointly consider communication, caching, and computation (3C) to reduce infotainment content retrieval delay for smart cars. We formulate the problem as a mix-integer, non-linear, and non-convex optimization to minimize the latency. Furthermore, we relax the formulated problem from NP-hard to linear programming. Then, we propose a joint solution (3C) based on the alternative direction method of multipliers technique which operates in a distributed manner. We compare the proposed 3C solution with various approaches, namely, greedy, random, and centralized. Simulation results reveal that the proposed solution reduces delay up to 9% and 28% compared to the greedy and random approaches, respectively.

Recently, unmanned aerial vehicles (UAVs)-assisted multi-access edge computing (MEC) systems emerged as a promising solution for providing computation services to mobile users outside of terrestrial infrastructure coverage. As each UAV operates independently, however, it is challenging to meet the computation demands of the mobile users due to the limited computing capacity at the UAV’s MEC server as well as the UAV’s energy constraint. Therefore, collaboration among UAVs is needed. In this article, a collaborative multi-UAV-assisted MEC system integrated with an MEC-enabled terrestrial base station (BS) is proposed. Then, the problem of minimizing the total latency experienced by the mobile users in the proposed system is studied by optimizing the offloading decision as well as the allocation of communication and computing resources while satisfying the energy constraints of both mobile users and UAVs. The proposed problem is shown to be a nonconvex, mixed-integer nonlinear programming (MINLP) problem that is intractable. Therefore, the formulated problem is decomposed into three subproblems: 1) users tasks offloading decision problem; 2) communication resource allocation problem; and 3) UAV-assisted MEC decision problem. Then, the Lagrangian relaxation and alternating direction method of multipliers (ADMMs) methods are applied to solve the decomposed problems, alternatively. Simulation results show that the proposed approach reduces the average latency by up to 40.7% and 4.3% compared to the greedy and exhaustive search methods.

The proliferation of compute-intensive services in next-generation vehicular networks will impose an unprecedented computation demand to meet stringent latency and resource requirements. Vehicular edge or fog computing has been a widely adopted solution to enhance the computational capacity of vehicular networks; however, the computation requirements of these compute hungry applications will surpass the capabilities of such a solution. To address this challenge, the on-board resources of neighboring mobile vehicles can be utilized. However, such resource utilization requires an incentive mechanism to motivate privately owned neighboring vehicles to participate in sharing their resources. In this paper, we propose a contract theory-based incentive mechanism that maximizes the social welfare of the vehicular networks by motivating neighboring vehicles to participate in sharing their resources. The proposed approach enables the Road Side Units (RSUs) to provide appropriate rewards by offering a tailored contract to each resource sharing vehicle based on their contribution and unique characteristics. Moreover, we derive an optimal contract scheme for computational task offloading, taking into account the individual rationality and incentive-compatible constraints. Finally, we perform numerical evaluations to demonstrate the effectiveness of our proposed scheme. The proposed scheme achieves up to 28% higher computing resource utilization, 17.2% lower energy consumption per computing resource utilization, and 17.1% lesser energy consumption per task completed when compared to the linear pricing incentive baseline.

Emerging cross-device artificial intelligence (AI) applications require a transition from conventional centralized learning systems toward large-scale distributed AI systems that can collaboratively perform complex learning tasks. In this regard, democratized learning (Dem-AI) lays out a holistic philosophy with underlying principles for building large-scale distributed and democratized machine learning systems. The outlined principles are meant to study a generalization in distributed learning systems that go beyond existing mechanisms such as federated learning (FL). Moreover, such learning systems rely on hierarchical self-organization of well-connected distributed learning agents who have limited and highly personalized data and can evolve and regulate themselves based on the underlying duality of specialized and generalized processes. Inspired by Dem-AI philosophy, a novel distributed learning approach is proposed in this article. The approach consists of a self-organizing hierarchical structuring mechanism based on agglomerative clustering, hierarchical generalization, and corresponding learning mechanism. Subsequently, hierarchical generalized learning problems in recursive forms are formulated and shown to be approximately solved using the solutions of distributed personalized learning problems and hierarchical update mechanisms. To that end, a distributed learning algorithm, namely DemLearn, is proposed. Extensive experiments on benchmark MNIST, Fashion-MNIST, FE-MNIST, and CIFAR-10 datasets show that the proposed algorithm demonstrates better results in the generalization performance of learning models in agents compared to the conventional FL algorithms. The detailed analysis provides useful observations to further handle both the generalization and specialization performance of the learning models in Dem-AI systems.