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.

The proliferation of novel infotainment services such as Virtual Reality(VR)-based services has fundamentally changed the existing mobile networks. These bandwidth-hungry services expanded at a tremendously rapid pace, thus, generating a burden of data traffic in the mobile networks. To cope with this issue, one can use Multi-access Edge Computing (MEC) to bring the resource to the edge. By doing so, we can release the burden of the core network by taking the communication, computation, and caching resources nearby the end-users (UEs). Nevertheless, due to the vast adoption of VR-enabled devices, MEC resources might be insufficient in peak times or dense settings. To overcome these challenges, we propose a system model where the service provider (SP) might rent Unmanned Area Vehicles (UAVs) from UAV service providers (USPs) to serve as micro-based stations (UBSs) that expand the service area and improve the spectrum efficiency. In which, UAV can pre-cached certain sets of VR-based contents and serve UEs via air-to-ground (A2G) communication. Furthermore, future intelligent devices are capable of 5G and B5G communication interfaces, and thus, they can communicate with UAVs via A2G links. By doing so, we can significantly reduce a considerable amount of data traffic in mobile networks. In order to successfully enable such kinds of services, an attractive incentive mechanism is required. Therefore, we propose a contract theory-based incentive mechanism for UAV-assisted MEC in VR-based infotainment services, in which the MEC offers an amount reward to a UAV for serving as a UBS in a specific location for certain time slots. We then derive an optimal contract-based scheme with individual rationality and incentive compatibility conditions. The numerical findings show that our proposed approach outperforms the Linear Pricing (LP) technique and is close to the optimal solution in terms of social welfare. Additionally, our proposed scheme significantly enhanced the fairness of utility for UAVs in asymmetric information problems.

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.

A recent take toward federated analytics (FA), which allows analytical insights of distributed data sets, reuses the federated learning (FL) infrastructure to evaluate the summary of model performances across the training devices. However, the current realization of FL adopts single server-multiple client architecture with limited scope for FA, which often results in learning models with poor generalization, i.e., an ability to handle new/unseen data, for real-world applications. Moreover, a hierarchical FL structure with distributed computing platforms demonstrates incoherent model performances at different aggregation levels. Therefore, we need to design a robust learning mechanism than the FL that 1) unleashes a viable infrastructure for FA and 2) trains learning models with better generalization capability. In this work, we adopt the novel democratized learning (Dem-AI) principles and designs to meet these objectives. First, we show the hierarchical learning structure of the proposed edge-assisted Dem-AI mechanism, namelyEdge-DemLearn, as a practical framework to empower generalization capability in support of FA. Second, we validate Edge-DemLearn as a flexible model training mechanism to build a distributed control and aggregation methodology in regions by leveraging the distributed computing infrastructure. The distributed edge computing servers construct regional models, minimize the communication loads, and ensure distributed data analytic application’s scalability. To that end, we adhere to a near-optimal two-sided many-to-one matching approach to handle the combinatorial constraints in Edge-DemLearn and solve it for fast knowledge acquisition with optimization of resource allocation and associations between multiple servers and devices. Extensive simulation results on real data sets demonstrate the effectiveness of the proposed methods.

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.

Multi-access edge computing (MEC) is witnessed to be an integral part of emerging augmented reality (AR) / virtual reality (VR) applications. These applications require contents from the cloud, thus suffer from high latency that is not desirable. To address this issue, one can store the frequently requested content at the MEC server. However, MEC servers have limited computing capabilities. Additionally, there are significant variations in a number of requests from the MEC server. Therefore, we propose collaborative edge caching. Our collaborative edge caching will serve the end-users in collaboration to fully exploit the available caching resources at the network edge. We derive optimization scheme based on the alternating direction method of multipliers(ADMM). Finally, we perform numerical evaluations to demonstrate the effectiveness of our proposed scheme.

