ترغب بنشر مسار تعليمي؟ اضغط هنا

An Online Scheduling Algorithm for Energy Minimization in Wireless Powered Mobile Edge Computing Networks

187   0   0.0 ( 0 )
 نشر من قبل Xingqiu He
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The integration of Mobile Edge Computing (MEC) and Wireless Power Transfer (WPT), which is usually referred to as Wireless Powered Mobile Edge Computing (WP-MEC), has been recognized as a promising technique to enhance the lifetime and computation capacity of wireless devices (WDs). Compared to the conventional battery-powered MEC networks, WP-MEC brings new challenges to the computation scheduling problem because we have to jointly optimize the resource allocation in WPT and computation offloading. In this paper, we consider the energy minimization problem for WP-MEC networks with multiple WDs and multiple access points. We design an online algorithm by transforming the original problem into a series of deterministic optimization problems based on the Lyapunov optimization theory. To reduce the time complexity of our algorithm, the optimization problem is relaxed and decomposed into several independent subproblems. After solving each subproblem, we adjust the computed values of variables to obtain a feasible solution. Extensive simulations are conducted to validate the performance of the proposed algorithm.



قيم البحث

اقرأ أيضاً

Future IoT networks consist of heterogeneous types of IoT devices (with various communication types and energy constraints) which are assumed to belong to an IoT service provider (ISP). To power backscattering-based and wireless-powered devices, the ISP has to contract with an energy service provider (ESP). This article studies the strategic interactions between the ISP and its ESP and their implications on the joint optimal time scheduling and energy trading for heterogeneous devices. To that end, we propose an economic framework using the Stackelberg game to maximize the network throughput and energy efficiency of both the ISP and ESP. Specifically, the ISP leads the game by sending its optimal service time and energy price request (that maximizes its profit) to the ESP. The ESP then optimizes and supplies the transmission power which satisfies the ISPs request (while maximizing ESPs utility). To obtain the Stackelberg equilibrium (SE), we apply a backward induction technique which first derives a closed-form solution for the ESP. Then, to tackle the non-convex optimization problem for the ISP, we leverage the block coordinate descent and convex-concave procedure techniques to design two partitioning schemes (i.e., partial adjustment (PA) and joint adjustment (JA)) to find the optimal energy price and service time that constitute local SEs. Numerical results reveal that by jointly optimizing the energy trading and the time allocation for heterogeneous IoT devices, one can achieve significant improvements in terms of the ISPs profit compared with those of conventional transmission methods. Different tradeoffs between the ESPs and ISPs profits and complexities of the PA/JA schemes can also be numerically tuned. Simulations also show that the obtained local SEs approach the socially optimal welfare when the ISPs benefit per transmitted bit is higher than a given threshold.
Mobile-edge computing (MEC) and wireless power transfer are technologies that can assist in the implementation of next generation wireless networks, which will deploy a large number of computational and energy limited devices. In this letter, we cons ider a point-to-point MEC system, where the device harvests energy from the access points (APs) transmitted signal to power the offloading and/or the local computation of a task. By taking into account the non-linearities of energy harvesting, we provide analytical expressions for the probability of successful computation and for the average number of successfully computed bits. Our results show that a hybrid scheme of partial offloading and local computation is not always efficient. In particular, the decision to offload and/or compute locally, depends on the systems parameters such as the distance to the AP and the number of bits that need to be computed.
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to min imize maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.
Interactive applications with automated feedback will largely influence the design of future networked infrastructures. In such applications, status information about an environment of interest is captured and forwarded to a compute node, which analy zes the information and generates a feedback message. Timely processing and forwarding must ensure the feedback information to be still applicable; thus, the quality-of-service parameter for such applications is the end-to-end latency over the entire loop. By modelling the communication of a feedback loop as a two-hop network, we address the problem of allocating network resources in order to minimize the delay violation probability (DVP), i.e. the probability of the end-to-end latency exceeding a target value. We investigate the influence of the network queue states along the network path on the performance of semi-static and dynamic scheduling policies. The former determine the schedule prior to the transmission of the packet, while the latter benefit from feedback on the queue states as time evolves and reallocate time slots depending on the queues evolution. The performance of the proposed policies is evaluated for variations in several system parameters and comparison baselines. Results show that the proposed semi-static policy achieves close-to-optimal DVP and the dynamic policy outperforms the state-of-the-art algorithms.
Mobile edge computing (MEC) is proposed to boost high-efficient and time-sensitive 5G applications. However, the microburst may occur even in lightly-loaded scenarios, which leads to the indeterministic service latency (i.e., unpredictable delay or d elay variation), hence hindering the deployment of MEC. Deterministic IP networking (DIP) has been proposed that can provide bounds on latency, and high reliability in the large-scale networks. Nevertheless, the direct migration of DIP into the MEC network is non-trivial owing to its original design for the Ethernet with homogeneous devices. Meanwhile, DIP also faces the challenges on the network throughput and scheduling flexibility. In this paper, we delve into the adoption of DIP for the MEC networks and some of the relevant aspects. A deterministic MEC (D-MEC) network is proposed to deliver the deterministic service (i.e., providing the MEC service with bounded service latency). In the D-MEC network, two mechanisms, including the cycle mapping and cycle shifting, are designed to enable: (i) seamless and deterministic transmission with heterogeneous underlaid resources; and (ii) traffic shaping on the edges to improve the resource utilization. We also formulate a joint configuration to maximize the network throughput with deterministic QoS guarantees. Extensive simulations verify that the proposed D-MEC network can achieve a deterministic MEC service, even in the highly-loaded scenarios.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا