scispace - formally typeset
Search or ask a question
Topic

Edge computing

About: Edge computing is a research topic. Over the lifetime, 11657 publications have been published within this topic receiving 148533 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A key benefit of connecting edge and cloud computing is the capability to achieve high-throughput under high concurrent accesses, mobility support, real-time processing guarantees, and data persistency.
Abstract: A key benefit of connecting edge and cloud computing is the capability to achieve high-throughput under high concurrent accesses, mobility support, real-time processing guarantees, and data persistency. For example, the elastic provisioning and storage capabilities provided by cloud computing allow us to cope with scalability, persistency and reliability requirements and to adapt the infrastructure capacity to the exacting needs based on the amount of generated data.

111 citations

Journal ArticleDOI
TL;DR: An energy-aware model basis on the marine predators algorithm (MPA) is proposed for tackling the task scheduling in fog computing (TSFC) to improve the quality of service (QoS) required by users.
Abstract: To improve the quality of service (QoS) needed by several applications areas, the Internet of Things (IoT) tasks are offloaded into the fog computing instead of the cloud. However, the availability of ongoing energy heads for fog computing servers is one of the constraints for IoT applications because transmitting the huge quantity of the data generated using IoT devices will produce network bandwidth overhead and slow down the responsive time of the statements analyzed. In this article, an energy-aware model basis on the marine predators algorithm (MPA) is proposed for tackling the task scheduling in fog computing (TSFC) to improve the QoSs required by users. In addition to the standard MPA, we proposed the other two versions. The first version is called modified MPA (MMPA), which will modify MPA to improve their exploitation capability by using the last updated positions instead of the last best one. The second one will improve MMPA by the ranking strategy based reinitialization and mutation toward the best, in addition to reinitializing, the half population randomly after a predefined number of iterations to get rid of local optima and mutated the last half toward the best-so-far solution. Accordingly, MPA is proposed to solve the continuous one, whereas the TSFC is considered a discrete one, so the normalization and scaling phase will be used to convert the standard MPA into a discrete one. The three versions are proposed with some other metaheuristic algorithms and genetic algorithms based on various performance metrics such as energy consumption, makespan, flow time, and carbon dioxide emission rate. The improved MMPA could outperform all the other algorithms and the other two versions.

110 citations

Journal ArticleDOI
TL;DR: This article studies in this article how to allocate edge resources for average service response time minimization and proposes algorithms to achieve this goal.
Abstract: With IoT-based smart cities, massive heterogeneous IoT devices are running diverse advanced services for unprecedented intelligence and efficiency in various domains of city life. Given the exponentially growing number of IoT devices and the large number of smart city services as well as their different QoS requirements, it has been a big challenge for servers to optimally allocate limited resources to all hosted applications for satisfactory performance. Note that by pushing the computing and storage resources to the proximity of end IoT devices, and deploying applications in distributed edge servers, edge computing technology appears to be a promising solution for this challenge. Toward this, we study in this article how to allocate edge resources for average service response time minimization. Besides the proposed algorithms, extensive numerical results are also presented to validate their efficacy.

110 citations

Journal ArticleDOI
TL;DR: A computation offloading method for IoV, named COV, is designed to solve the multi-objective optimization problem to select suitable destination ENs, which aims to minimize the vehicle application offloading delay and offloading cost as well as realizing the load balance of ENs.
Abstract: The Internet of Vehicles (IoV) is employed to gather real-time traffic information for drivers, and base stations in 5G systems are used to assist in traffic data transmission. For rapid implementation, the applications in vehicles are available to be offloaded to edge nodes (ENs) which are enhanced from micro base stations. Despite the benefits of IoV and ENs, the explosive growth of offloaded vehicle applications exceeds the capacity of ENs, causing the overload of fractional ENs. Therefore, it is necessary to offload the computing applications in overloaded ENs to other idle ENs, while it is a challenge to select appropriate offloading destination ENs. In this paper, we first consider edge computing framework for computation offloading in IoV under the architecture of 5G networks. We then formulate a multi-objective optimization problem to select suitable destination ENs, which aims to minimize the vehicle application offloading delay and offloading cost as well as realizing the load balance of ENs. Moreover, a computation offloading method for IoV, named COV, is designed to solve the multi-objective optimization problem. Finally, various simulation analyses demonstrate the effectiveness and efficiency of COV.

110 citations

Posted Content
TL;DR: A lightweight infrastructure of the PoW-based blockchains, where the computation-intensive part of the consensus process is offloaded to the cloud/fog and the real experimental results are employed to justify the proposed model.
Abstract: The mining process in blockchain requires solving a proof-of-work puzzle, which is resource expensive to implement in mobile devices due to the high computing power and energy needed. In this paper, we, for the first time, consider edge computing as an enabler for mobile blockchain. In particular, we study edge computing resource management and pricing to support mobile blockchain applications in which the mining process of miners can be offloaded to an edge computing service provider. We formulate a two-stage Stackelberg game to jointly maximize the profit of the edge computing service provider and the individual utilities of the miners. In the first stage, the service provider sets the price of edge computing nodes. In the second stage, the miners decide on the service demand to purchase based on the observed prices. We apply the backward induction to analyze the sub-game perfect equilibrium in each stage for both uniform and discriminatory pricing schemes. For the uniform pricing where the same price is applied to all miners, the existence and uniqueness of Stackelberg equilibrium are validated by identifying the best response strategies of the miners. For the discriminatory pricing where the different prices are applied to different miners, the Stackelberg equilibrium is proved to exist and be unique by capitalizing on the Variational Inequality theory. Further, the real experimental results are employed to justify our proposed model.

110 citations


Network Information
Related Topics (5)
Wireless sensor network
142K papers, 2.4M citations
93% related
Network packet
159.7K papers, 2.2M citations
93% related
Wireless network
122.5K papers, 2.1M citations
93% related
Server
79.5K papers, 1.4M citations
93% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,471
20223,274
20212,978
20203,397
20192,698
20181,649