Recently, we have witnessed an increasing demand in augmented reality (AR)-based fifth-generation (5G) and beyond applications, such as smart gaming, smart navigation, smart military wearable, and smart industries. These AR-based applications require on-demand computational and caching resources with low latency that can be provided via multiaccess edge computing (MEC) server. However, due to the massive growth of AR-enabled devices, the MEC server resources might be insufficient. To overcome this challenge, we can utilize the computational and caching resources of user equipment (UE) to serve the other UEs in its close vicinity. Successfully enabling such interaction among devices requires an attractive incentive mechanism. Therefore, we propose a contract theory-based incentive mechanism for enabling on-device caching for AR-based applications. In our approach, the MEC offers a reward to the UE for providing its resources (i.e., storage capacity, power, etc.). Furthermore, under the information asymmetry problem, we derive an optimal mechanism via the contract theory for enabling on-device caching subject to the individual rationality and incentive-compatible constraints. Finally, we perform numerical evaluations to validate the effectiveness of our proposed scheme.

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 article, 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.

Edge-of-Things (EoT)-based healthcare services are forthcoming patient-care amenities related to autonomic and persuasive healthcare, where an EoT broker usually works as a middleman between the Healthcare Service Consumers (HSC) and Computing Service Providers (CSP). The computing service providers are the edge computing service providers (ECSP) and cloud computing service provider (CCSP). Sensor observations from a patient’s body area networks (BAN) and patients’ medical and genetic historical data are very sensitive and have a high degree of interdependency. It follows that EoT based patient monitoring systems or applications are tightly coupled and require obstinate synchronization. Therefore, this paper proposes a portfolio optimization solution for the selection of virtual machines (VMs) of edge and/or cloud computing service providers. The dynamic pricing for an EoT computation service is considered by the EoT broker for optimal VM provisioning in an EoT environment. The proposed portfolio optimization solution is compared with the traditional certainty equivalent approach. As the portfolio optimization is a centralized solution approach, this paper also proposes an alternating direction method of multipliers (ADMM) based distributed provisioning method for the healthcare data in the EoT computing environment. A comparative study shows the cost-effective provisioning for the healthcare data through portfolio optimization and ADMM methods over the traditional certainty equivalent and greedy approach, respectively.

Wireless Power Transmission (WPT) is a technique to charge electrical devices (EDs) remotely. In WPT, power source (Smart Wireless Charger) transmits power wirelessly, using air as the medium, to EDs. In this paper, we present an Auction mechanism to obtain the energy trading between Smart Wireless Chargers (SWCs) and EDs. In our proposed Double-Auction based charging trade mechanism, our priorities are to increase utility of the SWCs as well as increase EDs utilities. In our proposal, first we analyze the system architecture of the WPT environment and then form an optimization problem for the auction system. We then, introduce two algorithms to solve the combinatorial optimization problem such that the wireless charging system is stable and have high efficiency. We have numerically analyzed our system using python, the results show that the proposed mechanism achieve higher total utility for the whole system with satisfying budget balancing, individual rationality and truthfulness.

An autonomous car is a self-driving car that is to keep the human being out of the car and to relieve them from the task of driving. An autonomous car can make more convenient, safer, and less energy intensive. In addition, Green Light Optimal Speed Advisory (GLOSA) systems reduce the travel time and CO2emission. In this paper, we propose a novel GLOSA, called R-GLOSA system to support to autonomous cars. We assume that an autonomous car can access to all traffic light schedules that it will encounter on its route. The route is divided into each segment according to traffic lights. In each segment, an autonomous car can communicate to Road Side Units (RSUs) distributed among the road. An autonomous car collects the road information transmitted by an RSU and then, it optimizes speed in order to arrive at the intersection when the light is green. The R-GLOSA system provides an autonomous car with speed advisory for each RSU's coverage. The simulation results show that an autonomous car using R-GLOSA system outperforms in terms of travel time and waiting time compared to using single-segment and multi-segment GLOSA system.

At the present, the traffic is really in a mess when the number of vehicles is increasing rapidly. As a consequence, finding a parking space is remarkably difficult and expensive. Therefore, solving this problem has attracted the attention of both scientists and companies. Our study also focuses on solving parking problem to relieve the traffic congestion, reduce air pollution and enhance driving effectively. However, unlike other studies, we consider parking problem in the view of IoT. From this perspective, Fog Computing and Roadside Cloud are utilized to find a vacant spot. By utilizing this infrastructures, any parking space at many places can be shared. Then, we analyze and apply the matching theory to solve the parking problem. Accordingly, our proposal not only helps drivers finding an ideal available space but also brings the owners of these places profit. Simulation results demonstrate that the proposed approach is a reliable solution for the finding parking slot.