290 research outputs found
POEM: Pricing Longer for Edge Computing in the Device Cloud
Multiple access mobile edge computing has been proposed as a promising
technology to bring computation services close to end users, by making good use
of edge cloud servers. In mobile device clouds (MDC), idle end devices may act
as edge servers to offer computation services for busy end devices. Most
existing auction based incentive mechanisms in MDC focus on only one round
auction without considering the time correlation. Moreover, although existing
single round auctions can also be used for multiple times, users should trade
with higher bids to get more resources in the cascading rounds of auctions,
then their budgets will run out too early to participate in the next auction,
leading to auction failures and the whole benefit may suffer. In this paper, we
formulate the computation offloading problem as a social welfare optimization
problem with given budgets of mobile devices, and consider pricing longer of
mobile devices. This problem is a multiple-choice multi-dimensional 0-1
knapsack problem, which is a NP-hard problem. We propose an auction framework
named MAFL for long-term benefits that runs a single round resource auction in
each round. Extensive simulation results show that the proposed auction
mechanism outperforms the single round by about 55.6% on the revenue on average
and MAFL outperforms existing double auction by about 68.6% in terms of the
revenue.Comment: 8 pages, 1 figure, Accepted by the 18th International Conference on
Algorithms and Architectures for Parallel Processing (ICA3PP
Energy harvesting network with wireless distributed computing
Bulky processing tasks are expected to burden the
limited resources of energy harvesters by draining the stored energy, and thereby, reaching rapidly to energy causality constraint. In such scenario, energy harvesters flip into sleep mode, and thereby, the execution time of the next task will be delayed until the energy harvesters revert back into active mode. To tackle this problem, this paper proposes a novel energy harvesting network (EHN) that deploys wireless distributed computing (WDC)
network within the decision making process (DMP). The DMP is formulated as constrained partially observable Markov decision process in order to enable the energy harvesters to act under uncertainty. Furthermore, various challenges of WDC networks, e.g., nominating the collaborating nodes and task allocation, have been addressed herein. Unlike conventional research works on WDC networks, a system model is proposed for WDC network based on
divisible load theory instead of graph theory. In addition, an adaptive task allocation algorithm is proposed to distribute the task efficiently among the collaborating nodes. Finally, the novel EHN system is analyzed and compared against the conventional research
works on WDC, offloading computing, and local computing-EHN, where the proposed system is found to outperform in terms of energy and delay
Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks
Mobile Edge Computing (MEC) pushes computing functionalities away from the
centralized cloud to the network edge, thereby meeting the latency requirements
of many emerging mobile applications and saving backhaul network bandwidth.
Although many existing works have studied computation offloading policies,
service caching is an equally, if not more important, design topic of MEC, yet
receives much less attention. Service caching refers to caching application
services and their related databases/libraries in the edge server (e.g.
MEC-enabled BS), thereby enabling corresponding computation tasks to be
executed. Because only a small number of application services can be cached in
resource-limited edge server at the same time, which services to cache has to
be judiciously decided to maximize the edge computing performance. In this
paper, we investigate the extremely compelling but much less studied problem of
dynamic service caching in MEC-enabled dense cellular networks. We propose an
efficient online algorithm, called OREO, which jointly optimizes dynamic
service caching and task offloading to address a number of key challenges in
MEC systems, including service heterogeneity, unknown system dynamics, spatial
demand coupling and decentralized coordination. Our algorithm is developed
based on Lyapunov optimization and Gibbs sampling, works online without
requiring future information, and achieves provable close-to-optimal
performance. Simulation results show that our algorithm can effectively reduce
computation latency for end users while keeping energy consumption low
Offloading Decision Algorithm Based on Distance Weighted K-Nearest Neighbor in Power Internet of Things
With the widespread popularity of power Internet of Things (PIoT), the data collected from smart meters are growing explosively, which makes the calculation task of power data more and more complex. In order to improve computing power and maximize resource utilization, an offloading decision algorithm based on weighted K-nearest neighbor (WKNN) is proposed. It first collects the training set required by the WKNN-based algorithm, including the Received Signal Strength (RSS) required for offloading, the transmission rate, and the load balance of the Access Point (AP), and then the Euclidean distance between the training set and the sample is weighted by Gaussian function. Finally, the result with the largest K similarities in the training set is the offloading result. The simulation results show that the proposed algorithm reduces the offloading delay of the computing tasks and improves the resource utilization rate effectively when the number of meters increases in the network, which ensures that the resources of the mobile edge computing (MEC) servers in the system can be effectively and evenly utilized
Spatio-temporal Edge Service Placement: A Bandit Learning Approach
Shared edge computing platforms deployed at the radio access network are
expected to significantly improve quality of service delivered by Application
Service Providers (ASPs) in a flexible and economic way. However, placing edge
service in every possible edge site by an ASP is practically infeasible due to
the ASP's prohibitive budget requirement. In this paper, we investigate the
edge service placement problem of an ASP under a limited budget, where the ASP
dynamically rents computing/storage resources in edge sites to host its
applications in close proximity to end users. Since the benefit of placing edge
service in a specific site is usually unknown to the ASP a priori, optimal
placement decisions must be made while learning this benefit. We pose this
problem as a novel combinatorial contextual bandit learning problem. It is
"combinatorial" because only a limited number of edge sites can be rented to
provide the edge service given the ASP's budget. It is "contextual" because we
utilize user context information to enable finer-grained learning and decision
making. To solve this problem and optimize the edge computing performance, we
propose SEEN, a Spatial-temporal Edge sErvice placemeNt algorithm. Furthermore,
SEEN is extended to scenarios with overlapping service coverage by
incorporating a disjunctively constrained knapsack problem. In both cases, we
prove that our algorithm achieves a sublinear regret bound when it is compared
to an oracle algorithm that knows the exact benefit information. Simulations
are carried out on a real-world dataset, whose results show that SEEN
significantly outperforms benchmark solutions
Mobile data and computation offloading in mobile cloud computing
Le trafic mobile augmente considérablement en raison de la popularité des appareils mobiles et des applications mobiles. Le déchargement de données mobiles est une solution permettant de réduire la congestion du réseau cellulaire. Le déchargement de calcul mobile peut déplacer les tâches de calcul d'appareils mobiles vers le cloud. Dans cette thèse, nous étudions d'abord le problème du déchargement de données mobiles dans l'architecture du cloud computing mobile. Afin de minimiser les coûts de transmission des données, nous formulons le processus de déchargement des données sous la forme d'un processus de décision de Markov à horizon fini. Nous proposons deux algorithmes de déchargement des données pour un coût minimal. Ensuite, nous considérons un marché sur lequel un opérateur de réseau mobile peut vendre de la bande passante à des utilisateurs mobiles. Nous formulons ce problème sous la forme d'une enchère comportant plusieurs éléments afin de maximiser les bénéfices de l'opérateur de réseau mobile. Nous proposons un algorithme d'optimisation robuste et deux algorithmes itératifs pour résoudre ce problème. Enfin, nous nous concentrons sur les problèmes d'équilibrage de charge afin de minimiser la latence du déchargement des calculs. Nous formulons ce problème comme un jeu de population. Nous proposons deux algorithmes d'équilibrage de la charge de travail basés sur la dynamique évolutive et des protocoles de révision. Les résultats de la simulation montrent l'efficacité et la robustesse des méthodes proposées.Global mobile traffic is increasing dramatically due to the popularity of smart mobile devices and data hungry mobile applications. Mobile data offloading is considered as a promising solution to alleviate congestion in cellular network. Mobile computation offloading can move computation intensive tasks and large data storage from mobile devices to cloud. In this thesis, we first study mobile data offloading problem under the architecture of mobile cloud computing. In order to minimize the overall cost for data delivery, we formulate the data offloading process, as a finite horizon Markov decision process, and we propose two data offloading algorithms to achieve minimal communication cost. Then, we consider a mobile data offloading market where mobile network operator can sell bandwidth to mobile users. We formulate this problem as a multi-item auction in order to maximize the profit of mobile network operator. We propose one robust optimization algorithm and two iterative algorithms to solve this problem. Finally, we investigate computation offloading problem in mobile edge computing. We focus on workload balancing problems to minimize the transmission latency and computation latency of computation offloading. We formulate this problem as a population game, in order to analyze the aggregate offloading decisions, and we propose two workload balancing algorithms based on evolutionary dynamics and revision protocols. Simulation results show the efficiency and robustness of our proposed methods
- …